./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/lockfree-3.1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:36:05,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:36:05,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:36:05,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:36:05,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:36:05,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:36:05,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:36:05,637 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:36:05,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:36:05,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:36:05,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:36:05,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:36:05,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:36:05,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:36:05,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:36:05,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:36:05,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:36:05,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:36:05,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:36:05,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:36:05,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:36:05,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:36:05,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:36:05,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:36:05,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:36:05,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:36:05,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:36:05,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:36:05,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:36:05,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:36:05,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:36:05,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:36:05,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:36:05,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:36:05,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:36:05,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:36:05,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:36:05,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:36:05,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:36:05,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:36:05,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:36:05,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:36:05,708 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:36:05,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:36:05,711 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:36:05,711 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:36:05,712 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:36:05,712 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:36:05,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:36:05,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:36:05,713 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:36:05,713 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:36:05,714 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:36:05,714 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:36:05,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:36:05,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:36:05,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:36:05,715 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:36:05,715 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:36:05,716 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:36:05,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:36:05,716 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:36:05,716 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:36:05,716 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:36:05,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:36:05,717 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:36:05,717 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:36:05,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:36:05,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:36:05,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:36:05,718 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:36:05,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:36:05,718 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:36:05,718 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f [2021-12-14 19:36:05,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:36:05,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:36:05,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:36:05,966 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:36:05,967 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:36:05,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.1.i [2021-12-14 19:36:06,042 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c347672a/2b6a31629a1146cdbc96832bcd6aaab8/FLAGd860e8b21 [2021-12-14 19:36:06,468 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:36:06,468 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.1.i [2021-12-14 19:36:06,479 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c347672a/2b6a31629a1146cdbc96832bcd6aaab8/FLAGd860e8b21 [2021-12-14 19:36:06,810 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c347672a/2b6a31629a1146cdbc96832bcd6aaab8 [2021-12-14 19:36:06,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:36:06,813 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:36:06,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:36:06,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:36:06,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:36:06,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:36:06" (1/1) ... [2021-12-14 19:36:06,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@706c5498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:06, skipping insertion in model container [2021-12-14 19:36:06,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:36:06" (1/1) ... [2021-12-14 19:36:06,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:36:06,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:36:07,133 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:36:07,142 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:36:07,191 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:36:07,220 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:36:07,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:07 WrapperNode [2021-12-14 19:36:07,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:36:07,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:36:07,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:36:07,223 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:36:07,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:07" (1/1) ... [2021-12-14 19:36:07,258 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:07" (1/1) ... [2021-12-14 19:36:07,285 INFO L137 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2021-12-14 19:36:07,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:36:07,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:36:07,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:36:07,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:36:07,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:07" (1/1) ... [2021-12-14 19:36:07,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:07" (1/1) ... [2021-12-14 19:36:07,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:07" (1/1) ... [2021-12-14 19:36:07,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:07" (1/1) ... [2021-12-14 19:36:07,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:07" (1/1) ... [2021-12-14 19:36:07,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:07" (1/1) ... [2021-12-14 19:36:07,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:07" (1/1) ... [2021-12-14 19:36:07,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:36:07,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:36:07,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:36:07,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:36:07,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:07" (1/1) ... [2021-12-14 19:36:07,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:36:07,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:36:07,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 19:36:07,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 19:36:07,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:36:07,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:36:07,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:36:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:36:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:36:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:36:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:36:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:36:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:36:07,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:36:07,476 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:36:07,477 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:36:07,728 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:36:07,734 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:36:07,734 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-14 19:36:07,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:36:07 BoogieIcfgContainer [2021-12-14 19:36:07,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:36:07,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:36:07,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:36:07,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:36:07,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:36:06" (1/3) ... [2021-12-14 19:36:07,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404d9235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:36:07, skipping insertion in model container [2021-12-14 19:36:07,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:07" (2/3) ... [2021-12-14 19:36:07,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404d9235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:36:07, skipping insertion in model container [2021-12-14 19:36:07,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:36:07" (3/3) ... [2021-12-14 19:36:07,743 INFO L111 eAbstractionObserver]: Analyzing ICFG lockfree-3.1.i [2021-12-14 19:36:07,747 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:36:07,747 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2021-12-14 19:36:07,779 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:36:07,784 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 19:36:07,784 INFO L340 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2021-12-14 19:36:07,796 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:07,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-14 19:36:07,800 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:07,801 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-14 19:36:07,801 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:07,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:07,805 INFO L85 PathProgramCache]: Analyzing trace with hash 28819106, now seen corresponding path program 1 times [2021-12-14 19:36:07,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:07,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580270640] [2021-12-14 19:36:07,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:07,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:07,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:07,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:36:07,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580270640] [2021-12-14 19:36:07,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580270640] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:36:07,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:36:07,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:36:07,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778267386] [2021-12-14 19:36:07,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:36:07,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 19:36:07,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:36:07,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 19:36:07,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 19:36:07,938 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:07,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:07,951 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2021-12-14 19:36:07,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 19:36:07,953 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-14 19:36:07,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:07,959 INFO L225 Difference]: With dead ends: 64 [2021-12-14 19:36:07,960 INFO L226 Difference]: Without dead ends: 62 [2021-12-14 19:36:07,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 19:36:07,964 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:07,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:07,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-14 19:36:07,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-12-14 19:36:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:07,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2021-12-14 19:36:07,991 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2021-12-14 19:36:07,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:07,992 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2021-12-14 19:36:07,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:07,992 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2021-12-14 19:36:07,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:36:07,993 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:07,993 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:07,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:36:07,993 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:07,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:07,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1806851052, now seen corresponding path program 1 times [2021-12-14 19:36:07,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:07,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97970437] [2021-12-14 19:36:07,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:07,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:08,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:36:08,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97970437] [2021-12-14 19:36:08,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97970437] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:36:08,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:36:08,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:36:08,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745011498] [2021-12-14 19:36:08,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:36:08,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:36:08,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:36:08,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:36:08,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:36:08,028 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:08,043 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2021-12-14 19:36:08,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:36:08,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-14 19:36:08,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:08,047 INFO L225 Difference]: With dead ends: 63 [2021-12-14 19:36:08,047 INFO L226 Difference]: Without dead ends: 63 [2021-12-14 19:36:08,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:36:08,052 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:08,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:08,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-14 19:36:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-12-14 19:36:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2021-12-14 19:36:08,066 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 7 [2021-12-14 19:36:08,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:08,067 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2021-12-14 19:36:08,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2021-12-14 19:36:08,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:36:08,069 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:08,071 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:08,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:36:08,071 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:08,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:08,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910634, now seen corresponding path program 1 times [2021-12-14 19:36:08,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:08,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223902916] [2021-12-14 19:36:08,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:08,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:08,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:08,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:36:08,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223902916] [2021-12-14 19:36:08,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223902916] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:36:08,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:36:08,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:36:08,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977187222] [2021-12-14 19:36:08,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:36:08,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:36:08,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:36:08,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:36:08,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:36:08,135 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:08,184 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2021-12-14 19:36:08,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:36:08,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-14 19:36:08,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:08,185 INFO L225 Difference]: With dead ends: 111 [2021-12-14 19:36:08,186 INFO L226 Difference]: Without dead ends: 111 [2021-12-14 19:36:08,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:36:08,187 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:08,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:08,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-14 19:36:08,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2021-12-14 19:36:08,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 92 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2021-12-14 19:36:08,219 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 7 [2021-12-14 19:36:08,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:08,219 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2021-12-14 19:36:08,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,220 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2021-12-14 19:36:08,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 19:36:08,220 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:08,220 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:08,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:36:08,220 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:08,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:08,221 INFO L85 PathProgramCache]: Analyzing trace with hash 177749355, now seen corresponding path program 1 times [2021-12-14 19:36:08,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:08,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535325379] [2021-12-14 19:36:08,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:08,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:08,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:36:08,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535325379] [2021-12-14 19:36:08,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535325379] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:36:08,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:36:08,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:36:08,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289005074] [2021-12-14 19:36:08,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:36:08,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:36:08,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:36:08,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:36:08,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:36:08,287 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:08,336 INFO L93 Difference]: Finished difference Result 101 states and 146 transitions. [2021-12-14 19:36:08,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:36:08,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-14 19:36:08,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:08,338 INFO L225 Difference]: With dead ends: 101 [2021-12-14 19:36:08,338 INFO L226 Difference]: Without dead ends: 101 [2021-12-14 19:36:08,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:36:08,346 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:08,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 215 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:08,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-14 19:36:08,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2021-12-14 19:36:08,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 94 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 139 transitions. [2021-12-14 19:36:08,362 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 139 transitions. Word has length 8 [2021-12-14 19:36:08,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:08,363 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 139 transitions. [2021-12-14 19:36:08,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 139 transitions. [2021-12-14 19:36:08,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 19:36:08,364 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:08,364 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:08,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:36:08,365 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:08,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:08,366 INFO L85 PathProgramCache]: Analyzing trace with hash 179653412, now seen corresponding path program 1 times [2021-12-14 19:36:08,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:08,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695639977] [2021-12-14 19:36:08,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:08,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:08,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:36:08,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695639977] [2021-12-14 19:36:08,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695639977] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:36:08,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:36:08,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:36:08,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413676358] [2021-12-14 19:36:08,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:36:08,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:36:08,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:36:08,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:36:08,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:36:08,401 INFO L87 Difference]: Start difference. First operand 95 states and 139 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:08,455 INFO L93 Difference]: Finished difference Result 177 states and 261 transitions. [2021-12-14 19:36:08,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:36:08,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-14 19:36:08,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:08,457 INFO L225 Difference]: With dead ends: 177 [2021-12-14 19:36:08,457 INFO L226 Difference]: Without dead ends: 174 [2021-12-14 19:36:08,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:36:08,458 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:08,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:08,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-12-14 19:36:08,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 153. [2021-12-14 19:36:08,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 133 states have (on average 1.849624060150376) internal successors, (246), 152 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 246 transitions. [2021-12-14 19:36:08,470 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 246 transitions. Word has length 8 [2021-12-14 19:36:08,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:08,473 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 246 transitions. [2021-12-14 19:36:08,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,474 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2021-12-14 19:36:08,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 19:36:08,474 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:08,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:08,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:36:08,475 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:08,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:08,476 INFO L85 PathProgramCache]: Analyzing trace with hash 179596397, now seen corresponding path program 1 times [2021-12-14 19:36:08,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:08,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716115414] [2021-12-14 19:36:08,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:08,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:08,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:08,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:36:08,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716115414] [2021-12-14 19:36:08,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716115414] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:36:08,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:36:08,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:36:08,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113525081] [2021-12-14 19:36:08,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:36:08,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:36:08,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:36:08,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:36:08,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:36:08,518 INFO L87 Difference]: Start difference. First operand 153 states and 246 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:08,575 INFO L93 Difference]: Finished difference Result 229 states and 354 transitions. [2021-12-14 19:36:08,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:36:08,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-14 19:36:08,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:08,577 INFO L225 Difference]: With dead ends: 229 [2021-12-14 19:36:08,577 INFO L226 Difference]: Without dead ends: 229 [2021-12-14 19:36:08,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:36:08,578 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:08,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 172 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:36:08,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-12-14 19:36:08,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 208. [2021-12-14 19:36:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 190 states have (on average 1.7894736842105263) internal successors, (340), 207 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 340 transitions. [2021-12-14 19:36:08,600 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 340 transitions. Word has length 8 [2021-12-14 19:36:08,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:08,600 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 340 transitions. [2021-12-14 19:36:08,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,601 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 340 transitions. [2021-12-14 19:36:08,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 19:36:08,601 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:08,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:08,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:36:08,602 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:08,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:08,603 INFO L85 PathProgramCache]: Analyzing trace with hash 179596398, now seen corresponding path program 1 times [2021-12-14 19:36:08,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:08,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917022519] [2021-12-14 19:36:08,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:08,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:08,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:36:08,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917022519] [2021-12-14 19:36:08,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917022519] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:36:08,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:36:08,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:36:08,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029822473] [2021-12-14 19:36:08,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:36:08,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:36:08,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:36:08,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:36:08,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:36:08,660 INFO L87 Difference]: Start difference. First operand 208 states and 340 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:08,700 INFO L93 Difference]: Finished difference Result 224 states and 345 transitions. [2021-12-14 19:36:08,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:36:08,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-14 19:36:08,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:08,702 INFO L225 Difference]: With dead ends: 224 [2021-12-14 19:36:08,702 INFO L226 Difference]: Without dead ends: 224 [2021-12-14 19:36:08,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:36:08,703 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:08,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 179 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:08,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-12-14 19:36:08,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 206. [2021-12-14 19:36:08,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 190 states have (on average 1.7473684210526317) internal successors, (332), 205 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 332 transitions. [2021-12-14 19:36:08,715 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 332 transitions. Word has length 8 [2021-12-14 19:36:08,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:08,715 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 332 transitions. [2021-12-14 19:36:08,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,716 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 332 transitions. [2021-12-14 19:36:08,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 19:36:08,716 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:08,716 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:08,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:36:08,716 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:08,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:08,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1272529015, now seen corresponding path program 1 times [2021-12-14 19:36:08,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:08,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000451380] [2021-12-14 19:36:08,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:08,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:08,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:08,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:36:08,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000451380] [2021-12-14 19:36:08,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000451380] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:36:08,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:36:08,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:36:08,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119684371] [2021-12-14 19:36:08,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:36:08,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:36:08,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:36:08,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:36:08,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:36:08,749 INFO L87 Difference]: Start difference. First operand 206 states and 332 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:08,778 INFO L93 Difference]: Finished difference Result 265 states and 366 transitions. [2021-12-14 19:36:08,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:36:08,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-14 19:36:08,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:08,780 INFO L225 Difference]: With dead ends: 265 [2021-12-14 19:36:08,780 INFO L226 Difference]: Without dead ends: 265 [2021-12-14 19:36:08,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:36:08,781 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 105 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:08,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 279 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:08,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-12-14 19:36:08,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 163. [2021-12-14 19:36:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 151 states have (on average 1.6821192052980132) internal successors, (254), 162 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 254 transitions. [2021-12-14 19:36:08,785 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 254 transitions. Word has length 9 [2021-12-14 19:36:08,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:08,786 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 254 transitions. [2021-12-14 19:36:08,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 254 transitions. [2021-12-14 19:36:08,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:36:08,787 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:08,787 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:08,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:36:08,788 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:08,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:08,789 INFO L85 PathProgramCache]: Analyzing trace with hash 845049582, now seen corresponding path program 1 times [2021-12-14 19:36:08,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:08,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524063120] [2021-12-14 19:36:08,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:08,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:08,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:36:08,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524063120] [2021-12-14 19:36:08,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524063120] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:36:08,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:36:08,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:36:08,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936984916] [2021-12-14 19:36:08,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:36:08,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:36:08,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:36:08,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:36:08,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:36:08,816 INFO L87 Difference]: Start difference. First operand 163 states and 254 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:08,844 INFO L93 Difference]: Finished difference Result 362 states and 528 transitions. [2021-12-14 19:36:08,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:36:08,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-14 19:36:08,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:08,846 INFO L225 Difference]: With dead ends: 362 [2021-12-14 19:36:08,847 INFO L226 Difference]: Without dead ends: 362 [2021-12-14 19:36:08,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:36:08,847 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 107 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:08,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 232 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:08,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-12-14 19:36:08,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 234. [2021-12-14 19:36:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 222 states have (on average 1.6036036036036037) internal successors, (356), 233 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 356 transitions. [2021-12-14 19:36:08,854 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 356 transitions. Word has length 10 [2021-12-14 19:36:08,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:08,854 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 356 transitions. [2021-12-14 19:36:08,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 356 transitions. [2021-12-14 19:36:08,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:36:08,855 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:08,855 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:08,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 19:36:08,856 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:08,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:08,856 INFO L85 PathProgramCache]: Analyzing trace with hash 22246394, now seen corresponding path program 1 times [2021-12-14 19:36:08,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:08,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419127803] [2021-12-14 19:36:08,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:08,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:08,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:36:08,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419127803] [2021-12-14 19:36:08,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419127803] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:36:08,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690210755] [2021-12-14 19:36:08,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:08,911 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:36:08,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:36:08,916 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:36:08,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 19:36:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:08,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:36:08,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:09,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:09,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:09,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690210755] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:09,109 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:36:09,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2021-12-14 19:36:09,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559908419] [2021-12-14 19:36:09,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:09,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:36:09,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:36:09,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:36:09,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:36:09,111 INFO L87 Difference]: Start difference. First operand 234 states and 356 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:09,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:09,142 INFO L93 Difference]: Finished difference Result 238 states and 346 transitions. [2021-12-14 19:36:09,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:36:09,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 19:36:09,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:09,143 INFO L225 Difference]: With dead ends: 238 [2021-12-14 19:36:09,143 INFO L226 Difference]: Without dead ends: 238 [2021-12-14 19:36:09,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:36:09,144 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 142 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:09,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 338 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:09,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-14 19:36:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 230. [2021-12-14 19:36:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 218 states have (on average 1.5779816513761469) internal successors, (344), 229 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 344 transitions. [2021-12-14 19:36:09,158 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 344 transitions. Word has length 16 [2021-12-14 19:36:09,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:09,159 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 344 transitions. [2021-12-14 19:36:09,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 344 transitions. [2021-12-14 19:36:09,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:36:09,160 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:09,160 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:09,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:09,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-14 19:36:09,376 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:09,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:09,376 INFO L85 PathProgramCache]: Analyzing trace with hash 617603772, now seen corresponding path program 1 times [2021-12-14 19:36:09,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:09,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051155914] [2021-12-14 19:36:09,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:09,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:09,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:09,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:36:09,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051155914] [2021-12-14 19:36:09,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051155914] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:36:09,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332836388] [2021-12-14 19:36:09,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:09,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:36:09,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:36:09,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:36:09,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 19:36:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:09,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:36:09,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:09,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:09,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:09,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332836388] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:09,589 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:36:09,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2021-12-14 19:36:09,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812086819] [2021-12-14 19:36:09,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:09,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:36:09,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:36:09,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:36:09,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:36:09,590 INFO L87 Difference]: Start difference. First operand 230 states and 344 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:09,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:09,670 INFO L93 Difference]: Finished difference Result 525 states and 738 transitions. [2021-12-14 19:36:09,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:36:09,671 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 19:36:09,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:09,672 INFO L225 Difference]: With dead ends: 525 [2021-12-14 19:36:09,673 INFO L226 Difference]: Without dead ends: 525 [2021-12-14 19:36:09,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:36:09,673 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 243 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:09,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 510 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:09,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-12-14 19:36:09,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 323. [2021-12-14 19:36:09,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 311 states have (on average 1.5305466237942122) internal successors, (476), 322 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 476 transitions. [2021-12-14 19:36:09,679 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 476 transitions. Word has length 16 [2021-12-14 19:36:09,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:09,679 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 476 transitions. [2021-12-14 19:36:09,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:09,680 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 476 transitions. [2021-12-14 19:36:09,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:36:09,684 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:09,684 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:09,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:09,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-14 19:36:09,899 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:09,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:09,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1134377974, now seen corresponding path program 2 times [2021-12-14 19:36:09,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:09,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940512354] [2021-12-14 19:36:09,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:09,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 19:36:09,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:36:09,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940512354] [2021-12-14 19:36:09,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940512354] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:36:09,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514483967] [2021-12-14 19:36:09,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:36:09,938 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:36:09,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:36:09,939 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:36:09,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 19:36:09,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:36:09,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:36:09,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:36:09,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:10,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:10,085 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:10,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514483967] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:10,085 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:36:10,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2021-12-14 19:36:10,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299786491] [2021-12-14 19:36:10,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:10,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:36:10,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:36:10,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:36:10,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:36:10,087 INFO L87 Difference]: Start difference. First operand 323 states and 476 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:10,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:10,194 INFO L93 Difference]: Finished difference Result 525 states and 726 transitions. [2021-12-14 19:36:10,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:36:10,195 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-14 19:36:10,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:10,196 INFO L225 Difference]: With dead ends: 525 [2021-12-14 19:36:10,197 INFO L226 Difference]: Without dead ends: 525 [2021-12-14 19:36:10,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-12-14 19:36:10,197 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 498 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:10,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 420 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:36:10,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-12-14 19:36:10,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 323. [2021-12-14 19:36:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 311 states have (on average 1.4919614147909968) internal successors, (464), 322 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 464 transitions. [2021-12-14 19:36:10,204 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 464 transitions. Word has length 22 [2021-12-14 19:36:10,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:10,204 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 464 transitions. [2021-12-14 19:36:10,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 464 transitions. [2021-12-14 19:36:10,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 19:36:10,205 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:10,205 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:10,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:10,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:36:10,419 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:10,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:10,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1692627395, now seen corresponding path program 1 times [2021-12-14 19:36:10,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:10,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728718500] [2021-12-14 19:36:10,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:10,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:10,450 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:10,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:36:10,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728718500] [2021-12-14 19:36:10,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728718500] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:36:10,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404088759] [2021-12-14 19:36:10,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:10,452 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:36:10,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:36:10,453 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:36:10,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 19:36:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:10,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-14 19:36:10,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:10,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:10,657 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:10,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404088759] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:10,657 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:36:10,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2021-12-14 19:36:10,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264906664] [2021-12-14 19:36:10,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:10,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:36:10,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:36:10,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:36:10,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:36:10,659 INFO L87 Difference]: Start difference. First operand 323 states and 464 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:10,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:10,711 INFO L93 Difference]: Finished difference Result 932 states and 1332 transitions. [2021-12-14 19:36:10,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:36:10,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-14 19:36:10,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:10,715 INFO L225 Difference]: With dead ends: 932 [2021-12-14 19:36:10,715 INFO L226 Difference]: Without dead ends: 932 [2021-12-14 19:36:10,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:36:10,716 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 173 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:10,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 165 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:10,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2021-12-14 19:36:10,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 811. [2021-12-14 19:36:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 799 states have (on average 1.4793491864831039) internal successors, (1182), 810 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1182 transitions. [2021-12-14 19:36:10,729 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1182 transitions. Word has length 24 [2021-12-14 19:36:10,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:10,729 INFO L470 AbstractCegarLoop]: Abstraction has 811 states and 1182 transitions. [2021-12-14 19:36:10,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:10,729 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1182 transitions. [2021-12-14 19:36:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:36:10,730 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:10,730 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:10,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:10,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:36:10,951 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:10,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:10,952 INFO L85 PathProgramCache]: Analyzing trace with hash -6965384, now seen corresponding path program 1 times [2021-12-14 19:36:10,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:10,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866281018] [2021-12-14 19:36:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:10,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:10,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:10,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:36:10,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866281018] [2021-12-14 19:36:10,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866281018] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:36:10,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643716271] [2021-12-14 19:36:10,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:10,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:36:10,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:36:10,999 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:36:11,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 19:36:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:11,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:36:11,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:11,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:11,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643716271] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:11,187 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:36:11,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2021-12-14 19:36:11,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025530628] [2021-12-14 19:36:11,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:11,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:36:11,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:36:11,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:36:11,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:36:11,189 INFO L87 Difference]: Start difference. First operand 811 states and 1182 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:11,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:11,298 INFO L93 Difference]: Finished difference Result 2807 states and 3858 transitions. [2021-12-14 19:36:11,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 19:36:11,298 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-14 19:36:11,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:11,306 INFO L225 Difference]: With dead ends: 2807 [2021-12-14 19:36:11,307 INFO L226 Difference]: Without dead ends: 2807 [2021-12-14 19:36:11,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-14 19:36:11,307 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 693 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:11,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [693 Valid, 493 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:11,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2021-12-14 19:36:11,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 1879. [2021-12-14 19:36:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1867 states have (on average 1.432244242099625) internal successors, (2674), 1878 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2674 transitions. [2021-12-14 19:36:11,337 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2674 transitions. Word has length 27 [2021-12-14 19:36:11,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:11,337 INFO L470 AbstractCegarLoop]: Abstraction has 1879 states and 2674 transitions. [2021-12-14 19:36:11,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2674 transitions. [2021-12-14 19:36:11,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:36:11,338 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:11,338 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:11,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:11,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-14 19:36:11,547 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:11,548 INFO L85 PathProgramCache]: Analyzing trace with hash 554127938, now seen corresponding path program 1 times [2021-12-14 19:36:11,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:11,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33007636] [2021-12-14 19:36:11,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:11,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:11,603 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:36:11,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:36:11,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33007636] [2021-12-14 19:36:11,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33007636] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:36:11,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539542445] [2021-12-14 19:36:11,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:11,604 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:36:11,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:36:11,607 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:36:11,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 19:36:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:11,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 19:36:11,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:36:11,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:36:11,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539542445] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:11,815 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:36:11,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2021-12-14 19:36:11,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801310928] [2021-12-14 19:36:11,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:11,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:36:11,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:36:11,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:36:11,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:36:11,817 INFO L87 Difference]: Start difference. First operand 1879 states and 2674 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:11,885 INFO L93 Difference]: Finished difference Result 1558 states and 2125 transitions. [2021-12-14 19:36:11,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:36:11,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-14 19:36:11,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:11,890 INFO L225 Difference]: With dead ends: 1558 [2021-12-14 19:36:11,890 INFO L226 Difference]: Without dead ends: 1558 [2021-12-14 19:36:11,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:36:11,892 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 376 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:11,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 520 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2021-12-14 19:36:11,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 885. [2021-12-14 19:36:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 873 states have (on average 1.404352806414662) internal successors, (1226), 884 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:11,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1226 transitions. [2021-12-14 19:36:11,907 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1226 transitions. Word has length 27 [2021-12-14 19:36:11,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:11,907 INFO L470 AbstractCegarLoop]: Abstraction has 885 states and 1226 transitions. [2021-12-14 19:36:11,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:11,908 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1226 transitions. [2021-12-14 19:36:11,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-14 19:36:11,910 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:11,910 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:11,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:12,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-14 19:36:12,124 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:12,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:12,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2001409998, now seen corresponding path program 1 times [2021-12-14 19:36:12,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:12,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253323773] [2021-12-14 19:36:12,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:12,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-12-14 19:36:12,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:36:12,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253323773] [2021-12-14 19:36:12,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253323773] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:36:12,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24275026] [2021-12-14 19:36:12,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:12,205 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:36:12,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:36:12,206 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:36:12,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 19:36:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:12,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 19:36:12,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:12,418 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:12,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:12,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24275026] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:12,533 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:36:12,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 13 [2021-12-14 19:36:12,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373134888] [2021-12-14 19:36:12,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:12,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 19:36:12,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:36:12,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 19:36:12,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:36:12,534 INFO L87 Difference]: Start difference. First operand 885 states and 1226 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:12,841 INFO L93 Difference]: Finished difference Result 2448 states and 3223 transitions. [2021-12-14 19:36:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-14 19:36:12,841 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-12-14 19:36:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:12,848 INFO L225 Difference]: With dead ends: 2448 [2021-12-14 19:36:12,848 INFO L226 Difference]: Without dead ends: 2448 [2021-12-14 19:36:12,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2021-12-14 19:36:12,849 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 955 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:12,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [955 Valid, 1087 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:36:12,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2021-12-14 19:36:12,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 984. [2021-12-14 19:36:12,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 972 states have (on average 1.4207818930041152) internal successors, (1381), 983 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:12,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1381 transitions. [2021-12-14 19:36:12,871 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1381 transitions. Word has length 51 [2021-12-14 19:36:12,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:12,871 INFO L470 AbstractCegarLoop]: Abstraction has 984 states and 1381 transitions. [2021-12-14 19:36:12,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:12,872 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1381 transitions. [2021-12-14 19:36:12,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-14 19:36:12,873 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:12,873 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:12,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:13,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:36:13,096 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:13,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:13,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1426339750, now seen corresponding path program 1 times [2021-12-14 19:36:13,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:13,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551374483] [2021-12-14 19:36:13,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:13,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-14 19:36:13,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:36:13,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551374483] [2021-12-14 19:36:13,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551374483] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:36:13,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299260600] [2021-12-14 19:36:13,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:13,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:36:13,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:36:13,164 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:36:13,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 19:36:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:13,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 19:36:13,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:13,383 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-14 19:36:13,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-14 19:36:13,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299260600] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-14 19:36:13,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:36:13,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2021-12-14 19:36:13,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899125979] [2021-12-14 19:36:13,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:36:13,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:36:13,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:36:13,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:36:13,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:36:13,496 INFO L87 Difference]: Start difference. First operand 984 states and 1381 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:13,604 INFO L93 Difference]: Finished difference Result 2310 states and 3137 transitions. [2021-12-14 19:36:13,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:36:13,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-12-14 19:36:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:13,610 INFO L225 Difference]: With dead ends: 2310 [2021-12-14 19:36:13,611 INFO L226 Difference]: Without dead ends: 2310 [2021-12-14 19:36:13,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-12-14 19:36:13,611 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 225 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:13,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 500 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:36:13,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2021-12-14 19:36:13,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 1632. [2021-12-14 19:36:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1620 states have (on average 1.3962962962962964) internal successors, (2262), 1631 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 2262 transitions. [2021-12-14 19:36:13,644 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 2262 transitions. Word has length 59 [2021-12-14 19:36:13,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:13,644 INFO L470 AbstractCegarLoop]: Abstraction has 1632 states and 2262 transitions. [2021-12-14 19:36:13,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:13,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 2262 transitions. [2021-12-14 19:36:13,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-14 19:36:13,646 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:13,646 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:13,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:13,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-14 19:36:13,860 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:13,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:13,860 INFO L85 PathProgramCache]: Analyzing trace with hash -443713253, now seen corresponding path program 1 times [2021-12-14 19:36:13,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:13,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662840308] [2021-12-14 19:36:13,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:13,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 27 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-14 19:36:13,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:36:13,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662840308] [2021-12-14 19:36:13,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662840308] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:36:13,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828645603] [2021-12-14 19:36:13,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:13,936 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:36:13,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:36:13,947 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:36:13,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 19:36:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:14,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 19:36:14,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-12-14 19:36:14,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:14,269 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-12-14 19:36:14,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828645603] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:14,269 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:36:14,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 12 [2021-12-14 19:36:14,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438963884] [2021-12-14 19:36:14,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:14,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 19:36:14,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:36:14,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 19:36:14,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:36:14,271 INFO L87 Difference]: Start difference. First operand 1632 states and 2262 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:15,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:15,307 INFO L93 Difference]: Finished difference Result 9160 states and 12491 transitions. [2021-12-14 19:36:15,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-12-14 19:36:15,308 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-12-14 19:36:15,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:15,336 INFO L225 Difference]: With dead ends: 9160 [2021-12-14 19:36:15,337 INFO L226 Difference]: Without dead ends: 9160 [2021-12-14 19:36:15,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=631, Invalid=2021, Unknown=0, NotChecked=0, Total=2652 [2021-12-14 19:36:15,351 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 1336 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:15,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1336 Valid, 820 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 19:36:15,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9160 states. [2021-12-14 19:36:15,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9160 to 4625. [2021-12-14 19:36:15,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4625 states, 4614 states have (on average 1.4195925444299957) internal successors, (6550), 4624 states have internal predecessors, (6550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 6550 transitions. [2021-12-14 19:36:15,459 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 6550 transitions. Word has length 59 [2021-12-14 19:36:15,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:15,459 INFO L470 AbstractCegarLoop]: Abstraction has 4625 states and 6550 transitions. [2021-12-14 19:36:15,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 6550 transitions. [2021-12-14 19:36:15,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-14 19:36:15,461 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:15,461 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:15,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:15,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-14 19:36:15,684 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:15,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:15,684 INFO L85 PathProgramCache]: Analyzing trace with hash -791217300, now seen corresponding path program 1 times [2021-12-14 19:36:15,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:15,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536118919] [2021-12-14 19:36:15,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:15,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:15,742 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 68 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-14 19:36:15,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:36:15,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536118919] [2021-12-14 19:36:15,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536118919] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:36:15,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140049242] [2021-12-14 19:36:15,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:15,743 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:36:15,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:36:15,744 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:36:15,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 19:36:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:15,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 19:36:15,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:15,980 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 101 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:36:15,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:16,120 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 103 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:36:16,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140049242] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:16,121 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:36:16,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2021-12-14 19:36:16,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889399569] [2021-12-14 19:36:16,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:16,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 19:36:16,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:36:16,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 19:36:16,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:36:16,123 INFO L87 Difference]: Start difference. First operand 4625 states and 6550 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:16,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:16,635 INFO L93 Difference]: Finished difference Result 10247 states and 14121 transitions. [2021-12-14 19:36:16,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-14 19:36:16,635 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-12-14 19:36:16,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:16,660 INFO L225 Difference]: With dead ends: 10247 [2021-12-14 19:36:16,661 INFO L226 Difference]: Without dead ends: 10247 [2021-12-14 19:36:16,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2021-12-14 19:36:16,662 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 978 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:16,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [978 Valid, 1477 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:36:16,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10247 states. [2021-12-14 19:36:16,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10247 to 4425. [2021-12-14 19:36:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4425 states, 4414 states have (on average 1.3948799275033983) internal successors, (6157), 4424 states have internal predecessors, (6157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:16,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4425 states to 4425 states and 6157 transitions. [2021-12-14 19:36:16,764 INFO L78 Accepts]: Start accepts. Automaton has 4425 states and 6157 transitions. Word has length 63 [2021-12-14 19:36:16,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:16,764 INFO L470 AbstractCegarLoop]: Abstraction has 4425 states and 6157 transitions. [2021-12-14 19:36:16,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:16,764 INFO L276 IsEmpty]: Start isEmpty. Operand 4425 states and 6157 transitions. [2021-12-14 19:36:16,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-14 19:36:16,766 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:16,766 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:16,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:16,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:36:16,979 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:16,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:16,980 INFO L85 PathProgramCache]: Analyzing trace with hash 767429099, now seen corresponding path program 1 times [2021-12-14 19:36:16,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:16,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344289848] [2021-12-14 19:36:16,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:16,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:17,065 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 72 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-14 19:36:17,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:36:17,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344289848] [2021-12-14 19:36:17,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344289848] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:36:17,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159477801] [2021-12-14 19:36:17,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:17,065 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:36:17,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:36:17,066 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:36:17,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 19:36:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:17,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-14 19:36:17,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-14 19:36:17,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:17,423 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-14 19:36:17,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159477801] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:17,423 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:36:17,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2021-12-14 19:36:17,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66124628] [2021-12-14 19:36:17,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:17,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 19:36:17,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:36:17,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 19:36:17,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:36:17,428 INFO L87 Difference]: Start difference. First operand 4425 states and 6157 transitions. Second operand has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:17,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:17,658 INFO L93 Difference]: Finished difference Result 3827 states and 5012 transitions. [2021-12-14 19:36:17,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 19:36:17,658 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-12-14 19:36:17,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:17,668 INFO L225 Difference]: With dead ends: 3827 [2021-12-14 19:36:17,669 INFO L226 Difference]: Without dead ends: 3827 [2021-12-14 19:36:17,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2021-12-14 19:36:17,671 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 957 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:17,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [957 Valid, 1487 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:36:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2021-12-14 19:36:17,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 2865. [2021-12-14 19:36:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2865 states, 2854 states have (on average 1.3135949544498948) internal successors, (3749), 2864 states have internal predecessors, (3749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:17,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 3749 transitions. [2021-12-14 19:36:17,755 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 3749 transitions. Word has length 63 [2021-12-14 19:36:17,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:17,755 INFO L470 AbstractCegarLoop]: Abstraction has 2865 states and 3749 transitions. [2021-12-14 19:36:17,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:17,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 3749 transitions. [2021-12-14 19:36:17,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-14 19:36:17,756 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:17,757 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:17,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:17,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:36:17,980 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:17,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:17,980 INFO L85 PathProgramCache]: Analyzing trace with hash 965172541, now seen corresponding path program 1 times [2021-12-14 19:36:17,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:36:17,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797466661] [2021-12-14 19:36:17,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:17,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:36:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 19:36:18,002 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 19:36:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 19:36:18,036 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 19:36:18,037 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 19:36:18,037 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2021-12-14 19:36:18,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (18 of 20 remaining) [2021-12-14 19:36:18,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (17 of 20 remaining) [2021-12-14 19:36:18,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (16 of 20 remaining) [2021-12-14 19:36:18,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (15 of 20 remaining) [2021-12-14 19:36:18,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (14 of 20 remaining) [2021-12-14 19:36:18,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (13 of 20 remaining) [2021-12-14 19:36:18,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (12 of 20 remaining) [2021-12-14 19:36:18,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (11 of 20 remaining) [2021-12-14 19:36:18,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (10 of 20 remaining) [2021-12-14 19:36:18,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (9 of 20 remaining) [2021-12-14 19:36:18,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (8 of 20 remaining) [2021-12-14 19:36:18,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (7 of 20 remaining) [2021-12-14 19:36:18,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (6 of 20 remaining) [2021-12-14 19:36:18,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (5 of 20 remaining) [2021-12-14 19:36:18,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (4 of 20 remaining) [2021-12-14 19:36:18,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (3 of 20 remaining) [2021-12-14 19:36:18,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2021-12-14 19:36:18,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2021-12-14 19:36:18,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2021-12-14 19:36:18,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-14 19:36:18,045 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:18,047 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 19:36:18,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 07:36:18 BoogieIcfgContainer [2021-12-14 19:36:18,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 19:36:18,094 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 19:36:18,094 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 19:36:18,094 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 19:36:18,095 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:36:07" (3/4) ... [2021-12-14 19:36:18,097 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 19:36:18,097 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 19:36:18,097 INFO L158 Benchmark]: Toolchain (without parser) took 11284.31ms. Allocated memory was 79.7MB in the beginning and 174.1MB in the end (delta: 94.4MB). Free memory was 48.6MB in the beginning and 105.4MB in the end (delta: -56.8MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2021-12-14 19:36:18,098 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 79.7MB. Free memory was 48.9MB in the beginning and 48.9MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:36:18,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.74ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 48.4MB in the beginning and 66.7MB in the end (delta: -18.3MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2021-12-14 19:36:18,098 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.25ms. Allocated memory is still 96.5MB. Free memory was 66.7MB in the beginning and 64.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:36:18,099 INFO L158 Benchmark]: Boogie Preprocessor took 47.86ms. Allocated memory is still 96.5MB. Free memory was 64.6MB in the beginning and 63.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:36:18,099 INFO L158 Benchmark]: RCFGBuilder took 400.69ms. Allocated memory is still 96.5MB. Free memory was 63.2MB in the beginning and 70.6MB in the end (delta: -7.4MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2021-12-14 19:36:18,099 INFO L158 Benchmark]: TraceAbstraction took 10356.36ms. Allocated memory was 96.5MB in the beginning and 174.1MB in the end (delta: 77.6MB). Free memory was 70.0MB in the beginning and 105.4MB in the end (delta: -35.4MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2021-12-14 19:36:18,099 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 174.1MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:36:18,100 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 79.7MB. Free memory was 48.9MB in the beginning and 48.9MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.74ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 48.4MB in the beginning and 66.7MB in the end (delta: -18.3MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.25ms. Allocated memory is still 96.5MB. Free memory was 66.7MB in the beginning and 64.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.86ms. Allocated memory is still 96.5MB. Free memory was 64.6MB in the beginning and 63.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 400.69ms. Allocated memory is still 96.5MB. Free memory was 63.2MB in the beginning and 70.6MB in the end (delta: -7.4MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10356.36ms. Allocated memory was 96.5MB in the beginning and 174.1MB in the end (delta: 77.6MB). Free memory was 70.0MB in the beginning and 105.4MB in the end (delta: -35.4MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 174.1MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L542] x1->data = 4 VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L545] t1 = S VAL [garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L548] x1->next = t1 VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L551] COND TRUE S == t1 [L552] S = x1 VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={-2:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=6, pc4=1, res4=0, S={-2:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={-2:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={-2:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={-2:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7052 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7052 mSDsluCounter, 9385 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7024 mSDsCounter, 464 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1996 IncrementalHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 464 mSolverCounterUnsat, 2361 mSDtfsCounter, 1996 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1120 GetRequests, 881 SyntacticMatches, 12 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1608 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4625occurred in iteration=18, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 15909 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 988 NumberOfCodeBlocks, 988 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1309 ConstructedInterpolants, 0 QuantifiedInterpolants, 3064 SizeOfPredicates, 43 NumberOfNonLiveVariables, 2051 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 42 InterpolantComputations, 10 PerfectInterpolantSequences, 1487/1857 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-14 19:36:18,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:36:19,984 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:36:19,986 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:36:20,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:36:20,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:36:20,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:36:20,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:36:20,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:36:20,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:36:20,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:36:20,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:36:20,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:36:20,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:36:20,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:36:20,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:36:20,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:36:20,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:36:20,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:36:20,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:36:20,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:36:20,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:36:20,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:36:20,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:36:20,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:36:20,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:36:20,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:36:20,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:36:20,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:36:20,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:36:20,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:36:20,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:36:20,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:36:20,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:36:20,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:36:20,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:36:20,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:36:20,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:36:20,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:36:20,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:36:20,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:36:20,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:36:20,086 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-14 19:36:20,122 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:36:20,122 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:36:20,123 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:36:20,123 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:36:20,124 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:36:20,124 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:36:20,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:36:20,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:36:20,126 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:36:20,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:36:20,127 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:36:20,127 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:36:20,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:36:20,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:36:20,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:36:20,128 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:36:20,128 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:36:20,128 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:36:20,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:36:20,129 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:36:20,129 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-14 19:36:20,129 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-14 19:36:20,129 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:36:20,130 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:36:20,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:36:20,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:36:20,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:36:20,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:36:20,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:36:20,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:36:20,131 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-14 19:36:20,132 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-14 19:36:20,132 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:36:20,132 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-14 19:36:20,132 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f [2021-12-14 19:36:20,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:36:20,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:36:20,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:36:20,440 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:36:20,441 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:36:20,442 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.1.i [2021-12-14 19:36:20,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7269be086/191d89b7b0764fdd8a8eaaa726e6365b/FLAG661ad5168 [2021-12-14 19:36:20,993 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:36:20,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.1.i [2021-12-14 19:36:21,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7269be086/191d89b7b0764fdd8a8eaaa726e6365b/FLAG661ad5168 [2021-12-14 19:36:21,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7269be086/191d89b7b0764fdd8a8eaaa726e6365b [2021-12-14 19:36:21,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:36:21,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:36:21,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:36:21,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:36:21,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:36:21,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:36:21" (1/1) ... [2021-12-14 19:36:21,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87b00b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:21, skipping insertion in model container [2021-12-14 19:36:21,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:36:21" (1/1) ... [2021-12-14 19:36:21,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:36:21,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:36:21,387 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:36:21,397 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:36:21,435 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:36:21,470 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:36:21,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:21 WrapperNode [2021-12-14 19:36:21,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:36:21,473 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:36:21,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:36:21,474 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:36:21,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:21" (1/1) ... [2021-12-14 19:36:21,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:21" (1/1) ... [2021-12-14 19:36:21,528 INFO L137 Inliner]: procedures = 128, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119 [2021-12-14 19:36:21,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:36:21,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:36:21,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:36:21,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:36:21,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:21" (1/1) ... [2021-12-14 19:36:21,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:21" (1/1) ... [2021-12-14 19:36:21,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:21" (1/1) ... [2021-12-14 19:36:21,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:21" (1/1) ... [2021-12-14 19:36:21,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:21" (1/1) ... [2021-12-14 19:36:21,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:21" (1/1) ... [2021-12-14 19:36:21,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:21" (1/1) ... [2021-12-14 19:36:21,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:36:21,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:36:21,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:36:21,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:36:21,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:21" (1/1) ... [2021-12-14 19:36:21,571 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:36:21,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:36:21,595 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 19:36:21,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 19:36:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-14 19:36:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:36:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:36:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:36:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:36:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:36:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-14 19:36:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-14 19:36:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:36:21,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:36:21,718 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:36:21,719 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:36:21,999 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:36:22,005 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:36:22,005 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-14 19:36:22,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:36:22 BoogieIcfgContainer [2021-12-14 19:36:22,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:36:22,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:36:22,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:36:22,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:36:22,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:36:21" (1/3) ... [2021-12-14 19:36:22,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f2df60e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:36:22, skipping insertion in model container [2021-12-14 19:36:22,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:21" (2/3) ... [2021-12-14 19:36:22,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f2df60e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:36:22, skipping insertion in model container [2021-12-14 19:36:22,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:36:22" (3/3) ... [2021-12-14 19:36:22,013 INFO L111 eAbstractionObserver]: Analyzing ICFG lockfree-3.1.i [2021-12-14 19:36:22,017 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:36:22,017 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2021-12-14 19:36:22,049 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:36:22,055 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 19:36:22,055 INFO L340 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2021-12-14 19:36:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 41 states have (on average 1.951219512195122) internal successors, (80), 61 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:22,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-14 19:36:22,071 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:22,072 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-14 19:36:22,072 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:22,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:22,077 INFO L85 PathProgramCache]: Analyzing trace with hash 28701640, now seen corresponding path program 1 times [2021-12-14 19:36:22,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:36:22,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467807687] [2021-12-14 19:36:22,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:22,087 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:36:22,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:36:22,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:36:22,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-14 19:36:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:22,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:36:22,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:22,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:36:22,295 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:36:22,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467807687] [2021-12-14 19:36:22,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467807687] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:36:22,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:36:22,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:36:22,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573543083] [2021-12-14 19:36:22,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:36:22,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:36:22,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:36:22,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:36:22,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:36:22,331 INFO L87 Difference]: Start difference. First operand has 62 states, 41 states have (on average 1.951219512195122) internal successors, (80), 61 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:22,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:22,402 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2021-12-14 19:36:22,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:36:22,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-14 19:36:22,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:22,413 INFO L225 Difference]: With dead ends: 107 [2021-12-14 19:36:22,415 INFO L226 Difference]: Without dead ends: 105 [2021-12-14 19:36:22,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:36:22,419 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 63 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:22,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 134 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:22,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-14 19:36:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2021-12-14 19:36:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 86 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2021-12-14 19:36:22,448 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 5 [2021-12-14 19:36:22,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:22,448 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2021-12-14 19:36:22,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2021-12-14 19:36:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 19:36:22,449 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:22,449 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 19:36:22,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-14 19:36:22,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:36:22,652 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:22,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:22,653 INFO L85 PathProgramCache]: Analyzing trace with hash 889749439, now seen corresponding path program 1 times [2021-12-14 19:36:22,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:36:22,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625112237] [2021-12-14 19:36:22,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:22,654 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:36:22,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:36:22,655 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:36:22,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-14 19:36:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:22,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:36:22,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:22,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:36:22,743 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:36:22,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625112237] [2021-12-14 19:36:22,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625112237] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:36:22,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:36:22,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:36:22,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723675656] [2021-12-14 19:36:22,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:36:22,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:36:22,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:36:22,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:36:22,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:36:22,752 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:22,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:22,866 INFO L93 Difference]: Finished difference Result 163 states and 243 transitions. [2021-12-14 19:36:22,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:36:22,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-14 19:36:22,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:22,869 INFO L225 Difference]: With dead ends: 163 [2021-12-14 19:36:22,869 INFO L226 Difference]: Without dead ends: 160 [2021-12-14 19:36:22,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:36:22,870 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 62 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:22,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 116 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:36:22,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-14 19:36:22,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2021-12-14 19:36:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 139 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:22,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 229 transitions. [2021-12-14 19:36:22,889 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 229 transitions. Word has length 6 [2021-12-14 19:36:22,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:22,889 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 229 transitions. [2021-12-14 19:36:22,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 229 transitions. [2021-12-14 19:36:22,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 19:36:22,890 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:22,890 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 19:36:22,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:23,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:36:23,091 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:23,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:23,092 INFO L85 PathProgramCache]: Analyzing trace with hash 889692424, now seen corresponding path program 1 times [2021-12-14 19:36:23,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:36:23,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394736154] [2021-12-14 19:36:23,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:23,093 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:36:23,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:36:23,094 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:36:23,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-14 19:36:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:23,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:36:23,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:23,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:36:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:23,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:36:23,206 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:36:23,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394736154] [2021-12-14 19:36:23,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394736154] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:36:23,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:36:23,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:36:23,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268162761] [2021-12-14 19:36:23,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:36:23,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:36:23,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:36:23,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:36:23,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:36:23,208 INFO L87 Difference]: Start difference. First operand 140 states and 229 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:23,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:23,310 INFO L93 Difference]: Finished difference Result 211 states and 330 transitions. [2021-12-14 19:36:23,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:36:23,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-14 19:36:23,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:23,312 INFO L225 Difference]: With dead ends: 211 [2021-12-14 19:36:23,312 INFO L226 Difference]: Without dead ends: 211 [2021-12-14 19:36:23,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:36:23,314 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 64 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:23,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 163 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:36:23,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-14 19:36:23,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 190. [2021-12-14 19:36:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 172 states have (on average 1.8372093023255813) internal successors, (316), 189 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 316 transitions. [2021-12-14 19:36:23,330 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 316 transitions. Word has length 6 [2021-12-14 19:36:23,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:23,330 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 316 transitions. [2021-12-14 19:36:23,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:23,331 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 316 transitions. [2021-12-14 19:36:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 19:36:23,331 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:23,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 19:36:23,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:23,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:36:23,542 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:23,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:23,543 INFO L85 PathProgramCache]: Analyzing trace with hash 889692425, now seen corresponding path program 1 times [2021-12-14 19:36:23,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:36:23,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934841759] [2021-12-14 19:36:23,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:23,543 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:36:23,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:36:23,544 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:36:23,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-14 19:36:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:23,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:36:23,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:23,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:36:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:23,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:36:23,620 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:36:23,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934841759] [2021-12-14 19:36:23,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934841759] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:36:23,620 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:36:23,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:36:23,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526277268] [2021-12-14 19:36:23,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:36:23,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:36:23,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:36:23,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:36:23,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:36:23,622 INFO L87 Difference]: Start difference. First operand 190 states and 316 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:23,729 INFO L93 Difference]: Finished difference Result 206 states and 321 transitions. [2021-12-14 19:36:23,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:36:23,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-14 19:36:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:23,731 INFO L225 Difference]: With dead ends: 206 [2021-12-14 19:36:23,731 INFO L226 Difference]: Without dead ends: 206 [2021-12-14 19:36:23,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:36:23,732 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 63 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:23,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 169 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:36:23,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-14 19:36:23,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 188. [2021-12-14 19:36:23,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 172 states have (on average 1.7906976744186047) internal successors, (308), 187 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:23,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 308 transitions. [2021-12-14 19:36:23,746 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 308 transitions. Word has length 6 [2021-12-14 19:36:23,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:23,746 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 308 transitions. [2021-12-14 19:36:23,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:23,747 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 308 transitions. [2021-12-14 19:36:23,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:36:23,747 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:23,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:23,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:23,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:36:23,956 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:23,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:23,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1810669365, now seen corresponding path program 1 times [2021-12-14 19:36:23,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:36:23,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999098154] [2021-12-14 19:36:23,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:23,957 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:36:23,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:36:23,958 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:36:23,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-14 19:36:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:24,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:36:24,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:24,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:36:24,041 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:36:24,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999098154] [2021-12-14 19:36:24,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999098154] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:36:24,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:36:24,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:36:24,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084669064] [2021-12-14 19:36:24,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:36:24,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:36:24,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:36:24,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:36:24,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:36:24,043 INFO L87 Difference]: Start difference. First operand 188 states and 308 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:24,083 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2021-12-14 19:36:24,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:36:24,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-14 19:36:24,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:24,084 INFO L225 Difference]: With dead ends: 211 [2021-12-14 19:36:24,084 INFO L226 Difference]: Without dead ends: 211 [2021-12-14 19:36:24,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:36:24,085 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 101 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:24,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 229 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:24,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-14 19:36:24,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 144. [2021-12-14 19:36:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 143 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:24,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 229 transitions. [2021-12-14 19:36:24,092 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 229 transitions. Word has length 7 [2021-12-14 19:36:24,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:24,092 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 229 transitions. [2021-12-14 19:36:24,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 229 transitions. [2021-12-14 19:36:24,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 19:36:24,092 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:24,092 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:24,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:24,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:36:24,301 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:24,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:24,301 INFO L85 PathProgramCache]: Analyzing trace with hash 347531241, now seen corresponding path program 1 times [2021-12-14 19:36:24,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:36:24,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706591000] [2021-12-14 19:36:24,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:24,302 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:36:24,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:36:24,303 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:36:24,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-14 19:36:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:24,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:36:24,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:24,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:36:24,361 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:36:24,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706591000] [2021-12-14 19:36:24,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [706591000] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:36:24,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:36:24,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:36:24,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297552835] [2021-12-14 19:36:24,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:36:24,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:36:24,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:36:24,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:36:24,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:36:24,363 INFO L87 Difference]: Start difference. First operand 144 states and 229 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:24,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:24,399 INFO L93 Difference]: Finished difference Result 283 states and 430 transitions. [2021-12-14 19:36:24,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:36:24,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-14 19:36:24,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:24,401 INFO L225 Difference]: With dead ends: 283 [2021-12-14 19:36:24,401 INFO L226 Difference]: Without dead ends: 283 [2021-12-14 19:36:24,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:36:24,402 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 103 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:24,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 196 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:24,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-12-14 19:36:24,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 198. [2021-12-14 19:36:24,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 186 states have (on average 1.6559139784946237) internal successors, (308), 197 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:24,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 308 transitions. [2021-12-14 19:36:24,409 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 308 transitions. Word has length 8 [2021-12-14 19:36:24,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:24,409 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 308 transitions. [2021-12-14 19:36:24,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:24,409 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 308 transitions. [2021-12-14 19:36:24,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 19:36:24,410 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:24,410 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:24,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:24,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:36:24,618 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:24,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:24,619 INFO L85 PathProgramCache]: Analyzing trace with hash -527615340, now seen corresponding path program 1 times [2021-12-14 19:36:24,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:36:24,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128156672] [2021-12-14 19:36:24,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:24,619 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:36:24,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:36:24,620 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:36:24,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-14 19:36:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:24,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:36:24,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:24,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:24,779 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:36:24,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128156672] [2021-12-14 19:36:24,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128156672] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:24,780 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:36:24,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2021-12-14 19:36:24,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896217082] [2021-12-14 19:36:24,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:24,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:36:24,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:36:24,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:36:24,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:36:24,782 INFO L87 Difference]: Start difference. First operand 198 states and 308 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:24,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:24,873 INFO L93 Difference]: Finished difference Result 461 states and 690 transitions. [2021-12-14 19:36:24,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:36:24,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-14 19:36:24,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:24,877 INFO L225 Difference]: With dead ends: 461 [2021-12-14 19:36:24,877 INFO L226 Difference]: Without dead ends: 461 [2021-12-14 19:36:24,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:36:24,878 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 221 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:24,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 471 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:36:24,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-12-14 19:36:24,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 258. [2021-12-14 19:36:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 246 states have (on average 1.6016260162601625) internal successors, (394), 257 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 394 transitions. [2021-12-14 19:36:24,887 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 394 transitions. Word has length 12 [2021-12-14 19:36:24,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:24,887 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 394 transitions. [2021-12-14 19:36:24,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 394 transitions. [2021-12-14 19:36:24,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 19:36:24,888 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:24,888 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:24,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:25,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:36:25,096 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:25,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:25,096 INFO L85 PathProgramCache]: Analyzing trace with hash 2027186576, now seen corresponding path program 1 times [2021-12-14 19:36:25,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:36:25,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881038951] [2021-12-14 19:36:25,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:25,097 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:36:25,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:36:25,098 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:36:25,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-14 19:36:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:25,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:36:25,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:25,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:25,221 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:36:25,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881038951] [2021-12-14 19:36:25,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881038951] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:25,222 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:36:25,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2021-12-14 19:36:25,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586159684] [2021-12-14 19:36:25,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:25,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:36:25,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:36:25,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:36:25,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:36:25,223 INFO L87 Difference]: Start difference. First operand 258 states and 394 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:25,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:25,269 INFO L93 Difference]: Finished difference Result 600 states and 886 transitions. [2021-12-14 19:36:25,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:36:25,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-14 19:36:25,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:25,272 INFO L225 Difference]: With dead ends: 600 [2021-12-14 19:36:25,272 INFO L226 Difference]: Without dead ends: 600 [2021-12-14 19:36:25,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:36:25,273 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 214 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:25,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 343 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:25,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2021-12-14 19:36:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 576. [2021-12-14 19:36:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 564 states have (on average 1.570921985815603) internal successors, (886), 575 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 886 transitions. [2021-12-14 19:36:25,285 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 886 transitions. Word has length 12 [2021-12-14 19:36:25,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:25,285 INFO L470 AbstractCegarLoop]: Abstraction has 576 states and 886 transitions. [2021-12-14 19:36:25,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 886 transitions. [2021-12-14 19:36:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:36:25,286 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:25,286 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:25,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:25,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:36:25,495 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:25,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:25,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1582579647, now seen corresponding path program 2 times [2021-12-14 19:36:25,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:36:25,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778353607] [2021-12-14 19:36:25,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:36:25,496 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:36:25,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:36:25,497 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:36:25,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-14 19:36:25,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:36:25,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:36:25,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:36:25,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:25,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:25,618 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:36:25,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778353607] [2021-12-14 19:36:25,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778353607] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:25,618 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:36:25,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-14 19:36:25,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246207267] [2021-12-14 19:36:25,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:25,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:36:25,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:36:25,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:36:25,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:36:25,619 INFO L87 Difference]: Start difference. First operand 576 states and 886 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:25,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:25,691 INFO L93 Difference]: Finished difference Result 998 states and 1530 transitions. [2021-12-14 19:36:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:36:25,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 19:36:25,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:25,695 INFO L225 Difference]: With dead ends: 998 [2021-12-14 19:36:25,695 INFO L226 Difference]: Without dead ends: 998 [2021-12-14 19:36:25,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:36:25,696 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 192 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:25,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 336 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:25,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2021-12-14 19:36:25,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 968. [2021-12-14 19:36:25,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 956 states have (on average 1.5502092050209204) internal successors, (1482), 967 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:25,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1482 transitions. [2021-12-14 19:36:25,718 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1482 transitions. Word has length 16 [2021-12-14 19:36:25,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:25,718 INFO L470 AbstractCegarLoop]: Abstraction has 968 states and 1482 transitions. [2021-12-14 19:36:25,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:25,718 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1482 transitions. [2021-12-14 19:36:25,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 19:36:25,719 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:25,719 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:25,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-14 19:36:25,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:36:25,931 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:25,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:25,932 INFO L85 PathProgramCache]: Analyzing trace with hash -480845608, now seen corresponding path program 1 times [2021-12-14 19:36:25,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:36:25,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370995237] [2021-12-14 19:36:25,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:25,933 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:36:25,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:36:25,933 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:36:25,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-14 19:36:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:25,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:36:25,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:26,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:26,103 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:36:26,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1370995237] [2021-12-14 19:36:26,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1370995237] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:26,103 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:36:26,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2021-12-14 19:36:26,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841458987] [2021-12-14 19:36:26,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:26,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:36:26,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:36:26,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:36:26,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:36:26,105 INFO L87 Difference]: Start difference. First operand 968 states and 1482 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:26,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:26,167 INFO L93 Difference]: Finished difference Result 1243 states and 1844 transitions. [2021-12-14 19:36:26,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:36:26,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-14 19:36:26,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:26,172 INFO L225 Difference]: With dead ends: 1243 [2021-12-14 19:36:26,172 INFO L226 Difference]: Without dead ends: 1243 [2021-12-14 19:36:26,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:36:26,173 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 87 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:26,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 192 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:26,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2021-12-14 19:36:26,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1100. [2021-12-14 19:36:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 1088 states have (on average 1.5110294117647058) internal successors, (1644), 1099 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:26,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1644 transitions. [2021-12-14 19:36:26,198 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1644 transitions. Word has length 18 [2021-12-14 19:36:26,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:26,198 INFO L470 AbstractCegarLoop]: Abstraction has 1100 states and 1644 transitions. [2021-12-14 19:36:26,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:26,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1644 transitions. [2021-12-14 19:36:26,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-14 19:36:26,199 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:26,199 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:26,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:26,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:36:26,408 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:26,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:26,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1323238580, now seen corresponding path program 1 times [2021-12-14 19:36:26,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:36:26,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22001730] [2021-12-14 19:36:26,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:26,409 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:36:26,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:36:26,410 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:36:26,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-14 19:36:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:26,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:36:26,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:26,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:26,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:26,576 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:36:26,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22001730] [2021-12-14 19:36:26,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22001730] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:26,576 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:36:26,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2021-12-14 19:36:26,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554899013] [2021-12-14 19:36:26,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:26,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:36:26,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:36:26,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:36:26,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:36:26,578 INFO L87 Difference]: Start difference. First operand 1100 states and 1644 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:26,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:26,645 INFO L93 Difference]: Finished difference Result 1384 states and 1990 transitions. [2021-12-14 19:36:26,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:36:26,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-14 19:36:26,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:26,651 INFO L225 Difference]: With dead ends: 1384 [2021-12-14 19:36:26,652 INFO L226 Difference]: Without dead ends: 1384 [2021-12-14 19:36:26,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:36:26,652 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 201 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:26,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 539 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:26,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2021-12-14 19:36:26,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1009. [2021-12-14 19:36:26,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 997 states have (on average 1.4794383149448345) internal successors, (1475), 1008 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1475 transitions. [2021-12-14 19:36:26,681 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1475 transitions. Word has length 21 [2021-12-14 19:36:26,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:26,682 INFO L470 AbstractCegarLoop]: Abstraction has 1009 states and 1475 transitions. [2021-12-14 19:36:26,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:26,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1475 transitions. [2021-12-14 19:36:26,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:36:26,683 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:26,683 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:26,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:26,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:36:26,891 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:26,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:26,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2034622781, now seen corresponding path program 2 times [2021-12-14 19:36:26,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:36:26,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103138157] [2021-12-14 19:36:26,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:36:26,892 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:36:26,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:36:26,893 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:36:26,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-14 19:36:26,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:36:26,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:36:26,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:36:26,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:27,025 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:36:27,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:36:27,088 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:36:27,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103138157] [2021-12-14 19:36:27,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103138157] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:27,088 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:36:27,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-14 19:36:27,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703246899] [2021-12-14 19:36:27,089 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:27,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:36:27,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:36:27,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:36:27,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:36:27,090 INFO L87 Difference]: Start difference. First operand 1009 states and 1475 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:27,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:27,171 INFO L93 Difference]: Finished difference Result 994 states and 1410 transitions. [2021-12-14 19:36:27,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:36:27,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-14 19:36:27,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:27,175 INFO L225 Difference]: With dead ends: 994 [2021-12-14 19:36:27,175 INFO L226 Difference]: Without dead ends: 994 [2021-12-14 19:36:27,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:36:27,176 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 172 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:27,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 522 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:36:27,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2021-12-14 19:36:27,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 970. [2021-12-14 19:36:27,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 958 states have (on average 1.4718162839248434) internal successors, (1410), 969 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1410 transitions. [2021-12-14 19:36:27,195 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1410 transitions. Word has length 27 [2021-12-14 19:36:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:27,195 INFO L470 AbstractCegarLoop]: Abstraction has 970 states and 1410 transitions. [2021-12-14 19:36:27,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1410 transitions. [2021-12-14 19:36:27,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:36:27,196 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:27,196 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:27,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:27,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:36:27,405 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:27,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:27,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1432941687, now seen corresponding path program 1 times [2021-12-14 19:36:27,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:36:27,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515480091] [2021-12-14 19:36:27,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:27,406 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:36:27,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:36:27,407 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:36:27,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-14 19:36:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:27,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 19:36:27,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:27,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:27,646 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:36:27,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515480091] [2021-12-14 19:36:27,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515480091] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:27,647 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:36:27,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2021-12-14 19:36:27,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93031266] [2021-12-14 19:36:27,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:27,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:36:27,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:36:27,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:36:27,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:36:27,649 INFO L87 Difference]: Start difference. First operand 970 states and 1410 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:27,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:27,744 INFO L93 Difference]: Finished difference Result 1049 states and 1452 transitions. [2021-12-14 19:36:27,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:36:27,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-14 19:36:27,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:27,747 INFO L225 Difference]: With dead ends: 1049 [2021-12-14 19:36:27,748 INFO L226 Difference]: Without dead ends: 1049 [2021-12-14 19:36:27,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:36:27,748 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 233 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:27,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 808 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:36:27,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2021-12-14 19:36:27,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 892. [2021-12-14 19:36:27,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 880 states have (on average 1.4397727272727272) internal successors, (1267), 891 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1267 transitions. [2021-12-14 19:36:27,774 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1267 transitions. Word has length 27 [2021-12-14 19:36:27,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:27,774 INFO L470 AbstractCegarLoop]: Abstraction has 892 states and 1267 transitions. [2021-12-14 19:36:27,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:27,774 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1267 transitions. [2021-12-14 19:36:27,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:36:27,775 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:27,775 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:27,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:27,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:36:27,984 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:27,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:27,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1945741357, now seen corresponding path program 1 times [2021-12-14 19:36:27,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:36:27,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836459679] [2021-12-14 19:36:27,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:27,985 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:36:27,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:36:27,986 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:36:27,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-14 19:36:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:28,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 19:36:28,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:28,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:28,436 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:36:28,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836459679] [2021-12-14 19:36:28,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836459679] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:28,436 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:36:28,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2021-12-14 19:36:28,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467646302] [2021-12-14 19:36:28,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:28,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 19:36:28,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:36:28,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 19:36:28,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:36:28,438 INFO L87 Difference]: Start difference. First operand 892 states and 1267 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:28,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:28,789 INFO L93 Difference]: Finished difference Result 1882 states and 2629 transitions. [2021-12-14 19:36:28,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-14 19:36:28,791 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-14 19:36:28,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:28,796 INFO L225 Difference]: With dead ends: 1882 [2021-12-14 19:36:28,796 INFO L226 Difference]: Without dead ends: 1882 [2021-12-14 19:36:28,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2021-12-14 19:36:28,797 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 646 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:28,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [646 Valid, 1500 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:36:28,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2021-12-14 19:36:28,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1834. [2021-12-14 19:36:28,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1822 states have (on average 1.442919868276619) internal successors, (2629), 1833 states have internal predecessors, (2629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2629 transitions. [2021-12-14 19:36:28,827 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2629 transitions. Word has length 30 [2021-12-14 19:36:28,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:28,828 INFO L470 AbstractCegarLoop]: Abstraction has 1834 states and 2629 transitions. [2021-12-14 19:36:28,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:28,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2629 transitions. [2021-12-14 19:36:28,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 19:36:28,828 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:28,829 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:28,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:29,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:36:29,042 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:29,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:29,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1575281728, now seen corresponding path program 1 times [2021-12-14 19:36:29,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:36:29,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912859544] [2021-12-14 19:36:29,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:29,043 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:36:29,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:36:29,044 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:36:29,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-14 19:36:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:29,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 19:36:29,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:29,204 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:29,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:29,269 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:29,269 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:36:29,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912859544] [2021-12-14 19:36:29,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912859544] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:29,270 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:36:29,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2021-12-14 19:36:29,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686051007] [2021-12-14 19:36:29,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:29,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:36:29,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:36:29,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:36:29,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:36:29,271 INFO L87 Difference]: Start difference. First operand 1834 states and 2629 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:29,392 INFO L93 Difference]: Finished difference Result 2281 states and 3205 transitions. [2021-12-14 19:36:29,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:36:29,393 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-14 19:36:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:29,399 INFO L225 Difference]: With dead ends: 2281 [2021-12-14 19:36:29,399 INFO L226 Difference]: Without dead ends: 2281 [2021-12-14 19:36:29,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:36:29,400 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 274 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:29,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 1139 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:36:29,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2021-12-14 19:36:29,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 1782. [2021-12-14 19:36:29,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1770 states have (on average 1.426553672316384) internal successors, (2525), 1781 states have internal predecessors, (2525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:29,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2525 transitions. [2021-12-14 19:36:29,429 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2525 transitions. Word has length 33 [2021-12-14 19:36:29,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:29,429 INFO L470 AbstractCegarLoop]: Abstraction has 1782 states and 2525 transitions. [2021-12-14 19:36:29,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:29,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2525 transitions. [2021-12-14 19:36:29,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 19:36:29,430 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:29,430 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:29,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:29,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:36:29,639 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:29,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:29,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1822753242, now seen corresponding path program 1 times [2021-12-14 19:36:29,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:36:29,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300717196] [2021-12-14 19:36:29,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:29,640 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:36:29,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:36:29,641 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:36:29,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-14 19:36:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:36:29,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 19:36:29,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:29,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:36:29,942 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:36:29,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300717196] [2021-12-14 19:36:29,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300717196] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:29,943 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:36:29,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2021-12-14 19:36:29,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647706245] [2021-12-14 19:36:29,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:29,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:36:29,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:36:29,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:36:29,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:36:29,944 INFO L87 Difference]: Start difference. First operand 1782 states and 2525 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:30,107 INFO L93 Difference]: Finished difference Result 2267 states and 3153 transitions. [2021-12-14 19:36:30,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 19:36:30,108 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-14 19:36:30,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:30,115 INFO L225 Difference]: With dead ends: 2267 [2021-12-14 19:36:30,116 INFO L226 Difference]: Without dead ends: 2267 [2021-12-14 19:36:30,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:36:30,117 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 340 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:30,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 1561 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:36:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2021-12-14 19:36:30,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 1756. [2021-12-14 19:36:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1744 states have (on average 1.4180045871559632) internal successors, (2473), 1755 states have internal predecessors, (2473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:30,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2473 transitions. [2021-12-14 19:36:30,148 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2473 transitions. Word has length 41 [2021-12-14 19:36:30,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:30,148 INFO L470 AbstractCegarLoop]: Abstraction has 1756 states and 2473 transitions. [2021-12-14 19:36:30,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:30,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2473 transitions. [2021-12-14 19:36:30,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-14 19:36:30,149 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:30,149 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:30,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:30,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:36:30,359 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:30,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:30,359 INFO L85 PathProgramCache]: Analyzing trace with hash 685518324, now seen corresponding path program 2 times [2021-12-14 19:36:30,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:36:30,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119475403] [2021-12-14 19:36:30,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:36:30,360 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:36:30,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:36:30,361 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:36:30,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-14 19:36:30,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:36:30,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:36:30,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 19:36:30,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:36:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:36:30,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:36:31,100 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:36:31,100 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:36:31,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119475403] [2021-12-14 19:36:31,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119475403] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:36:31,101 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:36:31,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2021-12-14 19:36:31,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873304315] [2021-12-14 19:36:31,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:36:31,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 19:36:31,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:36:31,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 19:36:31,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2021-12-14 19:36:31,103 INFO L87 Difference]: Start difference. First operand 1756 states and 2473 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:31,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:36:31,598 INFO L93 Difference]: Finished difference Result 2042 states and 2790 transitions. [2021-12-14 19:36:31,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-14 19:36:31,599 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-12-14 19:36:31,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:36:31,603 INFO L225 Difference]: With dead ends: 2042 [2021-12-14 19:36:31,603 INFO L226 Difference]: Without dead ends: 2042 [2021-12-14 19:36:31,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2021-12-14 19:36:31,604 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 860 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1970 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:36:31,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [860 Valid, 1970 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:36:31,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2021-12-14 19:36:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1982. [2021-12-14 19:36:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1970 states have (on average 1.416243654822335) internal successors, (2790), 1981 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2790 transitions. [2021-12-14 19:36:31,637 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 2790 transitions. Word has length 49 [2021-12-14 19:36:31,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:36:31,637 INFO L470 AbstractCegarLoop]: Abstraction has 1982 states and 2790 transitions. [2021-12-14 19:36:31,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:36:31,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2790 transitions. [2021-12-14 19:36:31,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-14 19:36:31,638 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:36:31,638 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:31,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:31,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:36:31,848 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 16 more)] === [2021-12-14 19:36:31,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:36:31,848 INFO L85 PathProgramCache]: Analyzing trace with hash 34201258, now seen corresponding path program 1 times [2021-12-14 19:36:31,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:36:31,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964982378] [2021-12-14 19:36:31,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:36:31,849 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:36:31,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:36:31,850 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:36:31,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-14 19:36:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 19:36:31,940 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 19:36:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 19:36:32,023 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-14 19:36:32,024 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 19:36:32,024 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2021-12-14 19:36:32,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (18 of 20 remaining) [2021-12-14 19:36:32,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (17 of 20 remaining) [2021-12-14 19:36:32,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (16 of 20 remaining) [2021-12-14 19:36:32,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (15 of 20 remaining) [2021-12-14 19:36:32,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (14 of 20 remaining) [2021-12-14 19:36:32,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (13 of 20 remaining) [2021-12-14 19:36:32,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (12 of 20 remaining) [2021-12-14 19:36:32,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (11 of 20 remaining) [2021-12-14 19:36:32,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (10 of 20 remaining) [2021-12-14 19:36:32,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (9 of 20 remaining) [2021-12-14 19:36:32,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (8 of 20 remaining) [2021-12-14 19:36:32,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (7 of 20 remaining) [2021-12-14 19:36:32,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (6 of 20 remaining) [2021-12-14 19:36:32,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (5 of 20 remaining) [2021-12-14 19:36:32,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (4 of 20 remaining) [2021-12-14 19:36:32,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (3 of 20 remaining) [2021-12-14 19:36:32,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2021-12-14 19:36:32,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2021-12-14 19:36:32,028 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2021-12-14 19:36:32,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-14 19:36:32,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:36:32,240 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:36:32,242 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 19:36:32,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 07:36:32 BoogieIcfgContainer [2021-12-14 19:36:32,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 19:36:32,297 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 19:36:32,297 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 19:36:32,298 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 19:36:32,298 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:36:22" (3/4) ... [2021-12-14 19:36:32,300 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 19:36:32,300 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 19:36:32,301 INFO L158 Benchmark]: Toolchain (without parser) took 11266.82ms. Allocated memory was 48.2MB in the beginning and 92.3MB in the end (delta: 44.0MB). Free memory was 22.8MB in the beginning and 37.6MB in the end (delta: -14.8MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2021-12-14 19:36:32,301 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 48.2MB. Free memory was 31.0MB in the beginning and 31.0MB in the end (delta: 31.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:36:32,301 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.59ms. Allocated memory is still 58.7MB. Free memory was 43.9MB in the beginning and 33.9MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 19:36:32,302 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.49ms. Allocated memory is still 58.7MB. Free memory was 33.9MB in the beginning and 31.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:36:32,302 INFO L158 Benchmark]: Boogie Preprocessor took 33.01ms. Allocated memory is still 58.7MB. Free memory was 31.6MB in the beginning and 41.8MB in the end (delta: -10.2MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2021-12-14 19:36:32,302 INFO L158 Benchmark]: RCFGBuilder took 441.77ms. Allocated memory is still 58.7MB. Free memory was 41.8MB in the beginning and 38.7MB in the end (delta: 3.1MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2021-12-14 19:36:32,302 INFO L158 Benchmark]: TraceAbstraction took 10288.75ms. Allocated memory was 58.7MB in the beginning and 92.3MB in the end (delta: 33.6MB). Free memory was 38.3MB in the beginning and 38.1MB in the end (delta: 154.7kB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2021-12-14 19:36:32,302 INFO L158 Benchmark]: Witness Printer took 3.18ms. Allocated memory is still 92.3MB. Free memory was 38.1MB in the beginning and 37.6MB in the end (delta: 547.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:36:32,304 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 48.2MB. Free memory was 31.0MB in the beginning and 31.0MB in the end (delta: 31.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.59ms. Allocated memory is still 58.7MB. Free memory was 43.9MB in the beginning and 33.9MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.49ms. Allocated memory is still 58.7MB. Free memory was 33.9MB in the beginning and 31.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.01ms. Allocated memory is still 58.7MB. Free memory was 31.6MB in the beginning and 41.8MB in the end (delta: -10.2MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * RCFGBuilder took 441.77ms. Allocated memory is still 58.7MB. Free memory was 41.8MB in the beginning and 38.7MB in the end (delta: 3.1MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10288.75ms. Allocated memory was 58.7MB in the beginning and 92.3MB in the end (delta: 33.6MB). Free memory was 38.3MB in the beginning and 38.1MB in the end (delta: 154.7kB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * Witness Printer took 3.18ms. Allocated memory is still 92.3MB. Free memory was 38.1MB in the beginning and 37.6MB in the end (delta: 547.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L542] x1->data = 4 VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L545] t1 = S VAL [garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L548] x1->next = t1 VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L551] COND TRUE S == t1 [L552] S = x1 VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={6:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={6:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={6:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 62 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3896 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3896 mSDsluCounter, 10388 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8027 mSDsCounter, 377 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1188 IncrementalHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 377 mSolverCounterUnsat, 2361 mSDtfsCounter, 1188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 644 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1982occurred in iteration=17, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 2303 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 582 ConstructedInterpolants, 0 QuantifiedInterpolants, 2216 SizeOfPredicates, 39 NumberOfNonLiveVariables, 1510 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 200/538 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-14 19:36:32,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample