./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array13_alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/array13_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bcb4bc0abad87560c498c61782d3ccf631503b41762d0db8553a6c831cbdcaff --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:34:26,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:34:26,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:34:26,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:34:26,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:34:26,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:34:26,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:34:26,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:34:26,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:34:26,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:34:26,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:34:26,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:34:26,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:34:26,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:34:26,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:34:26,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:34:26,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:34:26,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:34:26,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:34:26,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:34:26,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:34:26,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:34:26,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:34:26,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:34:26,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:34:26,627 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:34:26,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:34:26,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:34:26,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:34:26,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:34:26,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:34:26,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:34:26,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:34:26,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:34:26,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:34:26,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:34:26,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:34:26,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:34:26,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:34:26,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:34:26,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:34:26,639 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:34:26,674 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:34:26,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:34:26,677 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:34:26,677 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:34:26,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:34:26,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:34:26,683 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:34:26,683 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:34:26,683 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:34:26,684 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:34:26,685 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:34:26,685 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:34:26,685 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:34:26,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:34:26,686 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:34:26,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:34:26,686 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:34:26,686 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:34:26,686 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:34:26,686 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:34:26,687 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:34:26,687 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:34:26,687 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:34:26,687 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:34:26,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:34:26,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:34:26,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:34:26,690 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:34:26,691 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:34:26,691 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bcb4bc0abad87560c498c61782d3ccf631503b41762d0db8553a6c831cbdcaff [2022-02-21 03:34:26,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:34:27,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:34:27,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:34:27,006 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:34:27,007 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:34:27,008 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array13_alloca.i [2022-02-21 03:34:27,067 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7fe491cd/f05af4d0c6974c0eb467103e8954b88d/FLAGf47b4107e [2022-02-21 03:34:27,528 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:34:27,529 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array13_alloca.i [2022-02-21 03:34:27,538 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7fe491cd/f05af4d0c6974c0eb467103e8954b88d/FLAGf47b4107e [2022-02-21 03:34:27,881 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7fe491cd/f05af4d0c6974c0eb467103e8954b88d [2022-02-21 03:34:27,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:34:27,886 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:34:27,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:34:27,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:34:27,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:34:27,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:34:27" (1/1) ... [2022-02-21 03:34:27,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c83da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:27, skipping insertion in model container [2022-02-21 03:34:27,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:34:27" (1/1) ... [2022-02-21 03:34:27,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:34:27,946 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:34:28,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:34:28,303 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:34:28,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:34:28,390 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:34:28,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:28 WrapperNode [2022-02-21 03:34:28,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:34:28,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:34:28,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:34:28,392 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:34:28,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:28" (1/1) ... [2022-02-21 03:34:28,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:28" (1/1) ... [2022-02-21 03:34:28,446 INFO L137 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-02-21 03:34:28,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:34:28,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:34:28,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:34:28,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:34:28,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:28" (1/1) ... [2022-02-21 03:34:28,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:28" (1/1) ... [2022-02-21 03:34:28,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:28" (1/1) ... [2022-02-21 03:34:28,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:28" (1/1) ... [2022-02-21 03:34:28,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:28" (1/1) ... [2022-02-21 03:34:28,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:28" (1/1) ... [2022-02-21 03:34:28,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:28" (1/1) ... [2022-02-21 03:34:28,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:34:28,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:34:28,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:34:28,492 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:34:28,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:28" (1/1) ... [2022-02-21 03:34:28,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:28,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:28,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:28,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:34:28,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:34:28,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:34:28,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:34:28,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:34:28,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:34:28,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:34:28,646 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:34:28,648 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:34:28,844 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:34:28,850 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:34:28,857 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:34:28,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:34:28 BoogieIcfgContainer [2022-02-21 03:34:28,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:34:28,863 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:34:28,864 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:34:28,867 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:34:28,869 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:28,869 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:34:27" (1/3) ... [2022-02-21 03:34:28,870 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1281cdeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:34:28, skipping insertion in model container [2022-02-21 03:34:28,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:28,871 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:28" (2/3) ... [2022-02-21 03:34:28,871 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1281cdeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:34:28, skipping insertion in model container [2022-02-21 03:34:28,871 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:28,871 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:34:28" (3/3) ... [2022-02-21 03:34:28,872 INFO L388 chiAutomizerObserver]: Analyzing ICFG array13_alloca.i [2022-02-21 03:34:28,914 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:34:28,914 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:34:28,914 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:34:28,914 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:34:28,915 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:34:28,915 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:34:28,915 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:34:28,915 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:34:28,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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) [2022-02-21 03:34:28,959 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:34:28,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:28,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:28,964 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:34:28,965 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:34:28,965 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:34:28,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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) [2022-02-21 03:34:28,969 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:34:28,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:28,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:28,970 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:34:28,970 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:34:28,976 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 11#L367true assume !(main_~length~0#1 < 1); 8#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 5#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 6#L370-3true [2022-02-21 03:34:28,979 INFO L793 eck$LassoCheckResult]: Loop: 6#L370-3true assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13#L372true assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16#L370-2true main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 6#L370-3true [2022-02-21 03:34:28,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:28,985 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2022-02-21 03:34:28,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:28,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509920961] [2022-02-21 03:34:28,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:28,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:29,076 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:29,120 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:29,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:29,123 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2022-02-21 03:34:29,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:29,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472200298] [2022-02-21 03:34:29,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:29,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:29,167 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:29,178 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:29,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:29,185 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2022-02-21 03:34:29,185 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:29,185 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463727349] [2022-02-21 03:34:29,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:29,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:29,236 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:29,253 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:29,551 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:34:29,551 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:34:29,551 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:34:29,552 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:34:29,552 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:34:29,552 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:29,552 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:34:29,552 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:34:29,552 INFO L133 ssoRankerPreferences]: Filename of dumped script: array13_alloca.i_Iteration1_Lasso [2022-02-21 03:34:29,553 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:34:29,553 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:34:29,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:29,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:29,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:29,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:29,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:29,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:29,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:29,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:29,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:29,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:29,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:29,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:30,106 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:34:30,109 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:34:30,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:30,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:30,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:30,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:30,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:30,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:30,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:30,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:30,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:30,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:30,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:30,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:34:30,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:30,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:34:30,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:30,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:30,161 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:30,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:34:30,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:30,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:30,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:30,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:30,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:30,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:30,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:30,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:30,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:30,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:30,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:30,227 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:30,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:34:30,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:30,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:30,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:30,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:30,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:30,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:30,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:30,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:30,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:30,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:30,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:30,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:30,278 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:30,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:34:30,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:30,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:30,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:30,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:30,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:30,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:30,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:30,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:30,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:30,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:30,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:30,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:30,332 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:30,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:30,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:30,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:30,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:30,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:30,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:34:30,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:30,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:30,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:30,361 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:30,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:30,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:30,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:30,385 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:30,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:34:30,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:30,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:30,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:30,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:30,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:30,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:30,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:30,412 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:30,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:30,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:30,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:30,441 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:30,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:30,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:30,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:30,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:30,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:30,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:30,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:30,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:34:30,473 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:30,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:30,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:30,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:30,492 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:30,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:34:30,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:34:30,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:30,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:30,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:30,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:30,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:30,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:30,535 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:34:30,565 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-02-21 03:34:30,566 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 03:34:30,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:30,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:30,570 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:30,607 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:34:30,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:34:30,629 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:34:30,630 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:34:30,630 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1) = -4*ULTIMATE.start_main_~i~0#1 - 1*ULTIMATE.start_main_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 Supporting invariants [] [2022-02-21 03:34:30,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:30,683 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-02-21 03:34:30,692 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1;" [2022-02-21 03:34:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:30,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:30,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:34:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:30,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:30,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {25#unseeded} is VALID [2022-02-21 03:34:30,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {25#unseeded} is VALID [2022-02-21 03:34:30,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#unseeded} assume !(main_~length~0#1 < 1); {25#unseeded} is VALID [2022-02-21 03:34:30,789 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#unseeded} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {25#unseeded} is VALID [2022-02-21 03:34:30,790 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#unseeded} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {25#unseeded} is VALID [2022-02-21 03:34:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:30,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:34:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:30,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:30,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(>= oldRank0 (+ (* (- 4) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|)))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {70#(and (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)))} is VALID [2022-02-21 03:34:30,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {70#(and (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)))} assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {70#(and (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)))} is VALID [2022-02-21 03:34:30,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {70#(and (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {53#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 4) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|)))) unseeded)} is VALID [2022-02-21 03:34:30,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:30,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) 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) [2022-02-21 03:34:30,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:30,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:30,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:30,938 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:34:30,939 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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 2.6666666666666665) 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) [2022-02-21 03:34:31,033 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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 2.6666666666666665) 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) Result 35 states and 50 transitions. Complement of second has 7 states. [2022-02-21 03:34:31,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:34:31,034 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:31,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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) [2022-02-21 03:34:31,040 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:34:31,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:31,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:31,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.6666666666666665) 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) [2022-02-21 03:34:31,050 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:34:31,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:31,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:31,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2022-02-21 03:34:31,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:31,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:31,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:31,058 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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) [2022-02-21 03:34:31,060 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:34:31,061 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:34:31,061 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.6666666666666665) 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) [2022-02-21 03:34:31,066 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:34:31,068 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:34:31,068 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 50 transitions. cyclomatic complexity: 19 [2022-02-21 03:34:31,068 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:34:31,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:31,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:31,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:31,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:31,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:31,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:31,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:31,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:31,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:31,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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) Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:34:31,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:34:31,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:34:31,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:34:31,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:34:31,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:34:31,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:31,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:31,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:31,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:31,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:31,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:31,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:31,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:31,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:31,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:34:31,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:34:31,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:34:31,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:31,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:31,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:31,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:34:31,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:34:31,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:34:31,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:31,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:31,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:31,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:31,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:31,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:31,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:31,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:31,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:31,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:31,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:31,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:31,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,106 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) 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) [2022-02-21 03:34:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-21 03:34:31,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:31,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:34:31,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:34:31,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:31,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. cyclomatic complexity: 19 [2022-02-21 03:34:31,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:31,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2022-02-21 03:34:31,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:34:31,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:34:31,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2022-02-21 03:34:31,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:31,119 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-02-21 03:34:31,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2022-02-21 03:34:31,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 03:34:31,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:31,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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) [2022-02-21 03:34:31,139 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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) [2022-02-21 03:34:31,141 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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) [2022-02-21 03:34:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:31,144 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2022-02-21 03:34:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:34:31,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:31,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:31,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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 12 states and 17 transitions. [2022-02-21 03:34:31,145 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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 12 states and 17 transitions. [2022-02-21 03:34:31,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:31,146 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2022-02-21 03:34:31,146 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:34:31,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:31,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:31,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:31,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:31,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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) [2022-02-21 03:34:31,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2022-02-21 03:34:31,149 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-02-21 03:34:31,149 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-02-21 03:34:31,149 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:34:31,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:34:31,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:31,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:31,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:31,150 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:31,150 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:31,151 INFO L791 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 123#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 130#L367 assume !(main_~length~0#1 < 1); 124#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 125#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 126#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 127#L370-4 main_~j~0#1 := 0; 128#L378-2 [2022-02-21 03:34:31,151 INFO L793 eck$LassoCheckResult]: Loop: 128#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 129#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 128#L378-2 [2022-02-21 03:34:31,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:31,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2022-02-21 03:34:31,152 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:31,152 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053934335] [2022-02-21 03:34:31,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:31,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:31,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:31,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {161#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {161#true} is VALID [2022-02-21 03:34:31,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {161#true} is VALID [2022-02-21 03:34:31,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume !(main_~length~0#1 < 1); {163#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 03:34:31,228 INFO L290 TraceCheckUtils]: 3: Hoare triple {163#(<= 1 |ULTIMATE.start_main_~length~0#1|)} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {163#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 03:34:31,229 INFO L290 TraceCheckUtils]: 4: Hoare triple {163#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {164#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 03:34:31,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {164#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} assume !(main_~i~0#1 < main_~length~0#1); {162#false} is VALID [2022-02-21 03:34:31,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {162#false} main_~j~0#1 := 0; {162#false} is VALID [2022-02-21 03:34:31,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:31,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:31,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053934335] [2022-02-21 03:34:31,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053934335] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:34:31,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:34:31,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:34:31,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064004872] [2022-02-21 03:34:31,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:34:31,234 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:34:31,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:31,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2022-02-21 03:34:31,235 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:31,235 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102267166] [2022-02-21 03:34:31,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:31,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:31,243 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:31,248 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:31,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:31,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:34:31,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:34:31,303 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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) [2022-02-21 03:34:31,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:31,352 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 03:34:31,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:34:31,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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) [2022-02-21 03:34:31,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:31,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2022-02-21 03:34:31,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:31,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2022-02-21 03:34:31,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:34:31,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:34:31,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-02-21 03:34:31,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:31,365 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 03:34:31,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-02-21 03:34:31,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2022-02-21 03:34:31,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:31,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 19 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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) [2022-02-21 03:34:31,368 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 19 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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) [2022-02-21 03:34:31,368 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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) [2022-02-21 03:34:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:31,370 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 03:34:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2022-02-21 03:34:31,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:31,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:31,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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 14 states and 19 transitions. [2022-02-21 03:34:31,373 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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 14 states and 19 transitions. [2022-02-21 03:34:31,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:31,380 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 03:34:31,380 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2022-02-21 03:34:31,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:31,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:31,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:31,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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) [2022-02-21 03:34:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-02-21 03:34:31,381 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:34:31,381 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:34:31,381 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:34:31,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:34:31,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:31,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:31,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:31,382 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:31,382 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:31,383 INFO L791 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 182#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 189#L367 assume !(main_~length~0#1 < 1); 183#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 184#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 185#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 190#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 192#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 191#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 186#L370-4 main_~j~0#1 := 0; 187#L378-2 [2022-02-21 03:34:31,383 INFO L793 eck$LassoCheckResult]: Loop: 187#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 188#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 187#L378-2 [2022-02-21 03:34:31,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:31,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2022-02-21 03:34:31,383 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:31,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572928092] [2022-02-21 03:34:31,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:31,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:31,401 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:31,412 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:31,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:31,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2022-02-21 03:34:31,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:31,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701907465] [2022-02-21 03:34:31,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:31,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:31,419 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:31,423 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:31,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:31,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2022-02-21 03:34:31,424 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:31,424 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973514912] [2022-02-21 03:34:31,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:31,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:31,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {228#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {228#true} is VALID [2022-02-21 03:34:31,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {228#true} is VALID [2022-02-21 03:34:31,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume !(main_~length~0#1 < 1); {228#true} is VALID [2022-02-21 03:34:31,574 INFO L290 TraceCheckUtils]: 3: Hoare triple {228#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {230#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:34:31,574 INFO L290 TraceCheckUtils]: 4: Hoare triple {230#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {231#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:31,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:31,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {232#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))} is VALID [2022-02-21 03:34:31,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {234#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:31,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {234#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length~0#1); {234#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:31,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_~j~0#1 := 0; {235#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:34:31,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {236#(and (<= |ULTIMATE.start_main_#t~mem210#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:34:31,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {236#(and (<= |ULTIMATE.start_main_#t~mem210#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {229#false} is VALID [2022-02-21 03:34:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:31,580 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:31,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973514912] [2022-02-21 03:34:31,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973514912] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:34:31,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826559148] [2022-02-21 03:34:31,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:31,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:34:31,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:31,582 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) [2022-02-21 03:34:31,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-21 03:34:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:31,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 03:34:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:31,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:31,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-21 03:34:31,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-21 03:34:31,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {228#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {228#true} is VALID [2022-02-21 03:34:31,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {228#true} is VALID [2022-02-21 03:34:31,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume !(main_~length~0#1 < 1); {228#true} is VALID [2022-02-21 03:34:31,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {228#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {230#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:34:31,832 INFO L290 TraceCheckUtils]: 4: Hoare triple {230#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {231#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:31,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {255#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) |ULTIMATE.start_main_#t~mem209#1|))} is VALID [2022-02-21 03:34:31,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {255#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) |ULTIMATE.start_main_#t~mem209#1|))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {234#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:31,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {234#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {234#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:31,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {234#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length~0#1); {234#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:31,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_~j~0#1 := 0; {235#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:34:31,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {271#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} is VALID [2022-02-21 03:34:31,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {271#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {229#false} is VALID [2022-02-21 03:34:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:31,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:34:32,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-02-21 03:34:32,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-02-21 03:34:32,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {271#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {229#false} is VALID [2022-02-21 03:34:32,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {278#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {271#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} is VALID [2022-02-21 03:34:32,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0)} main_~j~0#1 := 0; {278#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:34:32,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0)} assume !(main_~i~0#1 < main_~length~0#1); {282#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0)} is VALID [2022-02-21 03:34:32,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {282#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0)} is VALID [2022-02-21 03:34:32,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {292#(or (< 0 |ULTIMATE.start_main_#t~mem209#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {282#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0)} is VALID [2022-02-21 03:34:32,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {296#(= (* |ULTIMATE.start_main_~i~0#1| 4) 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {292#(or (< 0 |ULTIMATE.start_main_#t~mem209#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0))} is VALID [2022-02-21 03:34:32,099 INFO L290 TraceCheckUtils]: 4: Hoare triple {228#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {296#(= (* |ULTIMATE.start_main_~i~0#1| 4) 0)} is VALID [2022-02-21 03:34:32,099 INFO L290 TraceCheckUtils]: 3: Hoare triple {228#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {228#true} is VALID [2022-02-21 03:34:32,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume !(main_~length~0#1 < 1); {228#true} is VALID [2022-02-21 03:34:32,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {228#true} is VALID [2022-02-21 03:34:32,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {228#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {228#true} is VALID [2022-02-21 03:34:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:32,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826559148] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:34:32,100 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:34:32,101 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-02-21 03:34:32,101 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086391972] [2022-02-21 03:34:32,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:34:32,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:32,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-21 03:34:32,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:34:32,159 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 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) [2022-02-21 03:34:32,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:32,389 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-02-21 03:34:32,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:34:32,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 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) [2022-02-21 03:34:32,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:32,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2022-02-21 03:34:32,415 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:34:32,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2022-02-21 03:34:32,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:34:32,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:34:32,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2022-02-21 03:34:32,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:32,416 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-02-21 03:34:32,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2022-02-21 03:34:32,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-02-21 03:34:32,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:32,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 30 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 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) [2022-02-21 03:34:32,418 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 30 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 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) [2022-02-21 03:34:32,418 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 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) [2022-02-21 03:34:32,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:32,419 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-02-21 03:34:32,419 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-02-21 03:34:32,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:32,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:32,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 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 22 states and 30 transitions. [2022-02-21 03:34:32,420 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 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 22 states and 30 transitions. [2022-02-21 03:34:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:32,421 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-02-21 03:34:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-02-21 03:34:32,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:32,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:32,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:32,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:32,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 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) [2022-02-21 03:34:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-02-21 03:34:32,422 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 03:34:32,422 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 03:34:32,422 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:34:32,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-02-21 03:34:32,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:32,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:32,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:32,426 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:32,426 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:32,426 INFO L791 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 336#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 343#L367 assume !(main_~length~0#1 < 1); 337#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 338#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 339#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 344#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 348#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 345#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 346#L370-4 main_~j~0#1 := 0; 352#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 340#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 341#L378-2 [2022-02-21 03:34:32,426 INFO L793 eck$LassoCheckResult]: Loop: 341#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 349#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 341#L378-2 [2022-02-21 03:34:32,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:32,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2022-02-21 03:34:32,427 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:32,427 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754889833] [2022-02-21 03:34:32,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:32,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:32,448 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:32,477 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:32,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:32,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2022-02-21 03:34:32,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:32,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019889216] [2022-02-21 03:34:32,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:32,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:32,492 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:32,500 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:32,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:32,502 INFO L85 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2022-02-21 03:34:32,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:32,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467506200] [2022-02-21 03:34:32,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:32,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:32,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {405#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {405#true} is VALID [2022-02-21 03:34:32,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {405#true} is VALID [2022-02-21 03:34:32,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#true} assume !(main_~length~0#1 < 1); {405#true} is VALID [2022-02-21 03:34:32,662 INFO L290 TraceCheckUtils]: 3: Hoare triple {405#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {407#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} is VALID [2022-02-21 03:34:32,662 INFO L290 TraceCheckUtils]: 4: Hoare triple {407#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {408#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} is VALID [2022-02-21 03:34:32,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {408#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {408#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} is VALID [2022-02-21 03:34:32,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {408#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {408#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} is VALID [2022-02-21 03:34:32,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {408#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {409#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ (* |ULTIMATE.start_main_~length~0#1| 4) 4)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:32,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {409#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ (* |ULTIMATE.start_main_~length~0#1| 4) 4)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length~0#1); {410#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 4))} is VALID [2022-02-21 03:34:32,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {410#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 4))} main_~j~0#1 := 0; {411#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 4) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:34:32,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {411#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 4) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {411#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 4) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:34:32,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {411#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 4) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {412#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~j~0#1| 4)))} is VALID [2022-02-21 03:34:32,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {412#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~j~0#1| 4)))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {406#false} is VALID [2022-02-21 03:34:32,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {406#false} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {406#false} is VALID [2022-02-21 03:34:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:32,668 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:32,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467506200] [2022-02-21 03:34:32,668 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467506200] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:34:32,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813226575] [2022-02-21 03:34:32,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:32,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:34:32,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:32,670 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) [2022-02-21 03:34:32,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-21 03:34:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:32,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:34:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:32,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:32,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {405#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {405#true} is VALID [2022-02-21 03:34:32,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {405#true} is VALID [2022-02-21 03:34:32,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#true} assume !(main_~length~0#1 < 1); {405#true} is VALID [2022-02-21 03:34:32,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {405#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {405#true} is VALID [2022-02-21 03:34:32,887 INFO L290 TraceCheckUtils]: 4: Hoare triple {405#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:32,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:32,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:32,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {438#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:34:32,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {438#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~length~0#1); {442#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:34:32,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {442#(<= |ULTIMATE.start_main_~length~0#1| 1)} main_~j~0#1 := 0; {446#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:34:32,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {446#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {446#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:34:32,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {446#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {453#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:34:32,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {453#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {406#false} is VALID [2022-02-21 03:34:32,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {406#false} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {406#false} is VALID [2022-02-21 03:34:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:32,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:34:32,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {406#false} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {406#false} is VALID [2022-02-21 03:34:32,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {463#(not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~length~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {406#false} is VALID [2022-02-21 03:34:32,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {463#(not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 03:34:32,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {467#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {467#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:34:32,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {442#(<= |ULTIMATE.start_main_~length~0#1| 1)} main_~j~0#1 := 0; {467#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:34:32,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {438#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~length~0#1); {442#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:34:32,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {438#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:34:32,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:32,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:32,994 INFO L290 TraceCheckUtils]: 4: Hoare triple {405#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {428#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:34:32,994 INFO L290 TraceCheckUtils]: 3: Hoare triple {405#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {405#true} is VALID [2022-02-21 03:34:32,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#true} assume !(main_~length~0#1 < 1); {405#true} is VALID [2022-02-21 03:34:32,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {405#true} is VALID [2022-02-21 03:34:32,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {405#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {405#true} is VALID [2022-02-21 03:34:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:32,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813226575] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:34:32,996 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:34:32,996 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-02-21 03:34:32,996 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538963451] [2022-02-21 03:34:32,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:34:33,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:33,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-21 03:34:33,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:34:33,045 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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) [2022-02-21 03:34:33,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:33,516 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-21 03:34:33,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:34:33,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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) [2022-02-21 03:34:33,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:33,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2022-02-21 03:34:33,549 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:34:33,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 38 states and 50 transitions. [2022-02-21 03:34:33,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-02-21 03:34:33,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-02-21 03:34:33,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 50 transitions. [2022-02-21 03:34:33,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:33,551 INFO L681 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2022-02-21 03:34:33,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 50 transitions. [2022-02-21 03:34:33,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2022-02-21 03:34:33,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:33,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states and 50 transitions. Second operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 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) [2022-02-21 03:34:33,554 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states and 50 transitions. Second operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 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) [2022-02-21 03:34:33,554 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 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) [2022-02-21 03:34:33,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:33,556 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-02-21 03:34:33,556 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2022-02-21 03:34:33,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:33,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:33,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 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 38 states and 50 transitions. [2022-02-21 03:34:33,557 INFO L87 Difference]: Start difference. First operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 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 38 states and 50 transitions. [2022-02-21 03:34:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:33,559 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-02-21 03:34:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2022-02-21 03:34:33,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:33,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:33,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:33,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 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) [2022-02-21 03:34:33,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-02-21 03:34:33,561 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-02-21 03:34:33,561 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-02-21 03:34:33,561 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:34:33,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2022-02-21 03:34:33,562 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:34:33,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:33,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:33,562 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:33,562 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:33,563 INFO L791 eck$LassoCheckResult]: Stem: 552#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 553#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 561#L367 assume main_~length~0#1 < 1;main_~length~0#1 := 1; 554#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 555#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 556#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 563#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 572#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 573#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 574#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 569#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 570#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 557#L370-4 main_~j~0#1 := 0; 558#L378-2 [2022-02-21 03:34:33,563 INFO L793 eck$LassoCheckResult]: Loop: 558#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 568#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 558#L378-2 [2022-02-21 03:34:33,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:33,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1080825110, now seen corresponding path program 1 times [2022-02-21 03:34:33,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:33,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338212561] [2022-02-21 03:34:33,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:33,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:33,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {665#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {665#true} is VALID [2022-02-21 03:34:33,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {665#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {665#true} is VALID [2022-02-21 03:34:33,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {665#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {667#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:34:33,653 INFO L290 TraceCheckUtils]: 3: Hoare triple {667#(<= |ULTIMATE.start_main_~length~0#1| 1)} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {668#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:33,654 INFO L290 TraceCheckUtils]: 4: Hoare triple {668#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {669#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:33,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {669#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {669#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:33,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {669#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {669#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:33,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {669#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {670#(and (<= |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~i~0#1|) (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:33,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#(and (<= |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~i~0#1|) (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {666#false} is VALID [2022-02-21 03:34:33,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {666#false} assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {666#false} is VALID [2022-02-21 03:34:33,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {666#false} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {666#false} is VALID [2022-02-21 03:34:33,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {666#false} assume !(main_~i~0#1 < main_~length~0#1); {666#false} is VALID [2022-02-21 03:34:33,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {666#false} main_~j~0#1 := 0; {666#false} is VALID [2022-02-21 03:34:33,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:33,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:33,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338212561] [2022-02-21 03:34:33,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338212561] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:34:33,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211704742] [2022-02-21 03:34:33,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:33,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:34:33,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:33,667 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:34:33,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-21 03:34:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:33,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:34:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:33,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:33,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {665#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {665#true} is VALID [2022-02-21 03:34:33,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {665#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {665#true} is VALID [2022-02-21 03:34:33,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {665#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {667#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:34:33,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {667#(<= |ULTIMATE.start_main_~length~0#1| 1)} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {667#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:34:33,833 INFO L290 TraceCheckUtils]: 4: Hoare triple {667#(<= |ULTIMATE.start_main_~length~0#1| 1)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {686#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:34:33,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {686#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {686#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:34:33,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {686#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {686#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:34:33,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {686#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {696#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 1 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:34:33,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {696#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (<= 1 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {666#false} is VALID [2022-02-21 03:34:33,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {666#false} assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {666#false} is VALID [2022-02-21 03:34:33,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {666#false} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {666#false} is VALID [2022-02-21 03:34:33,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {666#false} assume !(main_~i~0#1 < main_~length~0#1); {666#false} is VALID [2022-02-21 03:34:33,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {666#false} main_~j~0#1 := 0; {666#false} is VALID [2022-02-21 03:34:33,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:33,837 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:34:33,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211704742] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:34:33,838 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:34:33,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2022-02-21 03:34:33,839 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100126323] [2022-02-21 03:34:33,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:34:33,839 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:34:33,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:33,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2022-02-21 03:34:33,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:33,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68613963] [2022-02-21 03:34:33,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:33,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:33,853 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:33,861 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:33,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:33,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:34:33,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:34:33,912 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2022-02-21 03:34:33,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:33,953 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-21 03:34:33,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:34:33,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2022-02-21 03:34:33,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:33,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2022-02-21 03:34:33,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:33,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 21 states and 27 transitions. [2022-02-21 03:34:33,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:34:33,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:34:33,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2022-02-21 03:34:33,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:33,968 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-02-21 03:34:33,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2022-02-21 03:34:33,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-21 03:34:33,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:33,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 27 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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) [2022-02-21 03:34:33,970 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 27 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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) [2022-02-21 03:34:33,970 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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) [2022-02-21 03:34:33,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:33,971 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-02-21 03:34:33,971 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-21 03:34:33,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:33,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:33,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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) Second operand 21 states and 27 transitions. [2022-02-21 03:34:33,972 INFO L87 Difference]: Start difference. First operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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) Second operand 21 states and 27 transitions. [2022-02-21 03:34:33,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:33,973 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-02-21 03:34:33,973 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-21 03:34:33,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:33,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:33,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:33,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:33,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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) [2022-02-21 03:34:33,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-02-21 03:34:33,975 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-02-21 03:34:33,975 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-02-21 03:34:33,975 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:34:33,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2022-02-21 03:34:33,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:33,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:33,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:33,976 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:33,976 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:33,976 INFO L791 eck$LassoCheckResult]: Stem: 738#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 739#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 746#L367 assume !(main_~length~0#1 < 1); 740#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 741#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 742#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 747#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 750#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 748#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 749#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 757#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 754#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 745#L370-4 main_~j~0#1 := 0; 744#L378-2 [2022-02-21 03:34:33,977 INFO L793 eck$LassoCheckResult]: Loop: 744#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 751#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 744#L378-2 [2022-02-21 03:34:33,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:33,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1781889688, now seen corresponding path program 1 times [2022-02-21 03:34:33,977 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:33,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458341666] [2022-02-21 03:34:33,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:33,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:33,993 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:34,002 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:34,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:34,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2022-02-21 03:34:34,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:34,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841322710] [2022-02-21 03:34:34,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:34,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:34,007 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:34,010 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:34,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:34,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959589, now seen corresponding path program 1 times [2022-02-21 03:34:34,010 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:34,010 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561338375] [2022-02-21 03:34:34,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:34,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:34,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {808#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {808#true} is VALID [2022-02-21 03:34:34,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {808#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {808#true} is VALID [2022-02-21 03:34:34,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {808#true} assume !(main_~length~0#1 < 1); {808#true} is VALID [2022-02-21 03:34:34,217 INFO L290 TraceCheckUtils]: 3: Hoare triple {808#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {810#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:34:34,218 INFO L290 TraceCheckUtils]: 4: Hoare triple {810#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {811#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:34,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {811#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {812#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:34,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {812#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {813#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))} is VALID [2022-02-21 03:34:34,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {813#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {814#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0)))} is VALID [2022-02-21 03:34:34,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {814#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0)))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {814#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0)))} is VALID [2022-02-21 03:34:34,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {814#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0)))} assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {815#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:34,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {815#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {815#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:34,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {815#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length~0#1); {815#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:34,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {815#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_~j~0#1 := 0; {816#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:34:34,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {816#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {817#(and (<= |ULTIMATE.start_main_#t~mem210#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:34:34,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {817#(and (<= |ULTIMATE.start_main_#t~mem210#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {809#false} is VALID [2022-02-21 03:34:34,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:34,227 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:34,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561338375] [2022-02-21 03:34:34,227 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561338375] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:34:34,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893305498] [2022-02-21 03:34:34,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:34,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:34:34,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:34,231 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:34:34,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-21 03:34:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:34,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-21 03:34:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:34,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:34,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2022-02-21 03:34:34,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:34:34,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-02-21 03:34:34,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:34:34,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-02-21 03:34:34,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-21 03:34:34,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {808#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {808#true} is VALID [2022-02-21 03:34:34,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {808#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {808#true} is VALID [2022-02-21 03:34:34,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {808#true} assume !(main_~length~0#1 < 1); {808#true} is VALID [2022-02-21 03:34:34,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {808#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {810#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:34:34,599 INFO L290 TraceCheckUtils]: 4: Hoare triple {810#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {811#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:34,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {811#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {836#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem209#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:34,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {836#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem209#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {813#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))} is VALID [2022-02-21 03:34:34,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {813#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {843#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0))} is VALID [2022-02-21 03:34:34,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {843#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {843#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0))} is VALID [2022-02-21 03:34:34,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {843#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0))} assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {815#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:34,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {815#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {815#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:34,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {815#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length~0#1); {815#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:34:34,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {815#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_~j~0#1 := 0; {816#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:34:34,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {816#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {862#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} is VALID [2022-02-21 03:34:34,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {862#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {809#false} is VALID [2022-02-21 03:34:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:34:34,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:34:46,809 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (forall ((v_ArrVal_92 Int)) (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) v_ArrVal_92) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_36|)))) is different from false [2022-02-21 03:34:58,922 WARN L228 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-21 03:34:59,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-02-21 03:34:59,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 150 [2022-02-21 03:34:59,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {862#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {809#false} is VALID [2022-02-21 03:34:59,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {869#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {862#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} is VALID [2022-02-21 03:34:59,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {873#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0)} main_~j~0#1 := 0; {869#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:34:59,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {873#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0)} assume !(main_~i~0#1 < main_~length~0#1); {873#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0)} is VALID [2022-02-21 03:34:59,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {873#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {873#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0)} is VALID [2022-02-21 03:34:59,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {883#(forall ((v_ArrVal_92 Int)) (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_92) |ULTIMATE.start_main_~arr~0#1.offset|) 0))} assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {873#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) |ULTIMATE.start_main_~arr~0#1.offset|) 0)} is VALID [2022-02-21 03:34:59,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {883#(forall ((v_ArrVal_92 Int)) (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_92) |ULTIMATE.start_main_~arr~0#1.offset|) 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {883#(forall ((v_ArrVal_92 Int)) (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_92) |ULTIMATE.start_main_~arr~0#1.offset|) 0))} is VALID [2022-02-21 03:34:59,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {890#(forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_36|)) (forall ((v_ArrVal_92 Int)) (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) v_ArrVal_92) |ULTIMATE.start_main_~arr~0#1.offset|) 0))))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {883#(forall ((v_ArrVal_92 Int)) (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_92) |ULTIMATE.start_main_~arr~0#1.offset|) 0))} is VALID [2022-02-21 03:34:59,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {894#(or (< 0 |ULTIMATE.start_main_#t~mem209#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_36|)) (forall ((v_ArrVal_92 Int)) (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) v_ArrVal_92) |ULTIMATE.start_main_~arr~0#1.offset|) 0)))))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {890#(forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_36|)) (forall ((v_ArrVal_92 Int)) (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) v_ArrVal_92) |ULTIMATE.start_main_~arr~0#1.offset|) 0))))} is VALID [2022-02-21 03:34:59,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {898#(= (* |ULTIMATE.start_main_~i~0#1| 4) 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {894#(or (< 0 |ULTIMATE.start_main_#t~mem209#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_36|)) (forall ((v_ArrVal_92 Int)) (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) v_ArrVal_92) |ULTIMATE.start_main_~arr~0#1.offset|) 0)))))} is VALID [2022-02-21 03:34:59,340 INFO L290 TraceCheckUtils]: 4: Hoare triple {808#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {898#(= (* |ULTIMATE.start_main_~i~0#1| 4) 0)} is VALID [2022-02-21 03:34:59,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {808#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {808#true} is VALID [2022-02-21 03:34:59,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {808#true} assume !(main_~length~0#1 < 1); {808#true} is VALID [2022-02-21 03:34:59,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {808#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {808#true} is VALID [2022-02-21 03:34:59,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {808#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {808#true} is VALID [2022-02-21 03:34:59,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-21 03:34:59,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893305498] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:34:59,342 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:34:59,342 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-02-21 03:34:59,342 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423279009] [2022-02-21 03:34:59,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:34:59,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:59,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-21 03:34:59,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=239, Unknown=1, NotChecked=32, Total=342 [2022-02-21 03:34:59,393 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 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) [2022-02-21 03:35:11,497 WARN L838 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (forall ((v_ArrVal_92 Int)) (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) v_ArrVal_92) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_36|)))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2022-02-21 03:35:23,549 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (forall ((v_ArrVal_92 Int)) (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) v_ArrVal_92) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_36|)))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2022-02-21 03:35:23,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:23,731 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-02-21 03:35:23,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-21 03:35:23,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 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) [2022-02-21 03:35:23,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:23,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2022-02-21 03:35:23,765 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:23,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 39 transitions. [2022-02-21 03:35:23,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-02-21 03:35:23,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-02-21 03:35:23,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2022-02-21 03:35:23,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:23,766 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-02-21 03:35:23,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2022-02-21 03:35:23,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 17. [2022-02-21 03:35:23,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:23,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 39 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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) [2022-02-21 03:35:23,770 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 39 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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) [2022-02-21 03:35:23,770 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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) [2022-02-21 03:35:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:23,771 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-02-21 03:35:23,772 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-02-21 03:35:23,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:23,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:23,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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) Second operand 31 states and 39 transitions. [2022-02-21 03:35:23,772 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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) Second operand 31 states and 39 transitions. [2022-02-21 03:35:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:23,773 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-02-21 03:35:23,773 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-02-21 03:35:23,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:23,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:23,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:23,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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) [2022-02-21 03:35:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-02-21 03:35:23,774 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-02-21 03:35:23,774 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-02-21 03:35:23,774 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:35:23,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2022-02-21 03:35:23,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:23,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:23,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:23,775 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:23,775 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:23,776 INFO L791 eck$LassoCheckResult]: Stem: 956#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 957#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 965#L367 assume !(main_~length~0#1 < 1); 958#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 959#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 960#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 966#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 971#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 967#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 968#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 969#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 970#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 961#L370-4 main_~j~0#1 := 0; 962#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 963#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 964#L378-2 [2022-02-21 03:35:23,776 INFO L793 eck$LassoCheckResult]: Loop: 964#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 972#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 964#L378-2 [2022-02-21 03:35:23,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:23,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2022-02-21 03:35:23,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:23,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070120830] [2022-02-21 03:35:23,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:23,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,808 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,830 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:23,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:23,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2022-02-21 03:35:23,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:23,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557007406] [2022-02-21 03:35:23,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:23,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,836 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:23,839 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:23,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:23,839 INFO L85 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2022-02-21 03:35:23,839 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:23,839 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160347049] [2022-02-21 03:35:23,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:23,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:23,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {1042#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1042#true} is VALID [2022-02-21 03:35:23,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1042#true} is VALID [2022-02-21 03:35:23,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume !(main_~length~0#1 < 1); {1042#true} is VALID [2022-02-21 03:35:23,960 INFO L290 TraceCheckUtils]: 3: Hoare triple {1042#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1042#true} is VALID [2022-02-21 03:35:23,961 INFO L290 TraceCheckUtils]: 4: Hoare triple {1042#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:23,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:23,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:23,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1045#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:23,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {1045#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1046#(and (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:23,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {1046#(and (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1047#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:23,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {1047#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1048#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} is VALID [2022-02-21 03:35:23,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {1048#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} assume !(main_~i~0#1 < main_~length~0#1); {1048#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} is VALID [2022-02-21 03:35:23,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {1048#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} main_~j~0#1 := 0; {1049#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:23,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {1049#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1049#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:23,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {1049#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1050#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:23,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {1050#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1051#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} is VALID [2022-02-21 03:35:23,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {1051#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1043#false} is VALID [2022-02-21 03:35:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:23,969 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:23,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160347049] [2022-02-21 03:35:23,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160347049] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:23,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783704083] [2022-02-21 03:35:23,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:35:23,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:23,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,975 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:23,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-21 03:35:24,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:35:24,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:35:24,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 03:35:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:24,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:24,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2022-02-21 03:35:24,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-21 03:35:24,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {1042#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1042#true} is VALID [2022-02-21 03:35:24,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1042#true} is VALID [2022-02-21 03:35:24,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume !(main_~length~0#1 < 1); {1042#true} is VALID [2022-02-21 03:35:24,379 INFO L290 TraceCheckUtils]: 3: Hoare triple {1042#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1042#true} is VALID [2022-02-21 03:35:24,380 INFO L290 TraceCheckUtils]: 4: Hoare triple {1042#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:24,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:24,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:24,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1045#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:24,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {1045#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1079#(exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem209#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-21 03:35:24,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {1079#(exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem209#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1048#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} is VALID [2022-02-21 03:35:24,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {1048#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1048#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} is VALID [2022-02-21 03:35:24,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {1048#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} assume !(main_~i~0#1 < main_~length~0#1); {1048#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} is VALID [2022-02-21 03:35:24,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {1048#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} main_~j~0#1 := 0; {1049#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:24,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {1049#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1049#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:24,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {1049#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1098#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:35:24,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {1098#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~j~0#1| 1))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1051#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} is VALID [2022-02-21 03:35:24,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {1051#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1043#false} is VALID [2022-02-21 03:35:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:24,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:24,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-02-21 03:35:24,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-02-21 03:35:24,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {1051#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1043#false} is VALID [2022-02-21 03:35:24,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {1050#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1051#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} is VALID [2022-02-21 03:35:24,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {1111#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1050#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:24,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {1111#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1111#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:24,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {1048#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} main_~j~0#1 := 0; {1111#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:24,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {1048#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} assume !(main_~i~0#1 < main_~length~0#1); {1048#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} is VALID [2022-02-21 03:35:24,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {1048#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1048#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} is VALID [2022-02-21 03:35:24,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {1127#(or (< 0 |ULTIMATE.start_main_#t~mem209#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1048#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} is VALID [2022-02-21 03:35:24,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {1045#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1127#(or (< 0 |ULTIMATE.start_main_#t~mem209#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0))} is VALID [2022-02-21 03:35:24,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1045#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:24,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:24,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:24,661 INFO L290 TraceCheckUtils]: 4: Hoare triple {1042#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1044#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:24,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {1042#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1042#true} is VALID [2022-02-21 03:35:24,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume !(main_~length~0#1 < 1); {1042#true} is VALID [2022-02-21 03:35:24,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1042#true} is VALID [2022-02-21 03:35:24,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {1042#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1042#true} is VALID [2022-02-21 03:35:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:24,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783704083] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:24,662 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:24,662 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-02-21 03:35:24,662 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863271364] [2022-02-21 03:35:24,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:24,700 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:24,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:35:24,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:35:24,700 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 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) [2022-02-21 03:35:24,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:24,939 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-21 03:35:24,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:35:24,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 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) [2022-02-21 03:35:24,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:24,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2022-02-21 03:35:24,962 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:24,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2022-02-21 03:35:24,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-02-21 03:35:24,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-02-21 03:35:24,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2022-02-21 03:35:24,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:24,963 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-02-21 03:35:24,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2022-02-21 03:35:24,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-02-21 03:35:24,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:24,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states and 37 transitions. Second operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 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) [2022-02-21 03:35:24,965 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states and 37 transitions. Second operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 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) [2022-02-21 03:35:24,965 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 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) [2022-02-21 03:35:24,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:24,966 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-21 03:35:24,966 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-02-21 03:35:24,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:24,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:24,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 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 29 states and 37 transitions. [2022-02-21 03:35:24,967 INFO L87 Difference]: Start difference. First operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 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 29 states and 37 transitions. [2022-02-21 03:35:24,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:24,967 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-21 03:35:24,967 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-02-21 03:35:24,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:24,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:24,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:24,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 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) [2022-02-21 03:35:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-02-21 03:35:24,969 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-02-21 03:35:24,969 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-02-21 03:35:24,969 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:35:24,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2022-02-21 03:35:24,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:24,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:24,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:24,970 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:24,970 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:24,970 INFO L791 eck$LassoCheckResult]: Stem: 1183#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1184#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1191#L367 assume !(main_~length~0#1 < 1); 1185#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1186#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1187#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1192#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1200#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1193#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1194#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1195#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1197#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1198#L370-4 main_~j~0#1 := 0; 1203#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1190#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1189#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1196#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1202#L378-2 [2022-02-21 03:35:24,970 INFO L793 eck$LassoCheckResult]: Loop: 1202#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1201#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1202#L378-2 [2022-02-21 03:35:24,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:24,970 INFO L85 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2022-02-21 03:35:24,971 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:24,971 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977641191] [2022-02-21 03:35:24,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:24,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:24,999 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:25,010 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:25,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:25,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 7 times [2022-02-21 03:35:25,011 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:25,011 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066838274] [2022-02-21 03:35:25,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:25,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:25,016 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:25,019 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:25,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:25,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2022-02-21 03:35:25,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:25,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102059268] [2022-02-21 03:35:25,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:25,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:25,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {1272#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1272#true} is VALID [2022-02-21 03:35:25,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {1272#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1272#true} is VALID [2022-02-21 03:35:25,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {1272#true} assume !(main_~length~0#1 < 1); {1272#true} is VALID [2022-02-21 03:35:25,181 INFO L290 TraceCheckUtils]: 3: Hoare triple {1272#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1274#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:25,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {1274#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1275#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:25,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {1275#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1275#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:25,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {1275#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1275#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:25,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {1275#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1276#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:25,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {1276#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1276#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:25,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {1276#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1276#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:25,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {1276#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1277#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~i~0#1| 2) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:25,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {1277#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~i~0#1| 2) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length~0#1); {1278#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~length~0#1| 2))} is VALID [2022-02-21 03:35:25,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {1278#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~length~0#1| 2))} main_~j~0#1 := 0; {1279#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~length~0#1| 2) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:25,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {1279#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~length~0#1| 2) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1279#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~length~0#1| 2) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:25,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {1279#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= |ULTIMATE.start_main_~length~0#1| 2) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1280#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:25,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {1280#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1280#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:25,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {1280#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1281#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:25,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {1281#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (<= |ULTIMATE.start_main_~length~0#1| |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1273#false} is VALID [2022-02-21 03:35:25,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {1273#false} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1273#false} is VALID [2022-02-21 03:35:25,191 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:25,192 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:25,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102059268] [2022-02-21 03:35:25,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102059268] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:25,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45892309] [2022-02-21 03:35:25,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:35:25,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:25,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,199 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:25,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-21 03:35:25,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-21 03:35:25,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:35:25,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:25,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:25,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {1272#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1272#true} is VALID [2022-02-21 03:35:25,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {1272#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1272#true} is VALID [2022-02-21 03:35:25,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {1272#true} assume !(main_~length~0#1 < 1); {1272#true} is VALID [2022-02-21 03:35:25,452 INFO L290 TraceCheckUtils]: 3: Hoare triple {1272#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1272#true} is VALID [2022-02-21 03:35:25,456 INFO L290 TraceCheckUtils]: 4: Hoare triple {1272#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:25,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:25,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:25,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:25,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:25,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:25,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1317#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:25,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {1317#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < main_~length~0#1); {1321#(<= |ULTIMATE.start_main_~length~0#1| 2)} is VALID [2022-02-21 03:35:25,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {1321#(<= |ULTIMATE.start_main_~length~0#1| 2)} main_~j~0#1 := 0; {1325#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} is VALID [2022-02-21 03:35:25,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {1325#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1325#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} is VALID [2022-02-21 03:35:25,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {1325#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1332#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} is VALID [2022-02-21 03:35:25,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {1332#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1332#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} is VALID [2022-02-21 03:35:25,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {1332#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1339#(and (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} is VALID [2022-02-21 03:35:25,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {1339#(and (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~length~0#1| 2))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1273#false} is VALID [2022-02-21 03:35:25,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {1273#false} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1273#false} is VALID [2022-02-21 03:35:25,480 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:25,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:25,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {1273#false} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1273#false} is VALID [2022-02-21 03:35:25,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {1349#(not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~length~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1273#false} is VALID [2022-02-21 03:35:25,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {1353#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1349#(not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 03:35:25,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {1353#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1353#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:35:25,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {1360#(<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1353#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:35:25,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {1360#(<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1360#(<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:25,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {1321#(<= |ULTIMATE.start_main_~length~0#1| 2)} main_~j~0#1 := 0; {1360#(<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:25,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {1317#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < main_~length~0#1); {1321#(<= |ULTIMATE.start_main_~length~0#1| 2)} is VALID [2022-02-21 03:35:25,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1317#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:25,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:25,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:25,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1307#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:25,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:25,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:25,638 INFO L290 TraceCheckUtils]: 4: Hoare triple {1272#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1297#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:25,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {1272#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1272#true} is VALID [2022-02-21 03:35:25,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {1272#true} assume !(main_~length~0#1 < 1); {1272#true} is VALID [2022-02-21 03:35:25,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {1272#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1272#true} is VALID [2022-02-21 03:35:25,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {1272#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1272#true} is VALID [2022-02-21 03:35:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:25,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45892309] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:25,639 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:25,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-02-21 03:35:25,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891754493] [2022-02-21 03:35:25,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:25,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:25,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-21 03:35:25,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-02-21 03:35:25,682 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 10 Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 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) [2022-02-21 03:35:25,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:25,995 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-02-21 03:35:25,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:35:25,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 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) [2022-02-21 03:35:26,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:26,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2022-02-21 03:35:26,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:26,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 29 states and 37 transitions. [2022-02-21 03:35:26,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:35:26,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:35:26,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2022-02-21 03:35:26,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:26,033 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-02-21 03:35:26,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2022-02-21 03:35:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-02-21 03:35:26,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:26,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states and 37 transitions. Second operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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) [2022-02-21 03:35:26,035 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states and 37 transitions. Second operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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) [2022-02-21 03:35:26,035 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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) [2022-02-21 03:35:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:26,036 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-21 03:35:26,036 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-02-21 03:35:26,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:26,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:26,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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) Second operand 29 states and 37 transitions. [2022-02-21 03:35:26,036 INFO L87 Difference]: Start difference. First operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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) Second operand 29 states and 37 transitions. [2022-02-21 03:35:26,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:26,037 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-21 03:35:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-02-21 03:35:26,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:26,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:26,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:26,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:26,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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) [2022-02-21 03:35:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-02-21 03:35:26,038 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-02-21 03:35:26,038 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-02-21 03:35:26,039 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:35:26,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2022-02-21 03:35:26,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:26,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:26,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:26,039 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:26,039 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:26,040 INFO L791 eck$LassoCheckResult]: Stem: 1443#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1444#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1452#L367 assume !(main_~length~0#1 < 1); 1445#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1446#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1447#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1453#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1468#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1467#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1456#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1457#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1454#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1455#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1465#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1463#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1462#L370-4 main_~j~0#1 := 0; 1451#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1461#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1460#L378-2 [2022-02-21 03:35:26,040 INFO L793 eck$LassoCheckResult]: Loop: 1460#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1459#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1460#L378-2 [2022-02-21 03:35:26,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:26,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1742222883, now seen corresponding path program 1 times [2022-02-21 03:35:26,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:26,040 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561334455] [2022-02-21 03:35:26,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:26,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:26,078 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:26,087 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:26,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:26,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 8 times [2022-02-21 03:35:26,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:26,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714265159] [2022-02-21 03:35:26,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:26,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:26,093 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:26,095 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:26,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:26,096 INFO L85 PathProgramCache]: Analyzing trace with hash -761053530, now seen corresponding path program 1 times [2022-02-21 03:35:26,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:26,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738873637] [2022-02-21 03:35:26,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:26,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:26,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {1534#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1534#true} is VALID [2022-02-21 03:35:26,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {1534#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1534#true} is VALID [2022-02-21 03:35:26,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {1534#true} assume !(main_~length~0#1 < 1); {1534#true} is VALID [2022-02-21 03:35:26,230 INFO L290 TraceCheckUtils]: 3: Hoare triple {1534#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1534#true} is VALID [2022-02-21 03:35:26,231 INFO L290 TraceCheckUtils]: 4: Hoare triple {1534#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:26,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:26,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:26,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1537#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:26,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {1537#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1538#(and (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:26,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {1538#(and (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1539#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:26,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {1539#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1540#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-21 03:35:26,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {1540#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1540#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-21 03:35:26,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {1540#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1541#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} is VALID [2022-02-21 03:35:26,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {1541#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1541#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} is VALID [2022-02-21 03:35:26,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {1541#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} assume !(main_~i~0#1 < main_~length~0#1); {1541#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} is VALID [2022-02-21 03:35:26,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {1541#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} main_~j~0#1 := 0; {1542#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:26,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {1542#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1542#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:26,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {1542#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1543#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:26,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {1543#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1544#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} is VALID [2022-02-21 03:35:26,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {1544#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1535#false} is VALID [2022-02-21 03:35:26,240 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:26,240 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:26,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738873637] [2022-02-21 03:35:26,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738873637] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:26,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953604847] [2022-02-21 03:35:26,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:26,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:26,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,243 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:26,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-21 03:35:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:26,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-21 03:35:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:26,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:26,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2022-02-21 03:35:26,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:35:26,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-02-21 03:35:26,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:35:26,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-02-21 03:35:26,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-21 03:35:26,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {1534#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1534#true} is VALID [2022-02-21 03:35:26,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {1534#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1534#true} is VALID [2022-02-21 03:35:26,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {1534#true} assume !(main_~length~0#1 < 1); {1534#true} is VALID [2022-02-21 03:35:26,731 INFO L290 TraceCheckUtils]: 3: Hoare triple {1534#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1557#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:35:26,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {1557#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1561#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:26,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {1561#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1561#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:26,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {1561#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1561#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:26,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {1561#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1571#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:26,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {1571#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1575#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem209#1|) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:26,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {1575#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem209#1|) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1579#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))} is VALID [2022-02-21 03:35:26,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {1579#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1583#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:26,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {1583#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1583#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:26,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {1583#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1590#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:26,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {1590#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1590#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:26,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {1590#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length~0#1); {1590#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:26,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {1590#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_~j~0#1 := 0; {1600#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:26,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {1600#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1600#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:26,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {1600#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1607#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:26,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {1607#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1544#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} is VALID [2022-02-21 03:35:26,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {1544#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1535#false} is VALID [2022-02-21 03:35:26,746 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:26,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:27,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-02-21 03:35:27,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-02-21 03:35:27,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {1544#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1535#false} is VALID [2022-02-21 03:35:27,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {1543#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1544#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} is VALID [2022-02-21 03:35:27,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {1620#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1543#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:27,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {1620#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1620#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:27,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {1541#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} main_~j~0#1 := 0; {1620#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:27,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {1541#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} assume !(main_~i~0#1 < main_~length~0#1); {1541#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} is VALID [2022-02-21 03:35:27,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {1541#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1541#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} is VALID [2022-02-21 03:35:27,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {1540#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1541#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)} is VALID [2022-02-21 03:35:27,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {1540#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1540#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-21 03:35:27,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {1642#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (not (<= |ULTIMATE.start_main_~i~0#1| 0)))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1540#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-21 03:35:27,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {1646#(or (< 0 |ULTIMATE.start_main_#t~mem209#1|) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (not (<= |ULTIMATE.start_main_~i~0#1| 0))))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1642#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (not (<= |ULTIMATE.start_main_~i~0#1| 0)))} is VALID [2022-02-21 03:35:27,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {1537#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1646#(or (< 0 |ULTIMATE.start_main_#t~mem209#1|) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (not (<= |ULTIMATE.start_main_~i~0#1| 0))))} is VALID [2022-02-21 03:35:27,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1537#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:27,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:27,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:27,073 INFO L290 TraceCheckUtils]: 4: Hoare triple {1534#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1536#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:27,073 INFO L290 TraceCheckUtils]: 3: Hoare triple {1534#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1534#true} is VALID [2022-02-21 03:35:27,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {1534#true} assume !(main_~length~0#1 < 1); {1534#true} is VALID [2022-02-21 03:35:27,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {1534#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1534#true} is VALID [2022-02-21 03:35:27,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {1534#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1534#true} is VALID [2022-02-21 03:35:27,074 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:27,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953604847] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:27,074 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:27,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2022-02-21 03:35:27,075 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134411833] [2022-02-21 03:35:27,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:27,123 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:27,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-21 03:35:27,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-02-21 03:35:27,124 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 states have internal predecessors, (42), 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) [2022-02-21 03:35:27,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:27,559 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-02-21 03:35:27,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:35:27,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 states have internal predecessors, (42), 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) [2022-02-21 03:35:27,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:27,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2022-02-21 03:35:27,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:27,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2022-02-21 03:35:27,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-02-21 03:35:27,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-02-21 03:35:27,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2022-02-21 03:35:27,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:27,596 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-02-21 03:35:27,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2022-02-21 03:35:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2022-02-21 03:35:27,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:27,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 37 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 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) [2022-02-21 03:35:27,597 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 37 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 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) [2022-02-21 03:35:27,597 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 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) [2022-02-21 03:35:27,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:27,598 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-02-21 03:35:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-02-21 03:35:27,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:27,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:27,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 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) Second operand 30 states and 37 transitions. [2022-02-21 03:35:27,599 INFO L87 Difference]: Start difference. First operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 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) Second operand 30 states and 37 transitions. [2022-02-21 03:35:27,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:27,603 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-02-21 03:35:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-02-21 03:35:27,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:27,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:27,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:27,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:27,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 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) [2022-02-21 03:35:27,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-02-21 03:35:27,605 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-21 03:35:27,605 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-21 03:35:27,606 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 03:35:27,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2022-02-21 03:35:27,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:27,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:27,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:27,607 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:27,607 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:27,607 INFO L791 eck$LassoCheckResult]: Stem: 1709#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1710#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1718#L367 assume !(main_~length~0#1 < 1); 1711#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1712#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1713#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1719#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1725#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1726#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1727#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1728#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1720#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1721#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1722#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1724#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1714#L370-4 main_~j~0#1 := 0; 1715#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1716#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1717#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1723#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1730#L378-2 [2022-02-21 03:35:27,607 INFO L793 eck$LassoCheckResult]: Loop: 1730#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1729#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1730#L378-2 [2022-02-21 03:35:27,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:27,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1570400154, now seen corresponding path program 4 times [2022-02-21 03:35:27,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:27,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090989585] [2022-02-21 03:35:27,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:27,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:27,627 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:27,639 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:27,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:27,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 9 times [2022-02-21 03:35:27,640 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:27,640 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078085632] [2022-02-21 03:35:27,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:27,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:27,645 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:27,647 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:27,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:27,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1621025751, now seen corresponding path program 4 times [2022-02-21 03:35:27,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:27,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981433196] [2022-02-21 03:35:27,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:27,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:27,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {1798#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1798#true} is VALID [2022-02-21 03:35:27,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {1798#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1798#true} is VALID [2022-02-21 03:35:27,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {1798#true} assume !(main_~length~0#1 < 1); {1798#true} is VALID [2022-02-21 03:35:27,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {1798#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1798#true} is VALID [2022-02-21 03:35:27,773 INFO L290 TraceCheckUtils]: 4: Hoare triple {1798#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:27,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:27,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:27,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:27,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:27,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:27,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1802#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:27,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {1802#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1803#(and (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:27,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {1803#(and (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1804#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))} is VALID [2022-02-21 03:35:27,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {1804#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1805#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} is VALID [2022-02-21 03:35:27,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {1805#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} assume !(main_~i~0#1 < main_~length~0#1); {1805#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} is VALID [2022-02-21 03:35:27,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {1805#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} main_~j~0#1 := 0; {1806#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:27,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {1806#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1806#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:27,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {1806#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1807#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:27,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {1807#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1807#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:27,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {1807#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1808#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:27,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {1808#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1809#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} is VALID [2022-02-21 03:35:27,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {1809#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1799#false} is VALID [2022-02-21 03:35:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:27,782 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:27,783 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981433196] [2022-02-21 03:35:27,783 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981433196] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:27,783 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153644260] [2022-02-21 03:35:27,783 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-21 03:35:27,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:27,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,800 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:27,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-02-21 03:35:27,855 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-21 03:35:27,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:35:27,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-21 03:35:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:27,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:27,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-21 03:35:28,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-21 03:35:28,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {1798#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1798#true} is VALID [2022-02-21 03:35:28,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {1798#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1798#true} is VALID [2022-02-21 03:35:28,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {1798#true} assume !(main_~length~0#1 < 1); {1798#true} is VALID [2022-02-21 03:35:28,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {1798#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1822#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} is VALID [2022-02-21 03:35:28,171 INFO L290 TraceCheckUtils]: 4: Hoare triple {1822#(= |ULTIMATE.start_main_~arr~0#1.offset| 0)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1826#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:28,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {1826#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1826#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:28,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {1826#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1826#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:28,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {1826#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1836#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:28,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {1836#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1836#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:28,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {1836#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1836#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:28,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {1836#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1846#(and (= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:28,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {1846#(and (= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1850#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) |ULTIMATE.start_main_#t~mem209#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:28,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {1850#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) |ULTIMATE.start_main_#t~mem209#1|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1854#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:28,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {1854#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1854#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:28,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {1854#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length~0#1); {1854#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:28,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {1854#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_~j~0#1 := 0; {1864#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:28,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {1864#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1864#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:28,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {1864#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1871#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:35:28,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {1871#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 1))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1871#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:35:28,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {1871#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 1))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1878#(and (= 2 |ULTIMATE.start_main_~j~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:28,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {1878#(and (= 2 |ULTIMATE.start_main_~j~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1809#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} is VALID [2022-02-21 03:35:28,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {1809#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1799#false} is VALID [2022-02-21 03:35:28,179 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:28,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:28,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-02-21 03:35:28,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-02-21 03:35:28,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {1809#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {1799#false} is VALID [2022-02-21 03:35:28,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {1808#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1809#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} is VALID [2022-02-21 03:35:28,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {1807#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1808#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:28,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {1807#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1807#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:28,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {1897#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {1807#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:28,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {1897#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {1897#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:28,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {1805#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} main_~j~0#1 := 0; {1897#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:28,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {1805#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} assume !(main_~i~0#1 < main_~length~0#1); {1805#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} is VALID [2022-02-21 03:35:28,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {1805#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1805#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} is VALID [2022-02-21 03:35:28,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {1913#(or (< 0 |ULTIMATE.start_main_#t~mem209#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1805#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} is VALID [2022-02-21 03:35:28,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {1802#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1913#(or (< 0 |ULTIMATE.start_main_#t~mem209#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0))} is VALID [2022-02-21 03:35:28,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1802#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:28,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:28,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:28,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {1801#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:28,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:28,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:28,449 INFO L290 TraceCheckUtils]: 4: Hoare triple {1798#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {1800#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:28,449 INFO L290 TraceCheckUtils]: 3: Hoare triple {1798#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {1798#true} is VALID [2022-02-21 03:35:28,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {1798#true} assume !(main_~length~0#1 < 1); {1798#true} is VALID [2022-02-21 03:35:28,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {1798#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {1798#true} is VALID [2022-02-21 03:35:28,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {1798#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1798#true} is VALID [2022-02-21 03:35:28,449 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:28,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153644260] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:28,449 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:28,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 22 [2022-02-21 03:35:28,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908529124] [2022-02-21 03:35:28,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:28,485 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:28,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-21 03:35:28,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2022-02-21 03:35:28,486 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 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) [2022-02-21 03:35:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:29,002 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-21 03:35:29,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-21 03:35:29,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 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) [2022-02-21 03:35:29,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:29,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2022-02-21 03:35:29,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:29,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 45 transitions. [2022-02-21 03:35:29,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-02-21 03:35:29,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2022-02-21 03:35:29,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2022-02-21 03:35:29,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:29,047 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-02-21 03:35:29,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2022-02-21 03:35:29,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-02-21 03:35:29,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:29,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 45 transitions. Second operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 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) [2022-02-21 03:35:29,052 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 45 transitions. Second operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 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) [2022-02-21 03:35:29,054 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 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) [2022-02-21 03:35:29,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:29,055 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-21 03:35:29,055 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-02-21 03:35:29,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:29,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:29,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 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 36 states and 45 transitions. [2022-02-21 03:35:29,056 INFO L87 Difference]: Start difference. First operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 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 36 states and 45 transitions. [2022-02-21 03:35:29,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:29,057 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-21 03:35:29,057 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-02-21 03:35:29,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:29,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:29,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:29,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 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) [2022-02-21 03:35:29,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-02-21 03:35:29,061 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-02-21 03:35:29,062 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-02-21 03:35:29,062 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2022-02-21 03:35:29,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2022-02-21 03:35:29,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:29,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:29,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:29,063 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:29,063 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:29,063 INFO L791 eck$LassoCheckResult]: Stem: 1991#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1992#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1999#L367 assume !(main_~length~0#1 < 1); 1993#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1994#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1995#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2000#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2008#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2009#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2010#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2011#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2001#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2002#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2004#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2005#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2006#L370-4 main_~j~0#1 := 0; 2016#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1996#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1997#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2003#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2015#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2014#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2013#L378-2 [2022-02-21 03:35:29,063 INFO L793 eck$LassoCheckResult]: Loop: 2013#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2012#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2013#L378-2 [2022-02-21 03:35:29,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:29,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1621025749, now seen corresponding path program 5 times [2022-02-21 03:35:29,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:29,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878100935] [2022-02-21 03:35:29,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:29,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:29,085 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:29,096 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:29,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:29,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 10 times [2022-02-21 03:35:29,097 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:29,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115649509] [2022-02-21 03:35:29,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:29,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:29,101 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:29,104 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:29,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:29,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1267385006, now seen corresponding path program 5 times [2022-02-21 03:35:29,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:29,105 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214934231] [2022-02-21 03:35:29,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:29,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:29,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {2099#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2099#true} is VALID [2022-02-21 03:35:29,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {2099#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {2099#true} is VALID [2022-02-21 03:35:29,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {2099#true} assume !(main_~length~0#1 < 1); {2099#true} is VALID [2022-02-21 03:35:29,260 INFO L290 TraceCheckUtils]: 3: Hoare triple {2099#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {2101#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} is VALID [2022-02-21 03:35:29,261 INFO L290 TraceCheckUtils]: 4: Hoare triple {2101#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {2102#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} is VALID [2022-02-21 03:35:29,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {2102#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2102#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} is VALID [2022-02-21 03:35:29,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {2102#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2102#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} is VALID [2022-02-21 03:35:29,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {2102#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~length~0#1| 4)))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2103#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ (* |ULTIMATE.start_main_~length~0#1| 4) 4)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:29,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {2103#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ (* |ULTIMATE.start_main_~length~0#1| 4) 4)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2103#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ (* |ULTIMATE.start_main_~length~0#1| 4) 4)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:29,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {2103#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ (* |ULTIMATE.start_main_~length~0#1| 4) 4)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2103#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ (* |ULTIMATE.start_main_~length~0#1| 4) 4)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:29,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {2103#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ (* |ULTIMATE.start_main_~length~0#1| 4) 4)) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2104#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ 8 (* |ULTIMATE.start_main_~length~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:29,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {2104#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ 8 (* |ULTIMATE.start_main_~length~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2104#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ 8 (* |ULTIMATE.start_main_~length~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:29,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {2104#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ 8 (* |ULTIMATE.start_main_~length~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2104#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ 8 (* |ULTIMATE.start_main_~length~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:29,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ 8 (* |ULTIMATE.start_main_~length~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2105#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ 12 (* |ULTIMATE.start_main_~length~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:29,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {2105#(and (<= (+ (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~i~0#1| 4)) (+ 12 (* |ULTIMATE.start_main_~length~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~i~0#1 < main_~length~0#1); {2106#(and (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 12) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:29,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {2106#(and (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 12) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_~j~0#1 := 0; {2107#(and (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 12) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:29,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {2107#(and (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 12) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2107#(and (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 12) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:29,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {2107#(and (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) 12) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2108#(and (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (+ 8 (* |ULTIMATE.start_main_~j~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:29,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {2108#(and (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (+ 8 (* |ULTIMATE.start_main_~j~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2108#(and (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (+ 8 (* |ULTIMATE.start_main_~j~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:35:29,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {2108#(and (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (+ 8 (* |ULTIMATE.start_main_~j~0#1| 4))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2109#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (+ 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:29,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {2109#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (+ 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2109#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (+ 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} is VALID [2022-02-21 03:35:29,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {2109#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (+ 4 (* |ULTIMATE.start_main_~j~0#1| 4))))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2110#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~j~0#1| 4)))} is VALID [2022-02-21 03:35:29,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {2110#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* |ULTIMATE.start_main_~j~0#1| 4)))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2100#false} is VALID [2022-02-21 03:35:29,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {2100#false} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {2100#false} is VALID [2022-02-21 03:35:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:29,272 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:29,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214934231] [2022-02-21 03:35:29,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214934231] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:29,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010169577] [2022-02-21 03:35:29,273 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-21 03:35:29,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:29,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:29,276 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:29,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-02-21 03:35:29,332 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-02-21 03:35:29,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:35:29,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:29,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:29,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {2099#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2099#true} is VALID [2022-02-21 03:35:29,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {2099#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {2099#true} is VALID [2022-02-21 03:35:29,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {2099#true} assume !(main_~length~0#1 < 1); {2099#true} is VALID [2022-02-21 03:35:29,618 INFO L290 TraceCheckUtils]: 3: Hoare triple {2099#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {2099#true} is VALID [2022-02-21 03:35:29,618 INFO L290 TraceCheckUtils]: 4: Hoare triple {2099#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:29,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:29,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:29,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:29,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:29,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:29,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:29,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:29,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:29,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2156#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:35:29,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {2156#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 < main_~length~0#1); {2160#(<= |ULTIMATE.start_main_~length~0#1| 3)} is VALID [2022-02-21 03:35:29,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {2160#(<= |ULTIMATE.start_main_~length~0#1| 3)} main_~j~0#1 := 0; {2160#(<= |ULTIMATE.start_main_~length~0#1| 3)} is VALID [2022-02-21 03:35:29,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {2160#(<= |ULTIMATE.start_main_~length~0#1| 3)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2167#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:29,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {2167#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2171#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:29,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {2171#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2171#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:29,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {2171#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2178#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 2 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:29,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {2178#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 2 |ULTIMATE.start_main_~j~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2178#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 2 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:29,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {2178#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 2 |ULTIMATE.start_main_~j~0#1|))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2185#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 3 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:29,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {2185#(and (<= |ULTIMATE.start_main_~length~0#1| 3) (<= 3 |ULTIMATE.start_main_~j~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2100#false} is VALID [2022-02-21 03:35:29,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {2100#false} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {2100#false} is VALID [2022-02-21 03:35:29,625 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:29,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:29,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {2100#false} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {2100#false} is VALID [2022-02-21 03:35:29,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {2195#(not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~length~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2100#false} is VALID [2022-02-21 03:35:29,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {2199#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2195#(not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 03:35:29,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {2199#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2199#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:35:29,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {2206#(<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2199#(<= |ULTIMATE.start_main_~length~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:35:29,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {2206#(<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2206#(<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:29,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {2213#(<= |ULTIMATE.start_main_~length~0#1| (+ 3 |ULTIMATE.start_main_~j~0#1|))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2206#(<= |ULTIMATE.start_main_~length~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:29,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {2160#(<= |ULTIMATE.start_main_~length~0#1| 3)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2213#(<= |ULTIMATE.start_main_~length~0#1| (+ 3 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:29,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {2160#(<= |ULTIMATE.start_main_~length~0#1| 3)} main_~j~0#1 := 0; {2160#(<= |ULTIMATE.start_main_~length~0#1| 3)} is VALID [2022-02-21 03:35:29,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {2156#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 < main_~length~0#1); {2160#(<= |ULTIMATE.start_main_~length~0#1| 3)} is VALID [2022-02-21 03:35:29,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2156#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:35:29,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:29,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:29,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2146#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:29,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:29,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:29,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2136#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:29,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:29,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:29,817 INFO L290 TraceCheckUtils]: 4: Hoare triple {2099#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {2126#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:29,818 INFO L290 TraceCheckUtils]: 3: Hoare triple {2099#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {2099#true} is VALID [2022-02-21 03:35:29,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {2099#true} assume !(main_~length~0#1 < 1); {2099#true} is VALID [2022-02-21 03:35:29,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {2099#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {2099#true} is VALID [2022-02-21 03:35:29,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {2099#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2099#true} is VALID [2022-02-21 03:35:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:29,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010169577] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:29,818 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:29,818 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2022-02-21 03:35:29,818 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101846053] [2022-02-21 03:35:29,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:29,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:29,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-21 03:35:29,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2022-02-21 03:35:29,857 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. cyclomatic complexity: 11 Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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) [2022-02-21 03:35:30,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:30,356 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-02-21 03:35:30,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:35:30,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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) [2022-02-21 03:35:30,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:30,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2022-02-21 03:35:30,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:30,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 34 states and 43 transitions. [2022-02-21 03:35:30,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 03:35:30,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 03:35:30,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2022-02-21 03:35:30,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:30,410 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-02-21 03:35:30,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2022-02-21 03:35:30,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-02-21 03:35:30,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:30,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 43 transitions. Second operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 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) [2022-02-21 03:35:30,412 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 43 transitions. Second operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 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) [2022-02-21 03:35:30,412 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 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) [2022-02-21 03:35:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:30,413 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-02-21 03:35:30,413 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-02-21 03:35:30,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:30,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:30,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 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 34 states and 43 transitions. [2022-02-21 03:35:30,413 INFO L87 Difference]: Start difference. First operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 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 34 states and 43 transitions. [2022-02-21 03:35:30,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:30,414 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-02-21 03:35:30,414 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-02-21 03:35:30,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:30,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:30,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:30,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:30,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 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) [2022-02-21 03:35:30,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-02-21 03:35:30,415 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-02-21 03:35:30,415 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-02-21 03:35:30,415 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2022-02-21 03:35:30,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2022-02-21 03:35:30,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:30,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:30,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:30,416 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:30,416 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:30,417 INFO L791 eck$LassoCheckResult]: Stem: 2320#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2321#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2328#L367 assume !(main_~length~0#1 < 1); 2322#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2323#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2324#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2329#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2350#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2330#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2331#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2333#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2334#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2349#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2348#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2347#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2337#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2338#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2339#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2327#L370-4 main_~j~0#1 := 0; 2326#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2332#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2344#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2343#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2342#L378-2 [2022-02-21 03:35:30,417 INFO L793 eck$LassoCheckResult]: Loop: 2342#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2341#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2342#L378-2 [2022-02-21 03:35:30,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:30,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1476197922, now seen corresponding path program 2 times [2022-02-21 03:35:30,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:30,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104972901] [2022-02-21 03:35:30,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:30,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:30,440 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:30,453 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:30,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:30,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 11 times [2022-02-21 03:35:30,454 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:30,454 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159674900] [2022-02-21 03:35:30,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:30,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:30,458 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:30,461 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:30,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:30,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1286996709, now seen corresponding path program 2 times [2022-02-21 03:35:30,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:30,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981825292] [2022-02-21 03:35:30,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:30,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:30,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {2426#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2426#true} is VALID [2022-02-21 03:35:30,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {2426#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {2426#true} is VALID [2022-02-21 03:35:30,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {2426#true} assume !(main_~length~0#1 < 1); {2426#true} is VALID [2022-02-21 03:35:30,625 INFO L290 TraceCheckUtils]: 3: Hoare triple {2426#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {2426#true} is VALID [2022-02-21 03:35:30,626 INFO L290 TraceCheckUtils]: 4: Hoare triple {2426#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:30,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:30,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:30,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:30,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:30,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:30,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2430#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:30,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {2430#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2431#(and (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:30,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {2431#(and (= |ULTIMATE.start_main_#t~mem209#1| (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2432#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))} is VALID [2022-02-21 03:35:30,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {2432#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2433#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 8) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-21 03:35:30,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {2433#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 8) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2433#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 8) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-21 03:35:30,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {2433#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 8) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2434#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} is VALID [2022-02-21 03:35:30,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {2434#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2434#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} is VALID [2022-02-21 03:35:30,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {2434#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} assume !(main_~i~0#1 < main_~length~0#1); {2434#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} is VALID [2022-02-21 03:35:30,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {2434#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} main_~j~0#1 := 0; {2435#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:30,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {2435#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2435#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:30,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {2435#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2436#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:30,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {2436#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2436#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:30,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {2436#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2437#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:30,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {2437#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2438#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} is VALID [2022-02-21 03:35:30,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {2438#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {2427#false} is VALID [2022-02-21 03:35:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:30,637 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:30,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981825292] [2022-02-21 03:35:30,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981825292] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:30,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034769736] [2022-02-21 03:35:30,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:35:30,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:30,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:30,643 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:30,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-02-21 03:35:30,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:35:30,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:35:30,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-21 03:35:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:30,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:30,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2022-02-21 03:35:31,044 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-21 03:35:31,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-21 03:35:31,228 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-21 03:35:31,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-21 03:35:31,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-21 03:35:31,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {2426#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2426#true} is VALID [2022-02-21 03:35:31,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {2426#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {2426#true} is VALID [2022-02-21 03:35:31,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {2426#true} assume !(main_~length~0#1 < 1); {2426#true} is VALID [2022-02-21 03:35:31,380 INFO L290 TraceCheckUtils]: 3: Hoare triple {2426#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {2426#true} is VALID [2022-02-21 03:35:31,380 INFO L290 TraceCheckUtils]: 4: Hoare triple {2426#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:31,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:31,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:31,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:31,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:31,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:31,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2430#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:31,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {2430#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2475#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem209#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:31,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {2475#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem209#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2432#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))} is VALID [2022-02-21 03:35:31,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {2432#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2482#(exists ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_68| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_68| 2) (<= (+ |v_ULTIMATE.start_main_~i~0#1_68| 1) |ULTIMATE.start_main_~i~0#1|) (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)))} is VALID [2022-02-21 03:35:31,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {2482#(exists ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_68| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_68| 2) (<= (+ |v_ULTIMATE.start_main_~i~0#1_68| 1) |ULTIMATE.start_main_~i~0#1|) (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2482#(exists ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_68| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_68| 2) (<= (+ |v_ULTIMATE.start_main_~i~0#1_68| 1) |ULTIMATE.start_main_~i~0#1|) (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)))} is VALID [2022-02-21 03:35:31,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {2482#(exists ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_68| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_68| 2) (<= (+ |v_ULTIMATE.start_main_~i~0#1_68| 1) |ULTIMATE.start_main_~i~0#1|) (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)))} assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2434#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} is VALID [2022-02-21 03:35:31,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {2434#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2434#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} is VALID [2022-02-21 03:35:31,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {2434#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} assume !(main_~i~0#1 < main_~length~0#1); {2434#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} is VALID [2022-02-21 03:35:31,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {2434#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} main_~j~0#1 := 0; {2435#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:31,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {2435#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2435#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:31,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {2435#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2504#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:35:31,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {2504#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~j~0#1| 1))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2504#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:35:31,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {2504#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~j~0#1| 1))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2511#(and (= 2 |ULTIMATE.start_main_~j~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0))} is VALID [2022-02-21 03:35:31,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {2511#(and (= 2 |ULTIMATE.start_main_~j~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2438#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} is VALID [2022-02-21 03:35:31,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {2438#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {2427#false} is VALID [2022-02-21 03:35:31,393 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:31,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:31,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-02-21 03:35:31,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-02-21 03:35:31,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {2438#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {2427#false} is VALID [2022-02-21 03:35:31,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {2437#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2438#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} is VALID [2022-02-21 03:35:31,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {2436#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2437#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:31,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {2436#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2436#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:31,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {2530#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2436#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:31,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {2530#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2530#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:31,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {2434#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} main_~j~0#1 := 0; {2530#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:31,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {2434#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} assume !(main_~i~0#1 < main_~length~0#1); {2434#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} is VALID [2022-02-21 03:35:31,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {2434#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2434#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} is VALID [2022-02-21 03:35:31,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {2433#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 8) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2434#(<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0)} is VALID [2022-02-21 03:35:31,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {2433#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 8) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2433#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 8) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-21 03:35:31,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {2552#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (not (<= |ULTIMATE.start_main_~i~0#1| 1)))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2433#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| 8) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-21 03:35:31,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {2556#(or (< 0 |ULTIMATE.start_main_#t~mem209#1|) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (not (<= |ULTIMATE.start_main_~i~0#1| 1))))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2552#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (not (<= |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-21 03:35:31,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {2430#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2556#(or (< 0 |ULTIMATE.start_main_#t~mem209#1|) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8)) 0) (not (<= |ULTIMATE.start_main_~i~0#1| 1))))} is VALID [2022-02-21 03:35:31,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2430#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:31,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:31,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:31,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2429#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:31,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:31,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:31,801 INFO L290 TraceCheckUtils]: 4: Hoare triple {2426#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {2428#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:31,801 INFO L290 TraceCheckUtils]: 3: Hoare triple {2426#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {2426#true} is VALID [2022-02-21 03:35:31,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {2426#true} assume !(main_~length~0#1 < 1); {2426#true} is VALID [2022-02-21 03:35:31,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {2426#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {2426#true} is VALID [2022-02-21 03:35:31,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {2426#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2426#true} is VALID [2022-02-21 03:35:31,802 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:31,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034769736] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:31,802 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:31,802 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2022-02-21 03:35:31,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23457764] [2022-02-21 03:35:31,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:31,840 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:31,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-21 03:35:31,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2022-02-21 03:35:31,841 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 11 Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 20 states have internal predecessors, (40), 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) [2022-02-21 03:35:32,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:32,288 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-02-21 03:35:32,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-21 03:35:32,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 20 states have internal predecessors, (40), 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) [2022-02-21 03:35:32,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:32,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2022-02-21 03:35:32,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:32,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2022-02-21 03:35:32,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-02-21 03:35:32,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-02-21 03:35:32,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2022-02-21 03:35:32,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:32,328 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-02-21 03:35:32,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2022-02-21 03:35:32,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 33. [2022-02-21 03:35:32,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:32,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states and 56 transitions. Second operand has 33 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 states have internal predecessors, (42), 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) [2022-02-21 03:35:32,331 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states and 56 transitions. Second operand has 33 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 states have internal predecessors, (42), 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) [2022-02-21 03:35:32,331 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 33 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 states have internal predecessors, (42), 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) [2022-02-21 03:35:32,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:32,332 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-02-21 03:35:32,332 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-02-21 03:35:32,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:32,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:32,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 states have internal predecessors, (42), 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 46 states and 56 transitions. [2022-02-21 03:35:32,333 INFO L87 Difference]: Start difference. First operand has 33 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 states have internal predecessors, (42), 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 46 states and 56 transitions. [2022-02-21 03:35:32,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:32,334 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-02-21 03:35:32,334 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-02-21 03:35:32,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:32,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:32,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:32,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:32,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 states have internal predecessors, (42), 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) [2022-02-21 03:35:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-02-21 03:35:32,335 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-02-21 03:35:32,336 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-02-21 03:35:32,336 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2022-02-21 03:35:32,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 42 transitions. [2022-02-21 03:35:32,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:32,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:32,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:32,337 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:32,337 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:32,337 INFO L791 eck$LassoCheckResult]: Stem: 2643#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2644#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2651#L367 assume !(main_~length~0#1 < 1); 2645#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2646#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2647#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2652#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2667#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2653#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2654#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2659#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2660#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2666#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2665#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2664#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2656#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2657#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2661#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2662#L370-4 main_~j~0#1 := 0; 2672#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2650#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2649#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2655#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2671#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2670#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2669#L378-2 [2022-02-21 03:35:32,337 INFO L793 eck$LassoCheckResult]: Loop: 2669#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2668#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2669#L378-2 [2022-02-21 03:35:32,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:32,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1286996711, now seen corresponding path program 3 times [2022-02-21 03:35:32,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:32,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273898997] [2022-02-21 03:35:32,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:32,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:32,364 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:32,375 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:32,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:32,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 12 times [2022-02-21 03:35:32,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:32,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531700767] [2022-02-21 03:35:32,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:32,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:32,385 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:32,387 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:32,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:32,387 INFO L85 PathProgramCache]: Analyzing trace with hash -146740630, now seen corresponding path program 3 times [2022-02-21 03:35:32,387 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:32,387 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671156795] [2022-02-21 03:35:32,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:32,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:32,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {2775#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2775#true} is VALID [2022-02-21 03:35:32,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {2775#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {2775#true} is VALID [2022-02-21 03:35:32,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {2775#true} assume !(main_~length~0#1 < 1); {2775#true} is VALID [2022-02-21 03:35:32,546 INFO L290 TraceCheckUtils]: 3: Hoare triple {2775#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {2775#true} is VALID [2022-02-21 03:35:32,547 INFO L290 TraceCheckUtils]: 4: Hoare triple {2775#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {2777#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:32,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {2777#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2777#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:32,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {2777#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2777#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:32,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {2777#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2778#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:32,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {2778#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2778#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:32,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {2778#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2778#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:35:32,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {2778#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2779#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:32,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {2779#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2779#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:32,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {2779#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2779#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:32,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {2779#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2780#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:32,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {2780#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2780#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:32,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {2780#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 3 |ULTIMATE.start_main_~i~0#1|))} assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2781#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-21 03:35:32,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {2781#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2782#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 12)) 0)} is VALID [2022-02-21 03:35:32,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {2782#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 12)) 0)} assume !(main_~i~0#1 < main_~length~0#1); {2782#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 12)) 0)} is VALID [2022-02-21 03:35:32,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {2782#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 12)) 0)} main_~j~0#1 := 0; {2783#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 12)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:32,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {2783#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 12)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2783#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 12)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:35:32,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {2783#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 12)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2784#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:32,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {2784#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2784#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:32,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {2784#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 8 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2785#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:32,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {2785#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2785#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:32,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {2785#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2786#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} is VALID [2022-02-21 03:35:32,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {2786#(= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0)} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2787#(= |ULTIMATE.start_main_#t~mem210#1| 0)} is VALID [2022-02-21 03:35:32,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {2787#(= |ULTIMATE.start_main_#t~mem210#1| 0)} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {2776#false} is VALID [2022-02-21 03:35:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:32,561 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:32,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671156795] [2022-02-21 03:35:32,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671156795] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:32,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202741119] [2022-02-21 03:35:32,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:35:32,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:32,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:32,567 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:32,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-02-21 03:35:32,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-02-21 03:35:32,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:35:32,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:35:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:32,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:32,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2022-02-21 03:35:33,806 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-02-21 03:35:33,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-02-21 03:35:33,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {2775#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2775#true} is VALID [2022-02-21 03:35:33,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {2775#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {2775#true} is VALID [2022-02-21 03:35:33,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {2775#true} assume !(main_~length~0#1 < 1); {2775#true} is VALID [2022-02-21 03:35:33,859 INFO L290 TraceCheckUtils]: 3: Hoare triple {2775#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {2775#true} is VALID [2022-02-21 03:35:33,859 INFO L290 TraceCheckUtils]: 4: Hoare triple {2775#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:33,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:33,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:33,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:33,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:33,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:33,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:33,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:33,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:33,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2833#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:35:33,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {2833#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2833#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:35:33,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {2833#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2840#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))} is VALID [2022-02-21 03:35:33,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {2840#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2844#(exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1))))} is VALID [2022-02-21 03:35:33,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {2844#(exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1))))} assume !(main_~i~0#1 < main_~length~0#1); {2848#(exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3)))} is VALID [2022-02-21 03:35:33,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {2848#(exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3)))} main_~j~0#1 := 0; {2852#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:33,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {2852#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2852#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:33,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {2852#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2859#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:33,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {2859#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2859#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:33,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {2859#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2866#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))) (<= 2 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:33,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {2866#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))) (<= 2 |ULTIMATE.start_main_~j~0#1|))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2866#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))) (<= 2 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:35:33,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {2866#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))) (<= 2 |ULTIMATE.start_main_~j~0#1|))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2873#(and (<= 3 |ULTIMATE.start_main_~j~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))))} is VALID [2022-02-21 03:35:33,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {2873#(and (<= 3 |ULTIMATE.start_main_~j~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_77| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_77| 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_77| 4) |ULTIMATE.start_main_~arr~0#1.offset|)) 0) (<= |v_ULTIMATE.start_main_~i~0#1_77| 3))))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2877#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} is VALID [2022-02-21 03:35:33,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {2877#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {2776#false} is VALID [2022-02-21 03:35:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:33,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:34,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-02-21 03:35:34,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-02-21 03:35:35,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {2877#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; {2776#false} is VALID [2022-02-21 03:35:35,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {2884#(or (not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~length~0#1|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2877#(<= |ULTIMATE.start_main_#t~mem210#1| 0)} is VALID [2022-02-21 03:35:35,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {2888#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |v_ULTIMATE.start_main_~j~0#1_80|)) (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))) 0)))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2884#(or (not (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~length~0#1|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 0))} is VALID [2022-02-21 03:35:35,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {2888#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |v_ULTIMATE.start_main_~j~0#1_80|)) (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))) 0)))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2888#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |v_ULTIMATE.start_main_~j~0#1_80|)) (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))) 0)))} is VALID [2022-02-21 03:35:35,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {2895#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (< |v_ULTIMATE.start_main_~j~0#1_80| (+ 2 |ULTIMATE.start_main_~j~0#1|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))) 0)))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2888#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |v_ULTIMATE.start_main_~j~0#1_80|)) (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))) 0)))} is VALID [2022-02-21 03:35:35,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {2895#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (< |v_ULTIMATE.start_main_~j~0#1_80| (+ 2 |ULTIMATE.start_main_~j~0#1|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))) 0)))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2895#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (< |v_ULTIMATE.start_main_~j~0#1_80| (+ 2 |ULTIMATE.start_main_~j~0#1|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))) 0)))} is VALID [2022-02-21 03:35:35,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {2902#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (< |v_ULTIMATE.start_main_~j~0#1_80| (+ 3 |ULTIMATE.start_main_~j~0#1|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))) 0)))} assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; {2895#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (< |v_ULTIMATE.start_main_~j~0#1_80| (+ 2 |ULTIMATE.start_main_~j~0#1|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))) 0)))} is VALID [2022-02-21 03:35:35,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {2902#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (< |v_ULTIMATE.start_main_~j~0#1_80| (+ 3 |ULTIMATE.start_main_~j~0#1|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))) 0)))} assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); {2902#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (< |v_ULTIMATE.start_main_~j~0#1_80| (+ 3 |ULTIMATE.start_main_~j~0#1|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))) 0)))} is VALID [2022-02-21 03:35:35,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {2909#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (< |v_ULTIMATE.start_main_~j~0#1_80| 3) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))) 0)))} main_~j~0#1 := 0; {2902#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (< |v_ULTIMATE.start_main_~j~0#1_80| (+ 3 |ULTIMATE.start_main_~j~0#1|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))) 0)))} is VALID [2022-02-21 03:35:35,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {2913#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_80| 3) (<= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~j~0#1_80|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))) 0)))} assume !(main_~i~0#1 < main_~length~0#1); {2909#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (not (< |v_ULTIMATE.start_main_~j~0#1_80| |ULTIMATE.start_main_~length~0#1|)) (< |v_ULTIMATE.start_main_~j~0#1_80| 3) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))) 0)))} is VALID [2022-02-21 03:35:35,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {2917#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~j~0#1_80|) (< |v_ULTIMATE.start_main_~j~0#1_80| 3) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))) 0)))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2913#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_80| 3) (<= |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~j~0#1_80|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))) 0)))} is VALID [2022-02-21 03:35:35,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {2833#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2917#(forall ((|v_ULTIMATE.start_main_~j~0#1_80| Int)) (or (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~j~0#1_80|) (< |v_ULTIMATE.start_main_~j~0#1_80| 3) (<= (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_80| 4))) 0)))} is VALID [2022-02-21 03:35:35,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {2833#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2833#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:35:35,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2833#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:35:35,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:35,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:35,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2823#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:35:35,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:35,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:35,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {2813#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:35:35,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:35,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:35,098 INFO L290 TraceCheckUtils]: 4: Hoare triple {2775#true} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {2803#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:35:35,098 INFO L290 TraceCheckUtils]: 3: Hoare triple {2775#true} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {2775#true} is VALID [2022-02-21 03:35:35,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {2775#true} assume !(main_~length~0#1 < 1); {2775#true} is VALID [2022-02-21 03:35:35,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {2775#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {2775#true} is VALID [2022-02-21 03:35:35,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {2775#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2775#true} is VALID [2022-02-21 03:35:35,099 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:35,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202741119] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:35,099 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:35,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 31 [2022-02-21 03:35:35,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558285964] [2022-02-21 03:35:35,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:35,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:35,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-02-21 03:35:35,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2022-02-21 03:35:35,145 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. cyclomatic complexity: 12 Second operand has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 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) [2022-02-21 03:35:35,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:35,760 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-02-21 03:35:35,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-21 03:35:35,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 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) [2022-02-21 03:35:35,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:35,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 65 transitions. [2022-02-21 03:35:35,821 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:35,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 65 transitions. [2022-02-21 03:35:35,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-02-21 03:35:35,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-02-21 03:35:35,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 65 transitions. [2022-02-21 03:35:35,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:35,823 INFO L681 BuchiCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-02-21 03:35:35,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 65 transitions. [2022-02-21 03:35:35,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2022-02-21 03:35:35,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:35,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states and 65 transitions. Second operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 states have internal predecessors, (50), 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) [2022-02-21 03:35:35,825 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states and 65 transitions. Second operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 states have internal predecessors, (50), 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) [2022-02-21 03:35:35,825 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 states have internal predecessors, (50), 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) [2022-02-21 03:35:35,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:35,826 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-02-21 03:35:35,826 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-02-21 03:35:35,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:35,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:35,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 states have internal predecessors, (50), 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 54 states and 65 transitions. [2022-02-21 03:35:35,827 INFO L87 Difference]: Start difference. First operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 states have internal predecessors, (50), 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 54 states and 65 transitions. [2022-02-21 03:35:35,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:35,828 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-02-21 03:35:35,828 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-02-21 03:35:35,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:35,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:35,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:35,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 states have internal predecessors, (50), 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) [2022-02-21 03:35:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2022-02-21 03:35:35,829 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2022-02-21 03:35:35,829 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2022-02-21 03:35:35,829 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2022-02-21 03:35:35,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2022-02-21 03:35:35,829 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:35,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:35,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:35,830 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:35,830 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:35,830 INFO L791 eck$LassoCheckResult]: Stem: 3048#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3049#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3056#L367 assume !(main_~length~0#1 < 1); 3050#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3051#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3052#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3057#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3060#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3068#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3069#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3072#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3071#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3070#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3061#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3058#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3059#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3086#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3085#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 3053#L370-4 main_~j~0#1 := 0; 3054#L378-2 [2022-02-21 03:35:35,830 INFO L793 eck$LassoCheckResult]: Loop: 3054#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3055#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3054#L378-2 [2022-02-21 03:35:35,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:35,831 INFO L85 PathProgramCache]: Analyzing trace with hash -49062696, now seen corresponding path program 2 times [2022-02-21 03:35:35,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:35,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423001102] [2022-02-21 03:35:35,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:35,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:35,846 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:35,853 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:35,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:35,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2310, now seen corresponding path program 1 times [2022-02-21 03:35:35,854 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:35,855 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059152734] [2022-02-21 03:35:35,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:35,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:35,859 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:35,861 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:35,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:35,862 INFO L85 PathProgramCache]: Analyzing trace with hash 95390749, now seen corresponding path program 4 times [2022-02-21 03:35:35,862 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:35,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815884036] [2022-02-21 03:35:35,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:35,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:35,878 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:35,887 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:36,655 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:36,655 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:36,655 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:36,655 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:36,655 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:36,655 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:36,655 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:36,655 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:36,655 INFO L133 ssoRankerPreferences]: Filename of dumped script: array13_alloca.i_Iteration14_Lasso [2022-02-21 03:35:36,655 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:36,655 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:36,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,724 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* ULTIMATE.start_main_~j~0#1 4) ULTIMATE.start_main_~arr~0#1.offset))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 03:35:36,733 INFO L158 Benchmark]: Toolchain (without parser) took 68846.63ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 63.4MB in the beginning and 58.9MB in the end (delta: 4.5MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. [2022-02-21 03:35:36,734 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 50.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:36,734 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.99ms. Allocated memory is still 96.5MB. Free memory was 63.1MB in the beginning and 63.0MB in the end (delta: 89.7kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:35:36,734 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.39ms. Allocated memory is still 96.5MB. Free memory was 63.0MB in the beginning and 61.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:36,735 INFO L158 Benchmark]: Boogie Preprocessor took 42.83ms. Allocated memory is still 96.5MB. Free memory was 61.0MB in the beginning and 59.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:36,739 INFO L158 Benchmark]: RCFGBuilder took 368.00ms. Allocated memory is still 96.5MB. Free memory was 59.7MB in the beginning and 48.4MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:35:36,739 INFO L158 Benchmark]: BuchiAutomizer took 67868.60ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 48.0MB in the beginning and 58.9MB in the end (delta: -10.9MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. [2022-02-21 03:35:36,741 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 50.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.99ms. Allocated memory is still 96.5MB. Free memory was 63.1MB in the beginning and 63.0MB in the end (delta: 89.7kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.39ms. Allocated memory is still 96.5MB. Free memory was 63.0MB in the beginning and 61.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.83ms. Allocated memory is still 96.5MB. Free memory was 61.0MB in the beginning and 59.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 368.00ms. Allocated memory is still 96.5MB. Free memory was 59.7MB in the beginning and 48.4MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 67868.60ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 48.0MB in the beginning and 58.9MB in the end (delta: -10.9MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* ULTIMATE.start_main_~j~0#1 4) ULTIMATE.start_main_~arr~0#1.offset))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* ULTIMATE.start_main_~j~0#1 4) ULTIMATE.start_main_~arr~0#1.offset))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:35:36,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:36,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0