./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56b28f59847d63942ec468b0c95f39e5b8c0763a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no settings was sufficient --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 05:21:20,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 05:21:20,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 05:21:20,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 05:21:20,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 05:21:20,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 05:21:20,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 05:21:20,288 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 05:21:20,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 05:21:20,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 05:21:20,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 05:21:20,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 05:21:20,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 05:21:20,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 05:21:20,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 05:21:20,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 05:21:20,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 05:21:20,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 05:21:20,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 05:21:20,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 05:21:20,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 05:21:20,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 05:21:20,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 05:21:20,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 05:21:20,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 05:21:20,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 05:21:20,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 05:21:20,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 05:21:20,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 05:21:20,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 05:21:20,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 05:21:20,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 05:21:20,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 05:21:20,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 05:21:20,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 05:21:20,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 05:21:20,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 05:21:20,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 05:21:20,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 05:21:20,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 05:21:20,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 05:21:20,335 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 05:21:20,365 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 05:21:20,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 05:21:20,366 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 05:21:20,366 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 05:21:20,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 05:21:20,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 05:21:20,368 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 05:21:20,368 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 05:21:20,368 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 05:21:20,369 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 05:21:20,369 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 05:21:20,369 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 05:21:20,369 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 05:21:20,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 05:21:20,370 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 05:21:20,370 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 05:21:20,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 05:21:20,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 05:21:20,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 05:21:20,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 05:21:20,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 05:21:20,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 05:21:20,371 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 05:21:20,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 05:21:20,371 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 05:21:20,371 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 05:21:20,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 05:21:20,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 05:21:20,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 05:21:20,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 05:21:20,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 05:21:20,372 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 05:21:20,373 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 05:21:20,373 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 56b28f59847d63942ec468b0c95f39e5b8c0763a [2021-08-31 05:21:20,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 05:21:20,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 05:21:20,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 05:21:20,658 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 05:21:20,660 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 05:21:20,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration.c [2021-08-31 05:21:20,711 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3aeb1390d/0e17ebf8c3ea4609bcdd7c01a0ded557/FLAG72663bb87 [2021-08-31 05:21:21,025 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 05:21:21,025 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration.c [2021-08-31 05:21:21,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3aeb1390d/0e17ebf8c3ea4609bcdd7c01a0ded557/FLAG72663bb87 [2021-08-31 05:21:21,453 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3aeb1390d/0e17ebf8c3ea4609bcdd7c01a0ded557 [2021-08-31 05:21:21,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 05:21:21,456 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 05:21:21,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 05:21:21,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 05:21:21,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 05:21:21,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 05:21:21" (1/1) ... [2021-08-31 05:21:21,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@625fa1e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:21, skipping insertion in model container [2021-08-31 05:21:21,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 05:21:21" (1/1) ... [2021-08-31 05:21:21,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 05:21:21,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 05:21:21,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 05:21:21,565 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 05:21:21,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 05:21:21,582 INFO L208 MainTranslator]: Completed translation [2021-08-31 05:21:21,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:21 WrapperNode [2021-08-31 05:21:21,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 05:21:21,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 05:21:21,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 05:21:21,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 05:21:21,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:21" (1/1) ... [2021-08-31 05:21:21,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:21" (1/1) ... [2021-08-31 05:21:21,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 05:21:21,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 05:21:21,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 05:21:21,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 05:21:21,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:21" (1/1) ... [2021-08-31 05:21:21,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:21" (1/1) ... [2021-08-31 05:21:21,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:21" (1/1) ... [2021-08-31 05:21:21,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:21" (1/1) ... [2021-08-31 05:21:21,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:21" (1/1) ... [2021-08-31 05:21:21,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:21" (1/1) ... [2021-08-31 05:21:21,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:21" (1/1) ... [2021-08-31 05:21:21,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 05:21:21,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 05:21:21,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 05:21:21,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 05:21:21,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:21" (1/1) ... [2021-08-31 05:21:21,674 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:21,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:21,695 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) [2021-08-31 05:21:21,716 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 [2021-08-31 05:21:21,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-31 05:21:21,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 05:21:21,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 05:21:21,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-31 05:21:21,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 05:21:21,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-31 05:21:21,869 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 05:21:21,869 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-08-31 05:21:21,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 05:21:21 BoogieIcfgContainer [2021-08-31 05:21:21,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 05:21:21,871 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 05:21:21,871 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 05:21:21,873 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 05:21:21,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:21:21,874 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 05:21:21" (1/3) ... [2021-08-31 05:21:21,874 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f1f1ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 05:21:21, skipping insertion in model container [2021-08-31 05:21:21,874 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:21:21,874 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:21:21" (2/3) ... [2021-08-31 05:21:21,875 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f1f1ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 05:21:21, skipping insertion in model container [2021-08-31 05:21:21,875 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:21:21,875 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 05:21:21" (3/3) ... [2021-08-31 05:21:21,876 INFO L389 chiAutomizerObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration.c [2021-08-31 05:21:21,918 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 05:21:21,919 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 05:21:21,919 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 05:21:21,919 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 05:21:21,919 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 05:21:21,919 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 05:21:21,919 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 05:21:21,919 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 05:21:21,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:21,947 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-08-31 05:21:21,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:21,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:21,951 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 05:21:21,951 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-31 05:21:21,951 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 05:21:21,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:21,954 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-08-31 05:21:21,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:21,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:21,955 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 05:21:21,955 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-31 05:21:21,962 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 16#L26-3true [2021-08-31 05:21:21,962 INFO L793 eck$LassoCheckResult]: Loop: 16#L26-3true assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 9#L17-3true assume !(foo_~i~0 <= foo_~size); 10#L17-4true foo_#res := foo_~i~0; 17#L20true main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 15#L26-2true main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 16#L26-3true [2021-08-31 05:21:21,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:21,972 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-31 05:21:21,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:21,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627545921] [2021-08-31 05:21:21,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:21,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:22,046 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:22,076 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:22,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:22,085 INFO L82 PathProgramCache]: Analyzing trace with hash 38364915, now seen corresponding path program 1 times [2021-08-31 05:21:22,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:22,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813684368] [2021-08-31 05:21:22,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:22,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:22,104 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:22,112 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:22,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:22,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1809804401, now seen corresponding path program 1 times [2021-08-31 05:21:22,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:22,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618455568] [2021-08-31 05:21:22,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:22,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:21:22,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:21:22,224 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618455568] [2021-08-31 05:21:22,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618455568] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:21:22,224 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 05:21:22,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 05:21:22,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183719947] [2021-08-31 05:21:22,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:21:22,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 05:21:22,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-31 05:21:22,419 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 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 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) [2021-08-31 05:21:22,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:21:22,485 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-08-31 05:21:22,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-31 05:21:22,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2021-08-31 05:21:22,492 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-08-31 05:21:22,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 23 states and 26 transitions. [2021-08-31 05:21:22,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-08-31 05:21:22,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-08-31 05:21:22,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2021-08-31 05:21:22,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:21:22,499 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2021-08-31 05:21:22,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2021-08-31 05:21:22,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. [2021-08-31 05:21:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 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) [2021-08-31 05:21:22,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-08-31 05:21:22,519 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-08-31 05:21:22,520 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-08-31 05:21:22,520 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 05:21:22,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2021-08-31 05:21:22,522 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-08-31 05:21:22,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:22,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:22,523 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-31 05:21:22,523 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 05:21:22,524 INFO L791 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 69#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 74#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 73#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 63#L17-2 [2021-08-31 05:21:22,524 INFO L793 eck$LassoCheckResult]: Loop: 63#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 64#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 63#L17-2 [2021-08-31 05:21:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:22,524 INFO L82 PathProgramCache]: Analyzing trace with hash 925771, now seen corresponding path program 1 times [2021-08-31 05:21:22,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:22,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117442839] [2021-08-31 05:21:22,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:22,526 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:22,549 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:22,569 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:22,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:22,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1599, now seen corresponding path program 1 times [2021-08-31 05:21:22,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:22,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238920310] [2021-08-31 05:21:22,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:22,584 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:22,587 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:22,590 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:22,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:22,590 INFO L82 PathProgramCache]: Analyzing trace with hash 889666569, now seen corresponding path program 1 times [2021-08-31 05:21:22,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:22,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108524375] [2021-08-31 05:21:22,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:22,591 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:22,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:21:22,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:21:22,623 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108524375] [2021-08-31 05:21:22,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108524375] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:21:22,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374323095] [2021-08-31 05:21:22,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:22,624 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:21:22,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:22,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:21:22,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-31 05:21:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:22,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 05:21:22,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:21:22,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-31 05:21:22,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374323095] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:21:22,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-31 05:21:22,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2021-08-31 05:21:22,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320047973] [2021-08-31 05:21:22,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:21:22,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 05:21:22,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-08-31 05:21:22,774 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:22,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:21:22,824 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2021-08-31 05:21:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-31 05:21:22,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 33 transitions. [2021-08-31 05:21:22,825 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2021-08-31 05:21:22,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 33 transitions. [2021-08-31 05:21:22,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-08-31 05:21:22,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-08-31 05:21:22,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 33 transitions. [2021-08-31 05:21:22,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:21:22,827 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2021-08-31 05:21:22,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 33 transitions. [2021-08-31 05:21:22,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 16. [2021-08-31 05:21:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2021-08-31 05:21:22,828 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2021-08-31 05:21:22,829 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2021-08-31 05:21:22,829 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 05:21:22,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2021-08-31 05:21:22,829 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-08-31 05:21:22,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:22,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:22,830 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-31 05:21:22,830 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-31 05:21:22,830 INFO L791 eck$LassoCheckResult]: Stem: 144#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 145#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 149#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 152#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 154#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 150#L17-3 assume !(foo_~i~0 <= foo_~size); 151#L17-4 [2021-08-31 05:21:22,830 INFO L793 eck$LassoCheckResult]: Loop: 151#L17-4 foo_#res := foo_~i~0; 153#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 147#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 148#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 140#L17-3 assume !(foo_~i~0 <= foo_~size); 151#L17-4 [2021-08-31 05:21:22,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:22,831 INFO L82 PathProgramCache]: Analyzing trace with hash 889666567, now seen corresponding path program 1 times [2021-08-31 05:21:22,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:22,831 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321147462] [2021-08-31 05:21:22,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:22,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:22,839 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:22,846 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:22,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:22,847 INFO L82 PathProgramCache]: Analyzing trace with hash 51595455, now seen corresponding path program 2 times [2021-08-31 05:21:22,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:22,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343523831] [2021-08-31 05:21:22,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:22,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:22,851 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:22,855 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:22,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:22,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1198432377, now seen corresponding path program 1 times [2021-08-31 05:21:22,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:22,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132824346] [2021-08-31 05:21:22,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:22,857 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-31 05:21:22,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:21:22,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132824346] [2021-08-31 05:21:22,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132824346] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:21:22,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918772002] [2021-08-31 05:21:22,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:22,900 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:21:22,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:22,902 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:21:22,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-31 05:21:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:22,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 05:21:22,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-31 05:21:22,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:21:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-31 05:21:23,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918772002] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:21:23,025 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:21:23,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-08-31 05:21:23,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655549415] [2021-08-31 05:21:23,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:21:23,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-31 05:21:23,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-08-31 05:21:23,129 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 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) [2021-08-31 05:21:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:21:23,198 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2021-08-31 05:21:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-31 05:21:23,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2021-08-31 05:21:23,199 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2021-08-31 05:21:23,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2021-08-31 05:21:23,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-08-31 05:21:23,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-08-31 05:21:23,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2021-08-31 05:21:23,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:21:23,200 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-08-31 05:21:23,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2021-08-31 05:21:23,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2021-08-31 05:21:23,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2021-08-31 05:21:23,202 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-08-31 05:21:23,202 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-08-31 05:21:23,202 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 05:21:23,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2021-08-31 05:21:23,202 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2021-08-31 05:21:23,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:23,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:23,203 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-31 05:21:23,203 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1] [2021-08-31 05:21:23,203 INFO L791 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 263#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 270#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 273#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 278#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 276#L17-3 assume !(foo_~i~0 <= foo_~size); 274#L17-4 [2021-08-31 05:21:23,203 INFO L793 eck$LassoCheckResult]: Loop: 274#L17-4 foo_#res := foo_~i~0; 272#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 267#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 268#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 275#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 260#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 261#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 271#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 277#L17-3 assume !(foo_~i~0 <= foo_~size); 274#L17-4 [2021-08-31 05:21:23,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:23,204 INFO L82 PathProgramCache]: Analyzing trace with hash 889666567, now seen corresponding path program 2 times [2021-08-31 05:21:23,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:23,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286766331] [2021-08-31 05:21:23,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:23,209 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:23,229 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:23,245 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:23,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:23,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1121476027, now seen corresponding path program 1 times [2021-08-31 05:21:23,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:23,248 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772299318] [2021-08-31 05:21:23,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:23,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:23,253 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:23,260 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:23,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:23,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1242740619, now seen corresponding path program 2 times [2021-08-31 05:21:23,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:23,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843427669] [2021-08-31 05:21:23,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:23,261 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:23,271 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:23,283 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:23,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:23,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2021-08-31 05:21:23,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-08-31 05:21:23,795 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:21:23,796 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:21:23,796 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:21:23,796 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:21:23,796 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:21:23,796 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:23,797 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:21:23,797 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:21:23,797 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysWithLenghtAtDeclaration.c_Iteration4_Lasso [2021-08-31 05:21:23,797 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:21:23,797 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:21:23,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:23,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:23,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:23,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:23,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:23,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:23,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:23,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:23,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:24,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:24,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:24,360 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:21:24,363 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 05:21:24,364 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:24,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:24,366 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) [2021-08-31 05:21:24,369 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 [2021-08-31 05:21:24,369 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 [2021-08-31 05:21:24,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:24,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:24,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:24,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:24,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:24,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:24,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:24,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:24,399 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 [2021-08-31 05:21:24,400 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:24,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:24,401 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) [2021-08-31 05:21:24,401 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 [2021-08-31 05:21:24,403 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 [2021-08-31 05:21:24,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:24,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:24,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:24,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:24,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:24,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:24,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:24,424 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:24,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-08-31 05:21:24,441 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:24,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:24,442 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) [2021-08-31 05:21:24,446 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 [2021-08-31 05:21:24,447 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 [2021-08-31 05:21:24,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:24,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:24,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:24,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:24,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:24,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:24,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:24,456 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:24,473 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 [2021-08-31 05:21:24,473 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:24,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:24,474 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) [2021-08-31 05:21:24,475 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 [2021-08-31 05:21:24,476 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 [2021-08-31 05:21:24,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:24,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:24,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:24,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:24,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:24,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:24,492 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:24,510 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 [2021-08-31 05:21:24,510 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:24,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:24,513 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) [2021-08-31 05:21:24,513 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 [2021-08-31 05:21:24,515 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 [2021-08-31 05:21:24,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:24,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:24,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:24,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:24,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:24,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:24,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:24,528 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:24,546 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 [2021-08-31 05:21:24,546 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:24,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:24,547 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) [2021-08-31 05:21:24,547 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 [2021-08-31 05:21:24,549 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 [2021-08-31 05:21:24,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:24,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:24,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:24,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:24,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:24,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:24,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:24,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:24,574 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 [2021-08-31 05:21:24,574 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:24,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:24,575 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) [2021-08-31 05:21:24,576 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 [2021-08-31 05:21:24,577 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 [2021-08-31 05:21:24,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:24,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:24,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:24,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:24,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:24,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:24,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:24,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:24,625 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 [2021-08-31 05:21:24,626 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:24,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:24,626 INFO L229 MonitoredProcess]: Starting monitored process 11 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) [2021-08-31 05:21:24,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-31 05:21:24,628 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 [2021-08-31 05:21:24,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:24,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:24,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:24,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:24,637 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:24,637 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:24,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:24,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:24,660 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:24,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:24,661 INFO L229 MonitoredProcess]: Starting monitored process 12 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) [2021-08-31 05:21:24,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-31 05:21:24,663 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 [2021-08-31 05:21:24,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:24,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:24,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:24,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:24,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:24,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:24,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:24,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:24,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:24,686 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:24,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:24,687 INFO L229 MonitoredProcess]: Starting monitored process 13 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) [2021-08-31 05:21:24,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-31 05:21:24,689 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 [2021-08-31 05:21:24,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:24,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:24,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:24,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:24,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:24,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:24,705 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:24,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-08-31 05:21:24,721 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:24,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:24,722 INFO L229 MonitoredProcess]: Starting monitored process 14 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) [2021-08-31 05:21:24,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-31 05:21:24,724 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 [2021-08-31 05:21:24,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:24,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:24,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:24,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:24,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:24,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:24,738 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:24,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:24,754 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:24,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:24,754 INFO L229 MonitoredProcess]: Starting monitored process 15 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) [2021-08-31 05:21:24,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-31 05:21:24,756 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 [2021-08-31 05:21:24,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:24,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:24,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:24,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:24,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:24,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:24,788 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:24,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:24,806 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:24,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:24,807 INFO L229 MonitoredProcess]: Starting monitored process 16 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) [2021-08-31 05:21:24,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-31 05:21:24,811 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 [2021-08-31 05:21:24,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:24,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:24,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:24,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:24,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:24,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:24,860 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 05:21:24,882 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-08-31 05:21:24,882 INFO L444 ModelExtractionUtils]: 3 out of 37 variables were initially zero. Simplification set additionally 31 variables to zero. [2021-08-31 05:21:24,883 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:24,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:24,885 INFO L229 MonitoredProcess]: Starting monitored process 17 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) [2021-08-31 05:21:24,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-31 05:21:24,935 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 05:21:24,972 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-31 05:21:24,973 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 05:21:24,973 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 1 Supporting invariants [] [2021-08-31 05:21:24,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:25,008 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2021-08-31 05:21:25,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:25,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 05:21:25,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:25,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-31 05:21:25,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:21:25,171 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2021-08-31 05:21:25,172 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 21 transitions. cyclomatic complexity: 4 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:25,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:25,276 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 21 transitions. cyclomatic complexity: 4. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 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 41 states and 47 transitions. Complement of second has 13 states. [2021-08-31 05:21:25,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2021-08-31 05:21:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2021-08-31 05:21:25,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 6 letters. Loop has 9 letters. [2021-08-31 05:21:25,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:21:25,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 15 letters. Loop has 9 letters. [2021-08-31 05:21:25,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:21:25,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 6 letters. Loop has 18 letters. [2021-08-31 05:21:25,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:21:25,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 47 transitions. [2021-08-31 05:21:25,280 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2021-08-31 05:21:25,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 46 transitions. [2021-08-31 05:21:25,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-08-31 05:21:25,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-08-31 05:21:25,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 46 transitions. [2021-08-31 05:21:25,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:21:25,281 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2021-08-31 05:21:25,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 46 transitions. [2021-08-31 05:21:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2021-08-31 05:21:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 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) [2021-08-31 05:21:25,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2021-08-31 05:21:25,283 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-08-31 05:21:25,283 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-08-31 05:21:25,283 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 05:21:25,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2021-08-31 05:21:25,283 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-08-31 05:21:25,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:25,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:25,284 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:21:25,284 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 1, 1, 1, 1, 1] [2021-08-31 05:21:25,284 INFO L791 eck$LassoCheckResult]: Stem: 440#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 441#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 449#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 452#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 460#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 459#L17-3 assume !(foo_~i~0 <= foo_~size); 457#L17-4 foo_#res := foo_~i~0; 450#L20 [2021-08-31 05:21:25,284 INFO L793 eck$LassoCheckResult]: Loop: 450#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 442#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 443#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 456#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 465#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 464#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 433#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 434#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 447#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 458#L17-3 assume !(foo_~i~0 <= foo_~size); 454#L17-4 foo_#res := foo_~i~0; 450#L20 [2021-08-31 05:21:25,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:25,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1809859825, now seen corresponding path program 1 times [2021-08-31 05:21:25,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:25,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720029532] [2021-08-31 05:21:25,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:25,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:25,295 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:25,305 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:25,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:25,305 INFO L82 PathProgramCache]: Analyzing trace with hash 961271861, now seen corresponding path program 2 times [2021-08-31 05:21:25,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:25,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599841297] [2021-08-31 05:21:25,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:25,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:25,312 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:25,318 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:25,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:25,318 INFO L82 PathProgramCache]: Analyzing trace with hash 132390213, now seen corresponding path program 3 times [2021-08-31 05:21:25,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:25,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170688759] [2021-08-31 05:21:25,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:25,319 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-31 05:21:25,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:21:25,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170688759] [2021-08-31 05:21:25,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170688759] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:21:25,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994200977] [2021-08-31 05:21:25,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-31 05:21:25,355 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:21:25,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:25,356 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) [2021-08-31 05:21:25,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-31 05:21:25,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-31 05:21:25,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 05:21:25,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-31 05:21:25,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-31 05:21:25,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:21:25,527 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-31 05:21:25,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994200977] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:21:25,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:21:25,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2021-08-31 05:21:25,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545091730] [2021-08-31 05:21:25,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:25,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:25,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:25,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2021-08-31 05:21:25,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:21:25,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-31 05:21:25,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-31 05:21:25,740 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. cyclomatic complexity: 9 Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:21:25,871 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2021-08-31 05:21:25,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-31 05:21:25,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 80 transitions. [2021-08-31 05:21:25,873 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2021-08-31 05:21:25,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 65 states and 72 transitions. [2021-08-31 05:21:25,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-08-31 05:21:25,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-08-31 05:21:25,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 72 transitions. [2021-08-31 05:21:25,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:21:25,874 INFO L681 BuchiCegarLoop]: Abstraction has 65 states and 72 transitions. [2021-08-31 05:21:25,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 72 transitions. [2021-08-31 05:21:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 42. [2021-08-31 05:21:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.119047619047619) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2021-08-31 05:21:25,876 INFO L704 BuchiCegarLoop]: Abstraction has 42 states and 47 transitions. [2021-08-31 05:21:25,876 INFO L587 BuchiCegarLoop]: Abstraction has 42 states and 47 transitions. [2021-08-31 05:21:25,876 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 05:21:25,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 47 transitions. [2021-08-31 05:21:25,877 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-08-31 05:21:25,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:25,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:25,877 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1] [2021-08-31 05:21:25,877 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 1, 1, 1, 1, 1] [2021-08-31 05:21:25,878 INFO L791 eck$LassoCheckResult]: Stem: 684#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 685#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 693#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 696#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 702#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 701#L17-3 assume !(foo_~i~0 <= foo_~size); 698#L17-4 foo_#res := foo_~i~0; 699#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 717#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 697#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 692#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 679#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 680#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 718#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 716#L17-3 assume !(foo_~i~0 <= foo_~size); 703#L17-4 foo_#res := foo_~i~0; 694#L20 [2021-08-31 05:21:25,878 INFO L793 eck$LassoCheckResult]: Loop: 694#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 686#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 687#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 691#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 677#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 678#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 713#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 711#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 708#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 707#L17-3 assume !(foo_~i~0 <= foo_~size); 704#L17-4 foo_#res := foo_~i~0; 694#L20 [2021-08-31 05:21:25,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:25,878 INFO L82 PathProgramCache]: Analyzing trace with hash 129746499, now seen corresponding path program 4 times [2021-08-31 05:21:25,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:25,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591323435] [2021-08-31 05:21:25,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:25,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:25,886 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:25,902 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:25,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:25,903 INFO L82 PathProgramCache]: Analyzing trace with hash 961271861, now seen corresponding path program 3 times [2021-08-31 05:21:25,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:25,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959489052] [2021-08-31 05:21:25,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:25,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:25,908 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:25,914 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:25,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:25,914 INFO L82 PathProgramCache]: Analyzing trace with hash 6616243, now seen corresponding path program 5 times [2021-08-31 05:21:25,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:25,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611573774] [2021-08-31 05:21:25,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:25,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:25,932 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:25,953 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:26,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:26,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:26,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:26,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2021-08-31 05:21:26,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2021-08-31 05:21:26,576 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:21:26,576 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:21:26,576 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:21:26,576 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:21:26,576 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:21:26,576 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:26,577 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:21:26,577 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:21:26,577 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysWithLenghtAtDeclaration.c_Iteration6_Lasso [2021-08-31 05:21:26,577 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:21:26,577 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:21:26,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:26,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:26,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:26,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:26,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:26,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:26,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:26,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:26,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:26,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:27,194 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:21:27,194 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 05:21:27,194 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:27,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:27,203 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2021-08-31 05:21:27,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-31 05:21:27,205 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 [2021-08-31 05:21:27,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:27,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:27,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:27,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:27,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:27,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:27,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:27,216 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:27,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:27,233 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:27,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:27,234 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2021-08-31 05:21:27,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-31 05:21:27,236 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 [2021-08-31 05:21:27,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:27,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:27,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:27,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:27,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:27,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:27,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:27,244 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:27,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:27,259 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:27,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:27,260 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2021-08-31 05:21:27,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-31 05:21:27,262 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 [2021-08-31 05:21:27,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:27,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:27,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:27,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:27,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:27,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:27,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:27,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:27,288 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:27,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:27,288 INFO L229 MonitoredProcess]: Starting monitored process 22 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) [2021-08-31 05:21:27,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-08-31 05:21:27,290 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 [2021-08-31 05:21:27,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:27,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:27,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:27,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:27,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:27,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:27,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:27,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:27,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:27,315 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:27,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:27,316 INFO L229 MonitoredProcess]: Starting monitored process 23 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) [2021-08-31 05:21:27,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-08-31 05:21:27,318 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 [2021-08-31 05:21:27,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:27,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:27,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:27,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:27,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:27,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:27,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:27,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:27,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:27,343 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:27,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:27,343 INFO L229 MonitoredProcess]: Starting monitored process 24 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) [2021-08-31 05:21:27,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-08-31 05:21:27,345 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 [2021-08-31 05:21:27,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:27,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:27,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:27,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:27,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:27,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:27,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:27,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:27,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-08-31 05:21:27,369 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:27,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:27,369 INFO L229 MonitoredProcess]: Starting monitored process 25 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) [2021-08-31 05:21:27,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-08-31 05:21:27,374 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 [2021-08-31 05:21:27,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:27,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:27,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:27,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:27,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:27,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:27,414 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 05:21:27,462 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-08-31 05:21:27,463 INFO L444 ModelExtractionUtils]: 3 out of 40 variables were initially zero. Simplification set additionally 34 variables to zero. [2021-08-31 05:21:27,463 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:27,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:27,464 INFO L229 MonitoredProcess]: Starting monitored process 26 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) [2021-08-31 05:21:27,497 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 05:21:27,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-08-31 05:21:27,513 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-31 05:21:27,513 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 05:21:27,513 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 3 Supporting invariants [] [2021-08-31 05:21:27,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:27,547 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-08-31 05:21:27,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:27,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 05:21:27,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:27,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-31 05:21:27,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:27,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:21:27,701 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2021-08-31 05:21:27,701 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8 Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:27,781 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) Result 96 states and 109 transitions. Complement of second has 15 states. [2021-08-31 05:21:27,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2021-08-31 05:21:27,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2021-08-31 05:21:27,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 16 letters. Loop has 11 letters. [2021-08-31 05:21:27,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:21:27,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 27 letters. Loop has 11 letters. [2021-08-31 05:21:27,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:21:27,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 16 letters. Loop has 22 letters. [2021-08-31 05:21:27,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:21:27,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 109 transitions. [2021-08-31 05:21:27,784 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-08-31 05:21:27,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 72 states and 82 transitions. [2021-08-31 05:21:27,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-08-31 05:21:27,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-08-31 05:21:27,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 82 transitions. [2021-08-31 05:21:27,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:21:27,784 INFO L681 BuchiCegarLoop]: Abstraction has 72 states and 82 transitions. [2021-08-31 05:21:27,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 82 transitions. [2021-08-31 05:21:27,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2021-08-31 05:21:27,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.152542372881356) internal successors, (68), 58 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2021-08-31 05:21:27,788 INFO L704 BuchiCegarLoop]: Abstraction has 59 states and 68 transitions. [2021-08-31 05:21:27,788 INFO L587 BuchiCegarLoop]: Abstraction has 59 states and 68 transitions. [2021-08-31 05:21:27,788 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-31 05:21:27,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 68 transitions. [2021-08-31 05:21:27,789 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2021-08-31 05:21:27,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:27,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:27,789 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1] [2021-08-31 05:21:27,789 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1, 1, 1] [2021-08-31 05:21:27,789 INFO L791 eck$LassoCheckResult]: Stem: 988#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 989#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 997#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1002#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1034#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1007#L17-3 assume !(foo_~i~0 <= foo_~size); 1008#L17-4 foo_#res := foo_~i~0; 1033#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 992#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 993#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1019#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1020#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1015#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1016#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1012#L17-3 assume !(foo_~i~0 <= foo_~size); 1011#L17-4 foo_#res := foo_~i~0; 1005#L20 [2021-08-31 05:21:27,790 INFO L793 eck$LassoCheckResult]: Loop: 1005#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 990#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 991#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 995#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 981#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 982#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1038#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1037#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1036#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1035#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1009#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1010#L17-3 assume !(foo_~i~0 <= foo_~size); 1004#L17-4 foo_#res := foo_~i~0; 1005#L20 [2021-08-31 05:21:27,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:27,790 INFO L82 PathProgramCache]: Analyzing trace with hash 129746499, now seen corresponding path program 6 times [2021-08-31 05:21:27,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:27,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40741659] [2021-08-31 05:21:27,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:27,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:27,797 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:27,805 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:27,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:27,806 INFO L82 PathProgramCache]: Analyzing trace with hash 364346039, now seen corresponding path program 4 times [2021-08-31 05:21:27,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:27,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065318310] [2021-08-31 05:21:27,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:27,806 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:27,828 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:27,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:27,841 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:27,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:27,841 INFO L82 PathProgramCache]: Analyzing trace with hash 2063298485, now seen corresponding path program 7 times [2021-08-31 05:21:27,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:27,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107329696] [2021-08-31 05:21:27,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:27,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:27,891 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-31 05:21:27,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:21:27,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107329696] [2021-08-31 05:21:27,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107329696] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:21:27,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519593313] [2021-08-31 05:21:27,892 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-31 05:21:27,892 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:21:27,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:27,893 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:21:27,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-08-31 05:21:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:27,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-31 05:21:27,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 26 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-31 05:21:28,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:21:28,096 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 26 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-31 05:21:28,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519593313] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:21:28,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:21:28,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2021-08-31 05:21:28,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758109861] [2021-08-31 05:21:28,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:28,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:28,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:28,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 46 [2021-08-31 05:21:28,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:21:28,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-31 05:21:28,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-08-31 05:21:28,407 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. cyclomatic complexity: 13 Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 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) [2021-08-31 05:21:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:21:28,658 INFO L93 Difference]: Finished difference Result 146 states and 162 transitions. [2021-08-31 05:21:28,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-31 05:21:28,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 162 transitions. [2021-08-31 05:21:28,659 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2021-08-31 05:21:28,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 136 states and 152 transitions. [2021-08-31 05:21:28,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2021-08-31 05:21:28,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2021-08-31 05:21:28,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 152 transitions. [2021-08-31 05:21:28,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:21:28,660 INFO L681 BuchiCegarLoop]: Abstraction has 136 states and 152 transitions. [2021-08-31 05:21:28,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 152 transitions. [2021-08-31 05:21:28,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 80. [2021-08-31 05:21:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.1375) internal successors, (91), 79 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:28,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2021-08-31 05:21:28,664 INFO L704 BuchiCegarLoop]: Abstraction has 80 states and 91 transitions. [2021-08-31 05:21:28,664 INFO L587 BuchiCegarLoop]: Abstraction has 80 states and 91 transitions. [2021-08-31 05:21:28,664 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-31 05:21:28,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 91 transitions. [2021-08-31 05:21:28,664 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2021-08-31 05:21:28,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:28,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:28,665 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 2, 2, 1, 1] [2021-08-31 05:21:28,665 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1, 1, 1] [2021-08-31 05:21:28,665 INFO L791 eck$LassoCheckResult]: Stem: 1417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1418#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 1427#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1439#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1440#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1436#L17-3 assume !(foo_~i~0 <= foo_~size); 1434#L17-4 foo_#res := foo_~i~0; 1435#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 1458#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1457#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1456#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1455#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1454#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1453#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1452#L17-3 assume !(foo_~i~0 <= foo_~size); 1446#L17-4 foo_#res := foo_~i~0; 1448#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 1488#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1477#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1478#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1471#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1472#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1464#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1465#L17-3 assume !(foo_~i~0 <= foo_~size); 1451#L17-4 foo_#res := foo_~i~0; 1445#L20 [2021-08-31 05:21:28,665 INFO L793 eck$LassoCheckResult]: Loop: 1445#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 1419#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1420#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1431#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1410#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1411#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1424#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1444#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1443#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1442#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1437#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1438#L17-3 assume !(foo_~i~0 <= foo_~size); 1441#L17-4 foo_#res := foo_~i~0; 1445#L20 [2021-08-31 05:21:28,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:28,665 INFO L82 PathProgramCache]: Analyzing trace with hash -741891791, now seen corresponding path program 8 times [2021-08-31 05:21:28,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:28,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155041958] [2021-08-31 05:21:28,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:28,665 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 38 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-31 05:21:28,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:21:28,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155041958] [2021-08-31 05:21:28,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155041958] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:21:28,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705941867] [2021-08-31 05:21:28,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-31 05:21:28,720 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:21:28,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:28,721 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:21:28,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-08-31 05:21:28,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-31 05:21:28,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 05:21:28,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-31 05:21:28,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:28,853 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-31 05:21:28,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:21:28,903 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-31 05:21:28,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705941867] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:21:28,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:21:28,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2021-08-31 05:21:28,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340028792] [2021-08-31 05:21:28,905 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:21:28,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:28,906 INFO L82 PathProgramCache]: Analyzing trace with hash 364346039, now seen corresponding path program 5 times [2021-08-31 05:21:28,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:28,906 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431498848] [2021-08-31 05:21:28,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:28,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:28,911 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:28,919 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:29,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:29,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:29,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:29,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:29,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:29,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:29,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 52 [2021-08-31 05:21:29,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:21:29,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-31 05:21:29,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-08-31 05:21:29,173 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. cyclomatic complexity: 15 Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 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) [2021-08-31 05:21:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:21:29,325 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2021-08-31 05:21:29,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-31 05:21:29,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 92 transitions. [2021-08-31 05:21:29,326 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2021-08-31 05:21:29,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 63 states and 68 transitions. [2021-08-31 05:21:29,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2021-08-31 05:21:29,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2021-08-31 05:21:29,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 68 transitions. [2021-08-31 05:21:29,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:21:29,327 INFO L681 BuchiCegarLoop]: Abstraction has 63 states and 68 transitions. [2021-08-31 05:21:29,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 68 transitions. [2021-08-31 05:21:29,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2021-08-31 05:21:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.087719298245614) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2021-08-31 05:21:29,329 INFO L704 BuchiCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-08-31 05:21:29,329 INFO L587 BuchiCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-08-31 05:21:29,329 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-31 05:21:29,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 62 transitions. [2021-08-31 05:21:29,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2021-08-31 05:21:29,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:29,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:29,330 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 3, 3, 3, 2, 2, 1, 1] [2021-08-31 05:21:29,330 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1, 1, 1] [2021-08-31 05:21:29,330 INFO L791 eck$LassoCheckResult]: Stem: 1756#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1757#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 1765#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1791#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1787#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1785#L17-3 assume !(foo_~i~0 <= foo_~size); 1779#L17-4 foo_#res := foo_~i~0; 1776#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 1758#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1759#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1769#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1794#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1790#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1786#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1784#L17-3 assume !(foo_~i~0 <= foo_~size); 1771#L17-4 foo_#res := foo_~i~0; 1766#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 1760#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1761#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1770#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1751#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1752#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1764#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1805#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1804#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1803#L17-3 assume !(foo_~i~0 <= foo_~size); 1777#L17-4 foo_#res := foo_~i~0; 1775#L20 [2021-08-31 05:21:29,330 INFO L793 eck$LassoCheckResult]: Loop: 1775#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 1774#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1773#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 1763#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1749#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1750#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1798#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1796#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1793#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1789#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 1783#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 1782#L17-3 assume !(foo_~i~0 <= foo_~size); 1778#L17-4 foo_#res := foo_~i~0; 1775#L20 [2021-08-31 05:21:29,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:29,330 INFO L82 PathProgramCache]: Analyzing trace with hash 6616243, now seen corresponding path program 9 times [2021-08-31 05:21:29,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:29,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826251365] [2021-08-31 05:21:29,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:29,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:29,345 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:29,354 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:29,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:29,354 INFO L82 PathProgramCache]: Analyzing trace with hash 364346039, now seen corresponding path program 6 times [2021-08-31 05:21:29,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:29,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034572403] [2021-08-31 05:21:29,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:29,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:29,358 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:29,362 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:29,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:29,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1211447109, now seen corresponding path program 10 times [2021-08-31 05:21:29,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:29,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698414175] [2021-08-31 05:21:29,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:29,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:29,377 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:29,402 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:29,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:29,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:29,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:29,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:29,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:29,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:29,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 57 [2021-08-31 05:21:30,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:30,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:30,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 35 [2021-08-31 05:21:30,344 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:21:30,344 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:21:30,344 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:21:30,344 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:21:30,344 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:21:30,344 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:30,344 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:21:30,344 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:21:30,344 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysWithLenghtAtDeclaration.c_Iteration9_Lasso [2021-08-31 05:21:30,344 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:21:30,344 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:21:30,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:30,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:30,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:30,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:30,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:30,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:30,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:30,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:30,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:30,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:31,038 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:21:31,038 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 05:21:31,038 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:31,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:31,041 INFO L229 MonitoredProcess]: Starting monitored process 29 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) [2021-08-31 05:21:31,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-08-31 05:21:31,075 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 [2021-08-31 05:21:31,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:31,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:31,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:31,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:31,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:31,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:31,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:31,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:31,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-08-31 05:21:31,098 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:31,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:31,101 INFO L229 MonitoredProcess]: Starting monitored process 30 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) [2021-08-31 05:21:31,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-08-31 05:21:31,102 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 [2021-08-31 05:21:31,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:31,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:31,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:31,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:31,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:31,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:31,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:31,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-08-31 05:21:31,144 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:31,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:31,145 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2021-08-31 05:21:31,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-08-31 05:21:31,147 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 [2021-08-31 05:21:31,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:31,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:31,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:31,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:31,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:31,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:31,175 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 05:21:31,216 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2021-08-31 05:21:31,216 INFO L444 ModelExtractionUtils]: 3 out of 40 variables were initially zero. Simplification set additionally 34 variables to zero. [2021-08-31 05:21:31,216 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:31,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:31,225 INFO L229 MonitoredProcess]: Starting monitored process 32 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) [2021-08-31 05:21:31,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-08-31 05:21:31,226 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 05:21:31,233 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-31 05:21:31,233 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 05:21:31,233 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 5 Supporting invariants [] [2021-08-31 05:21:31,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2021-08-31 05:21:31,291 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2021-08-31 05:21:31,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:31,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 05:21:31,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:31,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-31 05:21:31,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:31,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:31,539 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:21:31,540 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2021-08-31 05:21:31,540 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 62 transitions. cyclomatic complexity: 8 Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:31,639 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 62 transitions. cyclomatic complexity: 8. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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 123 states and 136 transitions. Complement of second has 17 states. [2021-08-31 05:21:31,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2021-08-31 05:21:31,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2021-08-31 05:21:31,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 32 transitions. Stem has 27 letters. Loop has 13 letters. [2021-08-31 05:21:31,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:21:31,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 32 transitions. Stem has 40 letters. Loop has 13 letters. [2021-08-31 05:21:31,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:21:31,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 32 transitions. Stem has 27 letters. Loop has 26 letters. [2021-08-31 05:21:31,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:21:31,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 136 transitions. [2021-08-31 05:21:31,641 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2021-08-31 05:21:31,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 87 states and 97 transitions. [2021-08-31 05:21:31,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-08-31 05:21:31,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-08-31 05:21:31,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 97 transitions. [2021-08-31 05:21:31,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:21:31,642 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 97 transitions. [2021-08-31 05:21:31,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 97 transitions. [2021-08-31 05:21:31,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2021-08-31 05:21:31,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.12) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:31,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2021-08-31 05:21:31,645 INFO L704 BuchiCegarLoop]: Abstraction has 75 states and 84 transitions. [2021-08-31 05:21:31,645 INFO L587 BuchiCegarLoop]: Abstraction has 75 states and 84 transitions. [2021-08-31 05:21:31,645 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-31 05:21:31,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 84 transitions. [2021-08-31 05:21:31,645 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-08-31 05:21:31,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:31,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:31,646 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 3, 3, 3, 2, 2, 1, 1] [2021-08-31 05:21:31,646 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 1, 1, 1, 1, 1] [2021-08-31 05:21:31,646 INFO L791 eck$LassoCheckResult]: Stem: 2202#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2203#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 2212#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2216#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2231#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2227#L17-3 assume !(foo_~i~0 <= foo_~size); 2228#L17-4 foo_#res := foo_~i~0; 2219#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 2220#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2217#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2218#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2263#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2214#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2215#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2261#L17-3 assume !(foo_~i~0 <= foo_~size); 2262#L17-4 foo_#res := foo_~i~0; 2272#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 2209#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2210#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2246#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2245#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2244#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2243#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2242#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2241#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2239#L17-3 assume !(foo_~i~0 <= foo_~size); 2240#L17-4 foo_#res := foo_~i~0; 2224#L20 [2021-08-31 05:21:31,646 INFO L793 eck$LassoCheckResult]: Loop: 2224#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 2207#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2208#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2226#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2198#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2199#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2213#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2238#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2237#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2236#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2235#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2234#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2229#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2230#L17-3 assume !(foo_~i~0 <= foo_~size); 2223#L17-4 foo_#res := foo_~i~0; 2224#L20 [2021-08-31 05:21:31,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:31,646 INFO L82 PathProgramCache]: Analyzing trace with hash 6616243, now seen corresponding path program 11 times [2021-08-31 05:21:31,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:31,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719155992] [2021-08-31 05:21:31,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:31,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:31,654 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:31,663 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:31,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:31,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2050718535, now seen corresponding path program 7 times [2021-08-31 05:21:31,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:31,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268063331] [2021-08-31 05:21:31,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:31,664 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:31,667 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:31,672 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:31,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:31,673 INFO L82 PathProgramCache]: Analyzing trace with hash 264590791, now seen corresponding path program 12 times [2021-08-31 05:21:31,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:31,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852621855] [2021-08-31 05:21:31,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:31,673 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:31,735 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 36 proven. 128 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-31 05:21:31,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:21:31,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852621855] [2021-08-31 05:21:31,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852621855] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:21:31,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809236848] [2021-08-31 05:21:31,736 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-31 05:21:31,736 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:21:31,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:31,737 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:21:31,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-08-31 05:21:31,786 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2021-08-31 05:21:31,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 05:21:31,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-31 05:21:31,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 43 proven. 121 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-31 05:21:31,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:21:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 43 proven. 121 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-31 05:21:32,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809236848] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:21:32,022 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:21:32,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2021-08-31 05:21:32,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510621128] [2021-08-31 05:21:32,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:32,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:32,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:32,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:32,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2021-08-31 05:21:32,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:21:32,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-31 05:21:32,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-08-31 05:21:32,381 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. cyclomatic complexity: 13 Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:32,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:21:32,729 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2021-08-31 05:21:32,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-31 05:21:32,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 193 transitions. [2021-08-31 05:21:32,733 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2021-08-31 05:21:32,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 165 states and 181 transitions. [2021-08-31 05:21:32,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2021-08-31 05:21:32,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2021-08-31 05:21:32,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 165 states and 181 transitions. [2021-08-31 05:21:32,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:21:32,735 INFO L681 BuchiCegarLoop]: Abstraction has 165 states and 181 transitions. [2021-08-31 05:21:32,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states and 181 transitions. [2021-08-31 05:21:32,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 100. [2021-08-31 05:21:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.11) internal successors, (111), 99 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2021-08-31 05:21:32,745 INFO L704 BuchiCegarLoop]: Abstraction has 100 states and 111 transitions. [2021-08-31 05:21:32,746 INFO L587 BuchiCegarLoop]: Abstraction has 100 states and 111 transitions. [2021-08-31 05:21:32,746 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-31 05:21:32,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 111 transitions. [2021-08-31 05:21:32,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-08-31 05:21:32,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:32,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:32,747 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 4, 4, 4, 3, 3, 1, 1] [2021-08-31 05:21:32,747 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 1, 1, 1, 1, 1] [2021-08-31 05:21:32,747 INFO L791 eck$LassoCheckResult]: Stem: 2780#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2781#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 2789#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2803#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2804#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2799#L17-3 assume !(foo_~i~0 <= foo_~size); 2800#L17-4 foo_#res := foo_~i~0; 2790#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 2784#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2785#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2842#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2841#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2840#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2839#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2838#L17-3 assume !(foo_~i~0 <= foo_~size); 2837#L17-4 foo_#res := foo_~i~0; 2835#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 2836#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2794#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2795#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2775#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2776#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2788#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2870#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2869#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2845#L17-3 assume !(foo_~i~0 <= foo_~size); 2846#L17-4 foo_#res := foo_~i~0; 2867#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 2866#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2827#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2828#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2864#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2862#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2860#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2858#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2856#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2851#L17-3 assume !(foo_~i~0 <= foo_~size); 2852#L17-4 foo_#res := foo_~i~0; 2797#L20 [2021-08-31 05:21:32,747 INFO L793 eck$LassoCheckResult]: Loop: 2797#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 2782#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2783#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 2793#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2773#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2774#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2787#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2809#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2808#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2807#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2806#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2805#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 2801#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 2802#L17-3 assume !(foo_~i~0 <= foo_~size); 2796#L17-4 foo_#res := foo_~i~0; 2797#L20 [2021-08-31 05:21:32,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:32,748 INFO L82 PathProgramCache]: Analyzing trace with hash 2106286147, now seen corresponding path program 13 times [2021-08-31 05:21:32,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:32,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601808847] [2021-08-31 05:21:32,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:32,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:32,803 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 27 proven. 91 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-31 05:21:32,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:21:32,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601808847] [2021-08-31 05:21:32,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601808847] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:21:32,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779185959] [2021-08-31 05:21:32,804 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-31 05:21:32,804 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:21:32,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:32,805 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:21:32,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-08-31 05:21:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:32,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-31 05:21:32,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:32,983 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 55 proven. 63 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-31 05:21:32,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:21:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 55 proven. 63 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-31 05:21:33,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779185959] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:21:33,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:21:33,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2021-08-31 05:21:33,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261164698] [2021-08-31 05:21:33,054 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:21:33,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:33,054 INFO L82 PathProgramCache]: Analyzing trace with hash -2050718535, now seen corresponding path program 8 times [2021-08-31 05:21:33,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:33,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256723496] [2021-08-31 05:21:33,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:33,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:33,059 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:33,063 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:33,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-08-31 05:21:33,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:21:33,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-31 05:21:33,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-08-31 05:21:33,332 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. cyclomatic complexity: 15 Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 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) [2021-08-31 05:21:33,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:21:33,522 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2021-08-31 05:21:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-31 05:21:33,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 116 transitions. [2021-08-31 05:21:33,524 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-08-31 05:21:33,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 83 states and 88 transitions. [2021-08-31 05:21:33,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2021-08-31 05:21:33,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-08-31 05:21:33,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 88 transitions. [2021-08-31 05:21:33,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:21:33,525 INFO L681 BuchiCegarLoop]: Abstraction has 83 states and 88 transitions. [2021-08-31 05:21:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 88 transitions. [2021-08-31 05:21:33,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2021-08-31 05:21:33,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.0675675675675675) internal successors, (79), 73 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2021-08-31 05:21:33,526 INFO L704 BuchiCegarLoop]: Abstraction has 74 states and 79 transitions. [2021-08-31 05:21:33,526 INFO L587 BuchiCegarLoop]: Abstraction has 74 states and 79 transitions. [2021-08-31 05:21:33,526 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-31 05:21:33,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 79 transitions. [2021-08-31 05:21:33,527 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-08-31 05:21:33,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:33,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:33,528 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 3, 3, 1, 1] [2021-08-31 05:21:33,528 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 1, 1, 1, 1, 1] [2021-08-31 05:21:33,528 INFO L791 eck$LassoCheckResult]: Stem: 3252#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3253#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 3262#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 3263#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3280#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3278#L17-3 assume !(foo_~i~0 <= foo_~size); 3274#L17-4 foo_#res := foo_~i~0; 3266#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 3256#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3257#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 3304#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3303#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3302#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3301#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3300#L17-3 assume !(foo_~i~0 <= foo_~size); 3299#L17-4 foo_#res := foo_~i~0; 3267#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 3268#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3264#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 3265#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3247#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3248#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3305#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3260#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3261#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3297#L17-3 assume !(foo_~i~0 <= foo_~size); 3298#L17-4 foo_#res := foo_~i~0; 3318#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 3317#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3316#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 3315#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3314#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3313#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3312#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3311#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3310#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3309#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3308#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3279#L17-3 assume !(foo_~i~0 <= foo_~size); 3275#L17-4 foo_#res := foo_~i~0; 3270#L20 [2021-08-31 05:21:33,528 INFO L793 eck$LassoCheckResult]: Loop: 3270#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 3254#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3255#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 3273#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3245#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3246#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3259#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3285#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3284#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3283#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3282#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3281#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3277#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3276#L17-3 assume !(foo_~i~0 <= foo_~size); 3269#L17-4 foo_#res := foo_~i~0; 3270#L20 [2021-08-31 05:21:33,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:33,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1211447109, now seen corresponding path program 14 times [2021-08-31 05:21:33,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:33,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029640057] [2021-08-31 05:21:33,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:33,529 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:33,545 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:33,557 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:33,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:33,557 INFO L82 PathProgramCache]: Analyzing trace with hash -2050718535, now seen corresponding path program 9 times [2021-08-31 05:21:33,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:33,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113521037] [2021-08-31 05:21:33,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:33,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:33,562 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:33,566 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:33,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:33,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1851350261, now seen corresponding path program 15 times [2021-08-31 05:21:33,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:33,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158314654] [2021-08-31 05:21:33,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:33,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:33,580 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:33,597 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:33,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-08-31 05:21:35,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:35,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:35,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:35,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:35,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:35,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 49 [2021-08-31 05:21:35,571 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:21:35,572 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:21:35,572 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:21:35,572 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:21:35,572 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:21:35,572 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:35,572 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:21:35,572 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:21:35,572 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysWithLenghtAtDeclaration.c_Iteration12_Lasso [2021-08-31 05:21:35,572 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:21:35,572 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:21:35,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:35,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:35,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:35,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:35,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:35,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:36,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:36,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:36,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:36,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:36,380 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:21:36,380 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 05:21:36,381 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:36,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:36,383 INFO L229 MonitoredProcess]: Starting monitored process 35 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) [2021-08-31 05:21:36,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-08-31 05:21:36,385 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 [2021-08-31 05:21:36,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:36,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:36,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:36,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:36,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:36,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:36,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:36,400 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:36,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2021-08-31 05:21:36,415 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:36,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:36,416 INFO L229 MonitoredProcess]: Starting monitored process 36 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) [2021-08-31 05:21:36,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-08-31 05:21:36,417 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 [2021-08-31 05:21:36,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:36,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:36,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:36,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:36,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:36,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:36,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:36,425 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:36,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-08-31 05:21:36,440 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:36,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:36,441 INFO L229 MonitoredProcess]: Starting monitored process 37 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) [2021-08-31 05:21:36,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-08-31 05:21:36,444 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 [2021-08-31 05:21:36,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:36,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:36,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:36,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:36,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:36,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:36,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:36,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:36,471 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:36,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:36,472 INFO L229 MonitoredProcess]: Starting monitored process 38 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) [2021-08-31 05:21:36,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-08-31 05:21:36,474 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 [2021-08-31 05:21:36,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:36,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:36,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:36,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:36,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:36,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:36,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:36,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:36,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-08-31 05:21:36,497 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:36,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:36,498 INFO L229 MonitoredProcess]: Starting monitored process 39 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) [2021-08-31 05:21:36,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-08-31 05:21:36,508 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 [2021-08-31 05:21:36,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:36,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:36,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:36,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:36,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:36,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:36,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:36,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:36,541 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:36,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:36,541 INFO L229 MonitoredProcess]: Starting monitored process 40 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) [2021-08-31 05:21:36,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-08-31 05:21:36,545 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 [2021-08-31 05:21:36,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:36,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:36,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:36,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:36,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:36,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:36,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:36,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2021-08-31 05:21:36,576 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:36,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:36,577 INFO L229 MonitoredProcess]: Starting monitored process 41 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) [2021-08-31 05:21:36,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-08-31 05:21:36,579 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 [2021-08-31 05:21:36,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:36,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:36,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:36,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:36,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:36,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:36,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:36,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2021-08-31 05:21:36,625 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:36,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:36,625 INFO L229 MonitoredProcess]: Starting monitored process 42 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) [2021-08-31 05:21:36,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-08-31 05:21:36,627 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 [2021-08-31 05:21:36,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:36,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:36,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:36,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:36,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:36,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:36,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:36,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:36,654 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:36,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:36,655 INFO L229 MonitoredProcess]: Starting monitored process 43 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) [2021-08-31 05:21:36,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-08-31 05:21:36,657 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 [2021-08-31 05:21:36,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:36,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:36,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:36,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:36,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:36,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:36,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:36,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-08-31 05:21:36,698 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:36,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:36,699 INFO L229 MonitoredProcess]: Starting monitored process 44 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) [2021-08-31 05:21:36,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-08-31 05:21:36,701 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 [2021-08-31 05:21:36,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:36,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:36,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:36,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:36,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:36,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:36,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:36,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-08-31 05:21:36,733 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:36,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:36,734 INFO L229 MonitoredProcess]: Starting monitored process 45 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) [2021-08-31 05:21:36,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-08-31 05:21:36,736 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 [2021-08-31 05:21:36,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:36,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:36,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:36,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:36,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:36,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:36,759 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 05:21:36,771 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-08-31 05:21:36,771 INFO L444 ModelExtractionUtils]: 2 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero. [2021-08-31 05:21:36,771 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:36,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:36,772 INFO L229 MonitoredProcess]: Starting monitored process 46 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) [2021-08-31 05:21:36,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-08-31 05:21:36,774 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 05:21:36,785 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-31 05:21:36,785 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 05:21:36,785 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 7 Supporting invariants [] [2021-08-31 05:21:36,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:36,890 INFO L297 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2021-08-31 05:21:36,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:36,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:36,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 05:21:36,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:37,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-31 05:21:37,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:21:37,194 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2021-08-31 05:21:37,194 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 79 transitions. cyclomatic complexity: 8 Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:37,311 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 79 transitions. cyclomatic complexity: 8. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) Result 156 states and 169 transitions. Complement of second has 19 states. [2021-08-31 05:21:37,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2021-08-31 05:21:37,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:37,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2021-08-31 05:21:37,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 35 transitions. Stem has 40 letters. Loop has 15 letters. [2021-08-31 05:21:37,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:21:37,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 35 transitions. Stem has 55 letters. Loop has 15 letters. [2021-08-31 05:21:37,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:21:37,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 35 transitions. Stem has 40 letters. Loop has 30 letters. [2021-08-31 05:21:37,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:21:37,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 169 transitions. [2021-08-31 05:21:37,314 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2021-08-31 05:21:37,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 106 states and 116 transitions. [2021-08-31 05:21:37,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2021-08-31 05:21:37,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2021-08-31 05:21:37,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 116 transitions. [2021-08-31 05:21:37,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:21:37,315 INFO L681 BuchiCegarLoop]: Abstraction has 106 states and 116 transitions. [2021-08-31 05:21:37,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 116 transitions. [2021-08-31 05:21:37,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2021-08-31 05:21:37,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 93 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2021-08-31 05:21:37,317 INFO L704 BuchiCegarLoop]: Abstraction has 94 states and 103 transitions. [2021-08-31 05:21:37,317 INFO L587 BuchiCegarLoop]: Abstraction has 94 states and 103 transitions. [2021-08-31 05:21:37,317 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-31 05:21:37,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 103 transitions. [2021-08-31 05:21:37,318 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-08-31 05:21:37,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:37,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:37,318 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 3, 3, 1, 1] [2021-08-31 05:21:37,318 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1, 1, 1] [2021-08-31 05:21:37,319 INFO L791 eck$LassoCheckResult]: Stem: 3809#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3810#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 3819#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 3823#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3837#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3833#L17-3 assume !(foo_~i~0 <= foo_~size); 3834#L17-4 foo_#res := foo_~i~0; 3825#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 3826#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3871#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 3870#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3869#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3868#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3867#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3866#L17-3 assume !(foo_~i~0 <= foo_~size); 3865#L17-4 foo_#res := foo_~i~0; 3864#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 3816#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3817#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 3824#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3807#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3808#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3887#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3821#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3822#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3883#L17-3 assume !(foo_~i~0 <= foo_~size); 3884#L17-4 foo_#res := foo_~i~0; 3898#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 3863#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3859#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 3856#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3855#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3854#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3853#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3852#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3851#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3850#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3849#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3847#L17-3 assume !(foo_~i~0 <= foo_~size); 3848#L17-4 foo_#res := foo_~i~0; 3830#L20 [2021-08-31 05:21:37,319 INFO L793 eck$LassoCheckResult]: Loop: 3830#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 3814#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3815#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 3832#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3805#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3806#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3820#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3846#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3845#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3844#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3843#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3842#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3841#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3840#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 3835#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 3836#L17-3 assume !(foo_~i~0 <= foo_~size); 3829#L17-4 foo_#res := foo_~i~0; 3830#L20 [2021-08-31 05:21:37,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:37,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1211447109, now seen corresponding path program 16 times [2021-08-31 05:21:37,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:37,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808090898] [2021-08-31 05:21:37,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:37,320 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:37,328 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:37,339 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:37,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:37,339 INFO L82 PathProgramCache]: Analyzing trace with hash 649532987, now seen corresponding path program 10 times [2021-08-31 05:21:37,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:37,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194340351] [2021-08-31 05:21:37,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:37,339 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:37,343 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:37,347 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:37,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:37,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1031196535, now seen corresponding path program 17 times [2021-08-31 05:21:37,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:37,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120183753] [2021-08-31 05:21:37,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:37,348 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 55 proven. 277 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-31 05:21:37,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:21:37,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120183753] [2021-08-31 05:21:37,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120183753] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:21:37,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459876038] [2021-08-31 05:21:37,420 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-31 05:21:37,420 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:21:37,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:37,421 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:21:37,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2021-08-31 05:21:37,489 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2021-08-31 05:21:37,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 05:21:37,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-31 05:21:37,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:37,710 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 64 proven. 268 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-31 05:21:37,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:21:37,827 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 59 proven. 273 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-31 05:21:37,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459876038] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:21:37,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:21:37,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 22 [2021-08-31 05:21:37,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263493785] [2021-08-31 05:21:38,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:38,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:38,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:38,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:38,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:38,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:38,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:38,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:38,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:38,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 71 [2021-08-31 05:21:38,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:21:38,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-31 05:21:38,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2021-08-31 05:21:38,266 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. cyclomatic complexity: 13 Second operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:38,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:21:38,753 INFO L93 Difference]: Finished difference Result 211 states and 227 transitions. [2021-08-31 05:21:38,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-08-31 05:21:38,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 211 states and 227 transitions. [2021-08-31 05:21:38,755 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2021-08-31 05:21:38,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 211 states to 197 states and 213 transitions. [2021-08-31 05:21:38,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2021-08-31 05:21:38,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2021-08-31 05:21:38,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 213 transitions. [2021-08-31 05:21:38,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:21:38,756 INFO L681 BuchiCegarLoop]: Abstraction has 197 states and 213 transitions. [2021-08-31 05:21:38,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 213 transitions. [2021-08-31 05:21:38,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 123. [2021-08-31 05:21:38,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.089430894308943) internal successors, (134), 122 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:38,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2021-08-31 05:21:38,758 INFO L704 BuchiCegarLoop]: Abstraction has 123 states and 134 transitions. [2021-08-31 05:21:38,758 INFO L587 BuchiCegarLoop]: Abstraction has 123 states and 134 transitions. [2021-08-31 05:21:38,758 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-31 05:21:38,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 134 transitions. [2021-08-31 05:21:38,758 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-08-31 05:21:38,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:38,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:38,759 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [14, 14, 5, 5, 5, 4, 4, 1, 1] [2021-08-31 05:21:38,759 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1, 1, 1] [2021-08-31 05:21:38,759 INFO L791 eck$LassoCheckResult]: Stem: 4551#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4552#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 4561#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 4577#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4578#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4573#L17-3 assume !(foo_~i~0 <= foo_~size); 4574#L17-4 foo_#res := foo_~i~0; 4566#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 4567#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4628#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 4629#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4623#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4624#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4619#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4620#L17-3 assume !(foo_~i~0 <= foo_~size); 4615#L17-4 foo_#res := foo_~i~0; 4616#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 4558#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4559#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 4630#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4627#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4625#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4626#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4621#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4622#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4617#L17-3 assume !(foo_~i~0 <= foo_~size); 4618#L17-4 foo_#res := foo_~i~0; 4613#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 4614#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4565#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 4563#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4564#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4655#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4654#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4653#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4652#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4651#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4650#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4649#L17-3 assume !(foo_~i~0 <= foo_~size); 4647#L17-4 foo_#res := foo_~i~0; 4648#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 4669#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4668#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 4600#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4601#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4596#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4597#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4592#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4593#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4660#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4661#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4656#L17-3 assume !(foo_~i~0 <= foo_~size); 4633#L17-4 foo_#res := foo_~i~0; 4571#L20 [2021-08-31 05:21:38,760 INFO L793 eck$LassoCheckResult]: Loop: 4571#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 4556#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4557#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 4562#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4547#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4548#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4586#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4585#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4584#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4583#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4582#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4581#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4580#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4579#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 4575#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 4576#L17-3 assume !(foo_~i~0 <= foo_~size); 4570#L17-4 foo_#res := foo_~i~0; 4571#L20 [2021-08-31 05:21:38,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:38,760 INFO L82 PathProgramCache]: Analyzing trace with hash 819802611, now seen corresponding path program 18 times [2021-08-31 05:21:38,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:38,760 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476926620] [2021-08-31 05:21:38,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:38,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 92 proven. 172 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-31 05:21:38,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:21:38,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476926620] [2021-08-31 05:21:38,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476926620] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:21:38,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244366784] [2021-08-31 05:21:38,843 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-31 05:21:38,843 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:21:38,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:38,853 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:21:38,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2021-08-31 05:21:38,916 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2021-08-31 05:21:38,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 05:21:38,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-31 05:21:38,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 138 proven. 126 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-31 05:21:39,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:21:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 138 proven. 126 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-31 05:21:39,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244366784] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:21:39,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:21:39,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2021-08-31 05:21:39,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931217144] [2021-08-31 05:21:39,167 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:21:39,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:39,168 INFO L82 PathProgramCache]: Analyzing trace with hash 649532987, now seen corresponding path program 11 times [2021-08-31 05:21:39,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:39,168 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065537495] [2021-08-31 05:21:39,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:39,168 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:39,172 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:39,176 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:39,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 65 [2021-08-31 05:21:39,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:21:39,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-31 05:21:39,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2021-08-31 05:21:39,571 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. cyclomatic complexity: 15 Second operand has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:39,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:21:39,847 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2021-08-31 05:21:39,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-31 05:21:39,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 142 transitions. [2021-08-31 05:21:39,856 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-08-31 05:21:39,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 105 states and 110 transitions. [2021-08-31 05:21:39,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-08-31 05:21:39,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-08-31 05:21:39,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 110 transitions. [2021-08-31 05:21:39,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:21:39,861 INFO L681 BuchiCegarLoop]: Abstraction has 105 states and 110 transitions. [2021-08-31 05:21:39,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 110 transitions. [2021-08-31 05:21:39,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2021-08-31 05:21:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.053763440860215) internal successors, (98), 92 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2021-08-31 05:21:39,863 INFO L704 BuchiCegarLoop]: Abstraction has 93 states and 98 transitions. [2021-08-31 05:21:39,863 INFO L587 BuchiCegarLoop]: Abstraction has 93 states and 98 transitions. [2021-08-31 05:21:39,863 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-08-31 05:21:39,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 98 transitions. [2021-08-31 05:21:39,864 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-08-31 05:21:39,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:39,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:39,868 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [15, 15, 5, 5, 5, 4, 4, 1, 1] [2021-08-31 05:21:39,868 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1, 1, 1] [2021-08-31 05:21:39,869 INFO L791 eck$LassoCheckResult]: Stem: 5178#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 5179#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 5187#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5188#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5204#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5202#L17-3 assume !(foo_~i~0 <= foo_~size); 5197#L17-4 foo_#res := foo_~i~0; 5189#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 5190#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5263#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5262#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5261#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5259#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5257#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5231#L17-3 assume !(foo_~i~0 <= foo_~size); 5232#L17-4 foo_#res := foo_~i~0; 5191#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 5182#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5183#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5186#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5173#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5174#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5260#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5258#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5235#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5236#L17-3 assume !(foo_~i~0 <= foo_~size); 5228#L17-4 foo_#res := foo_~i~0; 5229#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 5251#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5250#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5248#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5246#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5245#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5244#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5243#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5242#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5237#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5238#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5230#L17-3 assume !(foo_~i~0 <= foo_~size); 5194#L17-4 foo_#res := foo_~i~0; 5195#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 5227#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5226#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5225#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5224#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5222#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5223#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5219#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5218#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5216#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5217#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5241#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5240#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5203#L17-3 assume !(foo_~i~0 <= foo_~size); 5198#L17-4 foo_#res := foo_~i~0; 5193#L20 [2021-08-31 05:21:39,870 INFO L793 eck$LassoCheckResult]: Loop: 5193#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 5180#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5181#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5196#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5171#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5172#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5185#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5211#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5210#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5209#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5208#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5207#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5206#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5205#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5201#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5200#L17-3 assume !(foo_~i~0 <= foo_~size); 5192#L17-4 foo_#res := foo_~i~0; 5193#L20 [2021-08-31 05:21:39,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:39,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1851350261, now seen corresponding path program 19 times [2021-08-31 05:21:39,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:39,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610476334] [2021-08-31 05:21:39,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:39,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:39,887 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:39,902 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:39,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:39,903 INFO L82 PathProgramCache]: Analyzing trace with hash 649532987, now seen corresponding path program 12 times [2021-08-31 05:21:39,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:39,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034428114] [2021-08-31 05:21:39,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:39,903 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:39,906 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:39,910 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:39,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:39,910 INFO L82 PathProgramCache]: Analyzing trace with hash -573784121, now seen corresponding path program 20 times [2021-08-31 05:21:39,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:39,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434927920] [2021-08-31 05:21:39,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:39,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:39,925 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:39,945 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:40,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:40,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:40,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:40,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:40,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:40,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:40,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:40,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:40,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:40,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:40,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:40,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:40,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:40,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:40,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:40,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 85 [2021-08-31 05:21:43,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:43,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:43,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:43,838 INFO L354 Elim1Store]: treesize reduction 176, result has 10.7 percent of original size [2021-08-31 05:21:43,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 63 [2021-08-31 05:21:44,112 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:21:44,112 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:21:44,112 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:21:44,112 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:21:44,112 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:21:44,112 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:44,113 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:21:44,113 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:21:44,113 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysWithLenghtAtDeclaration.c_Iteration15_Lasso [2021-08-31 05:21:44,113 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:21:44,113 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:21:44,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:44,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:44,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:44,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:44,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:44,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:44,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:44,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:44,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:44,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:45,048 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:21:45,049 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 05:21:45,049 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:45,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:45,055 INFO L229 MonitoredProcess]: Starting monitored process 49 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) [2021-08-31 05:21:45,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-08-31 05:21:45,057 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 [2021-08-31 05:21:45,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:45,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:45,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:45,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:45,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:45,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:45,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:45,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:45,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:45,082 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:45,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:45,082 INFO L229 MonitoredProcess]: Starting monitored process 50 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) [2021-08-31 05:21:45,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-08-31 05:21:45,084 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 [2021-08-31 05:21:45,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:45,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:45,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:45,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:45,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:45,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:45,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:45,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:45,108 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:45,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:45,109 INFO L229 MonitoredProcess]: Starting monitored process 51 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) [2021-08-31 05:21:45,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-08-31 05:21:45,111 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 [2021-08-31 05:21:45,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:45,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:45,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:45,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:45,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:45,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:45,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:45,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:45,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-08-31 05:21:45,148 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:45,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:45,148 INFO L229 MonitoredProcess]: Starting monitored process 52 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) [2021-08-31 05:21:45,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-08-31 05:21:45,150 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 [2021-08-31 05:21:45,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:45,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:45,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:45,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:45,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:45,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:45,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:45,158 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:45,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:45,175 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:45,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:45,175 INFO L229 MonitoredProcess]: Starting monitored process 53 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) [2021-08-31 05:21:45,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-08-31 05:21:45,177 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 [2021-08-31 05:21:45,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:45,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:45,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:45,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:45,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:45,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:45,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:45,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:45,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:45,202 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:45,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:45,203 INFO L229 MonitoredProcess]: Starting monitored process 54 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) [2021-08-31 05:21:45,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-08-31 05:21:45,206 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 [2021-08-31 05:21:45,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:45,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:45,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:45,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:45,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:45,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:45,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:45,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:45,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2021-08-31 05:21:45,233 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:45,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:45,234 INFO L229 MonitoredProcess]: Starting monitored process 55 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) [2021-08-31 05:21:45,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-08-31 05:21:45,236 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 [2021-08-31 05:21:45,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:45,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:45,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:45,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:45,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:45,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:45,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:45,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:45,262 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:45,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:45,263 INFO L229 MonitoredProcess]: Starting monitored process 56 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) [2021-08-31 05:21:45,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-08-31 05:21:45,265 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 [2021-08-31 05:21:45,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:45,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:45,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:45,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:45,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:45,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:45,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:45,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2021-08-31 05:21:45,294 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:45,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:45,294 INFO L229 MonitoredProcess]: Starting monitored process 57 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) [2021-08-31 05:21:45,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-08-31 05:21:45,296 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 [2021-08-31 05:21:45,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:45,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:45,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:45,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:45,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:45,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:45,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:45,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2021-08-31 05:21:45,351 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:45,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:45,352 INFO L229 MonitoredProcess]: Starting monitored process 58 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) [2021-08-31 05:21:45,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-08-31 05:21:45,355 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 [2021-08-31 05:21:45,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:45,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:45,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:45,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:45,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:45,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:45,384 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 05:21:45,401 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-08-31 05:21:45,401 INFO L444 ModelExtractionUtils]: 6 out of 40 variables were initially zero. Simplification set additionally 31 variables to zero. [2021-08-31 05:21:45,401 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:45,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:45,405 INFO L229 MonitoredProcess]: Starting monitored process 59 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) [2021-08-31 05:21:45,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-08-31 05:21:45,406 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 05:21:45,413 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-31 05:21:45,413 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 05:21:45,413 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_foo_~b.base)_5) = -4*ULTIMATE.start_main_~i~1 + 3*v_rep(select #length ULTIMATE.start_foo_~b.base)_5 Supporting invariants [] [2021-08-31 05:21:45,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2021-08-31 05:21:45,566 INFO L297 tatePredicateManager]: 51 out of 52 supporting invariants were superfluous and have been removed [2021-08-31 05:21:45,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:45,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 05:21:45,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:45,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-31 05:21:45,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:46,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:46,099 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:21:46,099 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 13 loop predicates [2021-08-31 05:21:46,099 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 98 transitions. cyclomatic complexity: 8 Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 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) [2021-08-31 05:21:46,614 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 98 transitions. cyclomatic complexity: 8. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 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) Result 193 states and 206 transitions. Complement of second has 34 states. [2021-08-31 05:21:46,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 2 stem states 15 non-accepting loop states 1 accepting loop states [2021-08-31 05:21:46,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 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) [2021-08-31 05:21:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 38 transitions. [2021-08-31 05:21:46,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 38 transitions. Stem has 55 letters. Loop has 17 letters. [2021-08-31 05:21:46,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:21:46,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 38 transitions. Stem has 72 letters. Loop has 17 letters. [2021-08-31 05:21:46,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:21:46,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 38 transitions. Stem has 55 letters. Loop has 34 letters. [2021-08-31 05:21:46,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:21:46,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 206 transitions. [2021-08-31 05:21:46,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2021-08-31 05:21:46,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 127 states and 137 transitions. [2021-08-31 05:21:46,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-08-31 05:21:46,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2021-08-31 05:21:46,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 137 transitions. [2021-08-31 05:21:46,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:21:46,618 INFO L681 BuchiCegarLoop]: Abstraction has 127 states and 137 transitions. [2021-08-31 05:21:46,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 137 transitions. [2021-08-31 05:21:46,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2021-08-31 05:21:46,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 1.0782608695652174) internal successors, (124), 114 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:46,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2021-08-31 05:21:46,620 INFO L704 BuchiCegarLoop]: Abstraction has 115 states and 124 transitions. [2021-08-31 05:21:46,620 INFO L587 BuchiCegarLoop]: Abstraction has 115 states and 124 transitions. [2021-08-31 05:21:46,620 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-08-31 05:21:46,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 124 transitions. [2021-08-31 05:21:46,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2021-08-31 05:21:46,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:46,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:46,621 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [15, 15, 5, 5, 5, 4, 4, 1, 1] [2021-08-31 05:21:46,621 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 1, 1, 1, 1, 1] [2021-08-31 05:21:46,621 INFO L791 eck$LassoCheckResult]: Stem: 5981#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 5982#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 5990#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5995#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6007#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6006#L17-3 assume !(foo_~i~0 <= foo_~size); 5997#L17-4 foo_#res := foo_~i~0; 5991#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 5992#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6059#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 6056#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6055#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6054#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6053#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6052#L17-3 assume !(foo_~i~0 <= foo_~size); 6051#L17-4 foo_#res := foo_~i~0; 6049#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 6050#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6061#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 6060#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6057#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6058#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6067#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6066#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6065#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6064#L17-3 assume !(foo_~i~0 <= foo_~size); 6063#L17-4 foo_#res := foo_~i~0; 6062#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 5985#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5986#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5996#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6074#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6072#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6073#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6075#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5976#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5977#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5989#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6068#L17-3 assume !(foo_~i~0 <= foo_~size); 6069#L17-4 foo_#res := foo_~i~0; 6088#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 6035#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6031#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 6028#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6027#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6026#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6025#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6024#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6023#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6022#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6021#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6020#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6019#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6008#L17-3 assume !(foo_~i~0 <= foo_~size); 6009#L17-4 foo_#res := foo_~i~0; 6003#L20 [2021-08-31 05:21:46,621 INFO L793 eck$LassoCheckResult]: Loop: 6003#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 5983#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5984#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 5999#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5974#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 5975#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 5988#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6018#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6017#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6016#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6015#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6014#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6013#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6012#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6011#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6010#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6002#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6000#L17-3 assume !(foo_~i~0 <= foo_~size); 6001#L17-4 foo_#res := foo_~i~0; 6003#L20 [2021-08-31 05:21:46,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:46,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1851350261, now seen corresponding path program 21 times [2021-08-31 05:21:46,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:46,622 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624419567] [2021-08-31 05:21:46,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:46,622 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:46,642 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:46,657 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:46,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:46,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1430998845, now seen corresponding path program 13 times [2021-08-31 05:21:46,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:46,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485943314] [2021-08-31 05:21:46,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:46,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:46,662 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:46,666 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:46,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:46,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1650670135, now seen corresponding path program 22 times [2021-08-31 05:21:46,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:46,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41815433] [2021-08-31 05:21:46,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:46,667 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:46,760 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 78 proven. 526 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-08-31 05:21:46,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:21:46,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41815433] [2021-08-31 05:21:46,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41815433] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:21:46,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56289114] [2021-08-31 05:21:46,761 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-31 05:21:46,761 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:21:46,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:46,762 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:21:46,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2021-08-31 05:21:46,840 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-31 05:21:46,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 05:21:46,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-31 05:21:46,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:47,080 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 89 proven. 515 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-08-31 05:21:47,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:21:47,211 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 89 proven. 515 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-08-31 05:21:47,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56289114] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:21:47,211 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:21:47,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2021-08-31 05:21:47,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559088041] [2021-08-31 05:21:47,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 76 [2021-08-31 05:21:47,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:21:47,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-31 05:21:47,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2021-08-31 05:21:47,736 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. cyclomatic complexity: 13 Second operand has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 24 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:48,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:21:48,363 INFO L93 Difference]: Finished difference Result 247 states and 263 transitions. [2021-08-31 05:21:48,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-08-31 05:21:48,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 247 states and 263 transitions. [2021-08-31 05:21:48,365 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2021-08-31 05:21:48,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 247 states to 231 states and 247 transitions. [2021-08-31 05:21:48,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2021-08-31 05:21:48,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2021-08-31 05:21:48,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 231 states and 247 transitions. [2021-08-31 05:21:48,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:21:48,366 INFO L681 BuchiCegarLoop]: Abstraction has 231 states and 247 transitions. [2021-08-31 05:21:48,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states and 247 transitions. [2021-08-31 05:21:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 148. [2021-08-31 05:21:48,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 148 states have (on average 1.0743243243243243) internal successors, (159), 147 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2021-08-31 05:21:48,369 INFO L704 BuchiCegarLoop]: Abstraction has 148 states and 159 transitions. [2021-08-31 05:21:48,369 INFO L587 BuchiCegarLoop]: Abstraction has 148 states and 159 transitions. [2021-08-31 05:21:48,369 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-08-31 05:21:48,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 159 transitions. [2021-08-31 05:21:48,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2021-08-31 05:21:48,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:48,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:48,371 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [20, 20, 6, 6, 6, 5, 5, 1, 1] [2021-08-31 05:21:48,372 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 1, 1, 1, 1, 1] [2021-08-31 05:21:48,372 INFO L791 eck$LassoCheckResult]: Stem: 6906#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 6907#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 6915#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 6929#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6930#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6925#L17-3 assume !(foo_~i~0 <= foo_~size); 6926#L17-4 foo_#res := foo_~i~0; 6916#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 6917#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 7046#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 7045#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7044#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7042#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7041#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7040#L17-3 assume !(foo_~i~0 <= foo_~size); 7039#L17-4 foo_#res := foo_~i~0; 6918#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 6910#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6911#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 6920#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6901#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6902#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6914#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7043#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6991#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6990#L17-3 assume !(foo_~i~0 <= foo_~size); 6987#L17-4 foo_#res := foo_~i~0; 6988#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 7038#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 7037#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 7036#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7035#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7034#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7033#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7032#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7031#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7012#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7009#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7008#L17-3 assume !(foo_~i~0 <= foo_~size); 7007#L17-4 foo_#res := foo_~i~0; 7006#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 7005#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 7004#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 7003#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7002#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7001#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7000#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6999#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6998#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6997#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6996#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6994#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6995#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7028#L17-3 assume !(foo_~i~0 <= foo_~size); 7026#L17-4 foo_#res := foo_~i~0; 7025#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 7024#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 7023#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 7022#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7021#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7020#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7019#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7018#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7017#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7016#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7015#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7014#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7013#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6941#L17-3 assume !(foo_~i~0 <= foo_~size); 6942#L17-4 foo_#res := foo_~i~0; 6922#L20 [2021-08-31 05:21:48,373 INFO L793 eck$LassoCheckResult]: Loop: 6922#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 6908#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6909#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 6919#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6899#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6900#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6913#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6939#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6938#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6937#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6936#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6935#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6934#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6933#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6932#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6931#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 6927#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 6928#L17-3 assume !(foo_~i~0 <= foo_~size); 6921#L17-4 foo_#res := foo_~i~0; 6922#L20 [2021-08-31 05:21:48,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:48,373 INFO L82 PathProgramCache]: Analyzing trace with hash -451993275, now seen corresponding path program 23 times [2021-08-31 05:21:48,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:48,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956967988] [2021-08-31 05:21:48,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:48,374 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 223 proven. 287 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-08-31 05:21:48,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:21:48,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956967988] [2021-08-31 05:21:48,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956967988] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:21:48,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628398538] [2021-08-31 05:21:48,476 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-31 05:21:48,476 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:21:48,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:48,481 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:21:48,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2021-08-31 05:21:48,563 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2021-08-31 05:21:48,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 05:21:48,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-31 05:21:48,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:48,792 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 265 proven. 248 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-08-31 05:21:48,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:21:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 309 proven. 204 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-08-31 05:21:48,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628398538] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:21:48,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:21:48,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 27 [2021-08-31 05:21:48,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929780849] [2021-08-31 05:21:48,962 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:21:48,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:48,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1430998845, now seen corresponding path program 14 times [2021-08-31 05:21:48,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:48,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464024757] [2021-08-31 05:21:48,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:48,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:48,966 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:48,971 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:49,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:49,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 99 [2021-08-31 05:21:49,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:21:49,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-31 05:21:49,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2021-08-31 05:21:49,580 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. cyclomatic complexity: 15 Second operand has 27 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:50,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:21:50,115 INFO L93 Difference]: Finished difference Result 163 states and 170 transitions. [2021-08-31 05:21:50,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-08-31 05:21:50,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 170 transitions. [2021-08-31 05:21:50,117 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2021-08-31 05:21:50,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 129 states and 134 transitions. [2021-08-31 05:21:50,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2021-08-31 05:21:50,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2021-08-31 05:21:50,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 134 transitions. [2021-08-31 05:21:50,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:21:50,118 INFO L681 BuchiCegarLoop]: Abstraction has 129 states and 134 transitions. [2021-08-31 05:21:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 134 transitions. [2021-08-31 05:21:50,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 114. [2021-08-31 05:21:50,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 114 states have (on average 1.043859649122807) internal successors, (119), 113 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2021-08-31 05:21:50,120 INFO L704 BuchiCegarLoop]: Abstraction has 114 states and 119 transitions. [2021-08-31 05:21:50,120 INFO L587 BuchiCegarLoop]: Abstraction has 114 states and 119 transitions. [2021-08-31 05:21:50,120 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-08-31 05:21:50,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 119 transitions. [2021-08-31 05:21:50,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2021-08-31 05:21:50,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:50,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:50,121 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [21, 21, 6, 6, 6, 5, 5, 1, 1] [2021-08-31 05:21:50,121 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 1, 1, 1, 1, 1] [2021-08-31 05:21:50,121 INFO L791 eck$LassoCheckResult]: Stem: 7718#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7719#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 7727#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 7728#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7744#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7742#L17-3 assume !(foo_~i~0 <= foo_~size); 7737#L17-4 foo_#res := foo_~i~0; 7730#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 7722#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 7723#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 7824#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7822#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7820#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7818#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7816#L17-3 assume !(foo_~i~0 <= foo_~size); 7735#L17-4 foo_#res := foo_~i~0; 7731#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 7732#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 7729#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 7726#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7713#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7714#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7823#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7821#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7819#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7817#L17-3 assume !(foo_~i~0 <= foo_~size); 7815#L17-4 foo_#res := foo_~i~0; 7814#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 7813#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 7812#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 7811#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7810#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7808#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7807#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7806#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7804#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7803#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7802#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7800#L17-3 assume !(foo_~i~0 <= foo_~size); 7799#L17-4 foo_#res := foo_~i~0; 7798#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 7796#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 7795#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 7794#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7792#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7791#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7790#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7788#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7787#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7786#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7783#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7781#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7782#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7777#L17-3 assume !(foo_~i~0 <= foo_~size); 7775#L17-4 foo_#res := foo_~i~0; 7776#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 7809#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 7772#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 7770#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7771#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7801#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7766#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7764#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7765#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7793#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7760#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7758#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7759#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7785#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7784#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7743#L17-3 assume !(foo_~i~0 <= foo_~size); 7738#L17-4 foo_#res := foo_~i~0; 7734#L20 [2021-08-31 05:21:50,121 INFO L793 eck$LassoCheckResult]: Loop: 7734#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 7720#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 7721#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 7736#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7711#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7712#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7725#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7753#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7752#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7751#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7750#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7749#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7748#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7747#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7746#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7745#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 7741#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 7740#L17-3 assume !(foo_~i~0 <= foo_~size); 7733#L17-4 foo_#res := foo_~i~0; 7734#L20 [2021-08-31 05:21:50,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:50,122 INFO L82 PathProgramCache]: Analyzing trace with hash -573784121, now seen corresponding path program 24 times [2021-08-31 05:21:50,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:50,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286854600] [2021-08-31 05:21:50,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:50,122 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:50,136 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:50,174 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:50,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:50,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1430998845, now seen corresponding path program 15 times [2021-08-31 05:21:50,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:50,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497549682] [2021-08-31 05:21:50,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:50,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:50,179 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:50,183 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:50,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:50,184 INFO L82 PathProgramCache]: Analyzing trace with hash 303824311, now seen corresponding path program 25 times [2021-08-31 05:21:50,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:50,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484333119] [2021-08-31 05:21:50,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:50,184 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:50,202 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:50,227 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:50,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:50,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:50,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:50,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:50,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:50,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:50,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:50,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:50,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:50,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:50,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:50,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 82 [2021-08-31 05:21:56,562 WARN L210 SmtUtils]: Spent 5.80s on a formula simplification. DAG size of input: 560 DAG size of output: 373 [2021-08-31 05:21:56,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:56,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:56,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:56,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:56,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:56,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:56,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:56,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:56,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:56,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:56,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:56,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:21:56,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 74 [2021-08-31 05:21:57,057 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:21:57,057 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:21:57,057 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:21:57,057 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:21:57,057 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:21:57,057 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:57,057 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:21:57,057 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:21:57,057 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysWithLenghtAtDeclaration.c_Iteration18_Lasso [2021-08-31 05:21:57,057 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:21:57,057 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:21:57,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:57,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:57,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:57,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:57,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:57,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:57,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:57,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:57,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:57,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:21:58,021 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:21:58,021 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 05:21:58,021 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:58,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:58,022 INFO L229 MonitoredProcess]: Starting monitored process 62 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) [2021-08-31 05:21:58,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-08-31 05:21:58,025 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 [2021-08-31 05:21:58,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:58,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:58,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:58,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:58,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:58,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:58,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:58,032 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:58,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2021-08-31 05:21:58,047 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:58,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:58,047 INFO L229 MonitoredProcess]: Starting monitored process 63 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) [2021-08-31 05:21:58,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-08-31 05:21:58,049 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 [2021-08-31 05:21:58,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:58,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:58,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:58,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:58,055 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:58,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:58,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:58,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:58,072 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:58,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:58,073 INFO L229 MonitoredProcess]: Starting monitored process 64 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) [2021-08-31 05:21:58,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-08-31 05:21:58,074 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 [2021-08-31 05:21:58,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:58,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:58,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:58,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:58,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:58,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:58,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:58,082 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:58,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2021-08-31 05:21:58,096 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:58,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:58,097 INFO L229 MonitoredProcess]: Starting monitored process 65 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) [2021-08-31 05:21:58,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-08-31 05:21:58,099 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 [2021-08-31 05:21:58,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:58,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:58,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:58,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:58,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:58,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:58,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:58,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:58,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:58,121 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:58,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:58,121 INFO L229 MonitoredProcess]: Starting monitored process 66 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) [2021-08-31 05:21:58,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-08-31 05:21:58,123 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 [2021-08-31 05:21:58,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:58,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:58,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:58,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:58,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:58,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:58,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:58,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2021-08-31 05:21:58,147 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:58,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:58,148 INFO L229 MonitoredProcess]: Starting monitored process 67 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) [2021-08-31 05:21:58,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2021-08-31 05:21:58,149 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 [2021-08-31 05:21:58,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:58,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:58,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:58,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:58,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:58,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:58,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:58,156 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:58,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2021-08-31 05:21:58,171 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:58,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:58,172 INFO L229 MonitoredProcess]: Starting monitored process 68 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) [2021-08-31 05:21:58,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-08-31 05:21:58,175 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 [2021-08-31 05:21:58,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:58,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:58,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:58,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:58,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:58,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:58,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:58,182 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:58,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2021-08-31 05:21:58,197 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:58,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:58,198 INFO L229 MonitoredProcess]: Starting monitored process 69 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) [2021-08-31 05:21:58,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-08-31 05:21:58,201 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 [2021-08-31 05:21:58,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:58,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:58,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:58,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:58,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:58,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:58,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:58,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:58,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:58,231 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:58,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:58,231 INFO L229 MonitoredProcess]: Starting monitored process 70 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) [2021-08-31 05:21:58,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-08-31 05:21:58,233 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 [2021-08-31 05:21:58,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:58,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:58,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:58,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:58,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:58,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:58,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:58,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:58,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2021-08-31 05:21:58,282 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:58,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:58,283 INFO L229 MonitoredProcess]: Starting monitored process 71 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) [2021-08-31 05:21:58,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-08-31 05:21:58,285 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 [2021-08-31 05:21:58,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:58,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:21:58,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:58,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:58,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:58,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:21:58,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:21:58,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:58,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2021-08-31 05:21:58,307 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:58,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:58,308 INFO L229 MonitoredProcess]: Starting monitored process 72 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) [2021-08-31 05:21:58,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-08-31 05:21:58,310 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 [2021-08-31 05:21:58,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:58,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:58,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:58,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:58,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:58,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:58,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:58,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2021-08-31 05:21:58,338 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:58,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:58,339 INFO L229 MonitoredProcess]: Starting monitored process 73 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) [2021-08-31 05:21:58,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-08-31 05:21:58,340 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 [2021-08-31 05:21:58,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:58,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:58,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:58,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:58,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:58,349 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:58,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:58,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2021-08-31 05:21:58,374 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:58,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:58,374 INFO L229 MonitoredProcess]: Starting monitored process 74 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) [2021-08-31 05:21:58,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-08-31 05:21:58,376 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 [2021-08-31 05:21:58,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:58,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:58,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:58,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:58,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:58,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:58,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:58,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2021-08-31 05:21:58,400 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:58,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:58,401 INFO L229 MonitoredProcess]: Starting monitored process 75 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) [2021-08-31 05:21:58,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-08-31 05:21:58,402 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 [2021-08-31 05:21:58,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:58,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:58,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:58,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:58,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:58,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:58,412 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:58,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2021-08-31 05:21:58,427 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:58,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:58,427 INFO L229 MonitoredProcess]: Starting monitored process 76 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) [2021-08-31 05:21:58,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-08-31 05:21:58,429 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 [2021-08-31 05:21:58,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:58,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:58,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:58,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:58,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:58,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:58,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:21:58,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2021-08-31 05:21:58,461 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:58,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:58,462 INFO L229 MonitoredProcess]: Starting monitored process 77 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) [2021-08-31 05:21:58,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-08-31 05:21:58,496 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 [2021-08-31 05:21:58,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:21:58,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:21:58,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:21:58,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:21:58,510 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:21:58,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:21:58,524 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 05:21:58,551 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2021-08-31 05:21:58,551 INFO L444 ModelExtractionUtils]: 3 out of 40 variables were initially zero. Simplification set additionally 34 variables to zero. [2021-08-31 05:21:58,551 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:21:58,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:58,552 INFO L229 MonitoredProcess]: Starting monitored process 78 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) [2021-08-31 05:21:58,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-08-31 05:21:58,553 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 05:21:58,561 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-31 05:21:58,561 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 05:21:58,561 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#b~0.base)_6, ULTIMATE.start_main_~i~1) = 11*v_rep(select #length ULTIMATE.start_main_~#b~0.base)_6 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2021-08-31 05:21:58,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2021-08-31 05:21:58,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2021-08-31 05:21:58,705 INFO L297 tatePredicateManager]: 45 out of 45 supporting invariants were superfluous and have been removed [2021-08-31 05:21:58,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:58,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 05:21:58,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:58,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-31 05:21:58,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:21:59,155 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 12 loop predicates [2021-08-31 05:21:59,155 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114 states and 119 transitions. cyclomatic complexity: 8 Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:59,324 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114 states and 119 transitions. cyclomatic complexity: 8. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 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 234 states and 247 transitions. Complement of second has 25 states. [2021-08-31 05:21:59,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2021-08-31 05:21:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:59,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 41 transitions. [2021-08-31 05:21:59,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 41 transitions. Stem has 72 letters. Loop has 19 letters. [2021-08-31 05:21:59,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:21:59,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 41 transitions. Stem has 91 letters. Loop has 19 letters. [2021-08-31 05:21:59,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:21:59,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 41 transitions. Stem has 72 letters. Loop has 38 letters. [2021-08-31 05:21:59,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:21:59,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 234 states and 247 transitions. [2021-08-31 05:21:59,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2021-08-31 05:21:59,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 234 states to 150 states and 160 transitions. [2021-08-31 05:21:59,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2021-08-31 05:21:59,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-08-31 05:21:59,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 160 transitions. [2021-08-31 05:21:59,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:21:59,328 INFO L681 BuchiCegarLoop]: Abstraction has 150 states and 160 transitions. [2021-08-31 05:21:59,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 160 transitions. [2021-08-31 05:21:59,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2021-08-31 05:21:59,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 1.065217391304348) internal successors, (147), 137 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:21:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions. [2021-08-31 05:21:59,330 INFO L704 BuchiCegarLoop]: Abstraction has 138 states and 147 transitions. [2021-08-31 05:21:59,330 INFO L587 BuchiCegarLoop]: Abstraction has 138 states and 147 transitions. [2021-08-31 05:21:59,330 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-08-31 05:21:59,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 147 transitions. [2021-08-31 05:21:59,331 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2021-08-31 05:21:59,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:21:59,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:21:59,332 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [21, 21, 6, 6, 6, 5, 5, 1, 1] [2021-08-31 05:21:59,332 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 1, 1, 1, 1, 1] [2021-08-31 05:21:59,332 INFO L791 eck$LassoCheckResult]: Stem: 8580#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8581#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 8590#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8594#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8606#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8599#L17-3 assume !(foo_~i~0 <= foo_~size); 8596#L17-4 foo_#res := foo_~i~0; 8591#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 8592#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 8669#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8670#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8688#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8686#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8684#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8682#L17-3 assume !(foo_~i~0 <= foo_~size); 8680#L17-4 foo_#res := foo_~i~0; 8678#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 8676#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 8673#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8674#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8692#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8691#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8690#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8689#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8687#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8685#L17-3 assume !(foo_~i~0 <= foo_~size); 8683#L17-4 foo_#res := foo_~i~0; 8681#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 8679#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 8677#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8675#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8672#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8671#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8668#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8667#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8666#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8665#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8662#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8661#L17-3 assume !(foo_~i~0 <= foo_~size); 8597#L17-4 foo_#res := foo_~i~0; 8593#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 8584#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 8585#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8595#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8575#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8576#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8700#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8699#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8697#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8696#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8694#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8588#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8589#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8659#L17-3 assume !(foo_~i~0 <= foo_~size); 8660#L17-4 foo_#res := foo_~i~0; 8710#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 8709#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 8708#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8707#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8706#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8705#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8704#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8703#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8702#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8701#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8625#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8626#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8698#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8621#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8620#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8607#L17-3 assume !(foo_~i~0 <= foo_~size); 8608#L17-4 foo_#res := foo_~i~0; 8600#L20 [2021-08-31 05:21:59,332 INFO L793 eck$LassoCheckResult]: Loop: 8600#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 8582#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 8583#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 8598#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8573#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8574#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8587#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8619#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8618#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8617#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8616#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8615#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8614#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8613#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8612#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8611#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8610#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8609#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 8604#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 8605#L17-3 assume !(foo_~i~0 <= foo_~size); 8603#L17-4 foo_#res := foo_~i~0; 8600#L20 [2021-08-31 05:21:59,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:59,332 INFO L82 PathProgramCache]: Analyzing trace with hash -573784121, now seen corresponding path program 26 times [2021-08-31 05:21:59,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:59,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760813315] [2021-08-31 05:21:59,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:59,333 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:59,346 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:59,366 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:59,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:59,366 INFO L82 PathProgramCache]: Analyzing trace with hash 800411583, now seen corresponding path program 16 times [2021-08-31 05:21:59,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:59,367 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521865324] [2021-08-31 05:21:59,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:59,367 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:59,371 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:21:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:21:59,376 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:59,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:21:59,376 INFO L82 PathProgramCache]: Analyzing trace with hash -82556999, now seen corresponding path program 27 times [2021-08-31 05:21:59,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:21:59,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954945296] [2021-08-31 05:21:59,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:21:59,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:21:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:21:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 105 proven. 912 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-08-31 05:21:59,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:21:59,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954945296] [2021-08-31 05:21:59,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954945296] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:21:59,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520161904] [2021-08-31 05:21:59,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-31 05:21:59,514 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:21:59,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:21:59,520 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:21:59,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2021-08-31 05:21:59,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2021-08-31 05:21:59,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 05:21:59,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-31 05:21:59,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:21:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 118 proven. 899 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-08-31 05:21:59,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:22:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 118 proven. 899 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-08-31 05:22:00,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520161904] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:22:00,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:22:00,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2021-08-31 05:22:00,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278411038] [2021-08-31 05:22:00,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 87 [2021-08-31 05:22:00,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:22:00,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-31 05:22:00,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2021-08-31 05:22:00,766 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. cyclomatic complexity: 13 Second operand has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:22:01,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:22:01,568 INFO L93 Difference]: Finished difference Result 285 states and 301 transitions. [2021-08-31 05:22:01,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-08-31 05:22:01,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 301 transitions. [2021-08-31 05:22:01,570 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2021-08-31 05:22:01,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 267 states and 283 transitions. [2021-08-31 05:22:01,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 110 [2021-08-31 05:22:01,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2021-08-31 05:22:01,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 267 states and 283 transitions. [2021-08-31 05:22:01,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:22:01,571 INFO L681 BuchiCegarLoop]: Abstraction has 267 states and 283 transitions. [2021-08-31 05:22:01,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states and 283 transitions. [2021-08-31 05:22:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 175. [2021-08-31 05:22:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 175 states have (on average 1.062857142857143) internal successors, (186), 174 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:22:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 186 transitions. [2021-08-31 05:22:01,573 INFO L704 BuchiCegarLoop]: Abstraction has 175 states and 186 transitions. [2021-08-31 05:22:01,573 INFO L587 BuchiCegarLoop]: Abstraction has 175 states and 186 transitions. [2021-08-31 05:22:01,573 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-08-31 05:22:01,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 186 transitions. [2021-08-31 05:22:01,574 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2021-08-31 05:22:01,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:22:01,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:22:01,574 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [27, 27, 7, 7, 7, 6, 6, 1, 1] [2021-08-31 05:22:01,574 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 1, 1, 1, 1, 1] [2021-08-31 05:22:01,574 INFO L791 eck$LassoCheckResult]: Stem: 9704#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9705#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 9714#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 9729#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9730#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9725#L17-3 assume !(foo_~i~0 <= foo_~size); 9726#L17-4 foo_#res := foo_~i~0; 9719#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 9711#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 9712#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 9870#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9868#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9866#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9864#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9862#L17-3 assume !(foo_~i~0 <= foo_~size); 9860#L17-4 foo_#res := foo_~i~0; 9720#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 9721#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 9717#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 9718#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9872#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9871#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9869#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9867#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9865#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9863#L17-3 assume !(foo_~i~0 <= foo_~size); 9861#L17-4 foo_#res := foo_~i~0; 9859#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 9858#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 9857#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 9856#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9855#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9854#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9853#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9852#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9851#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9850#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9849#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9848#L17-3 assume !(foo_~i~0 <= foo_~size); 9847#L17-4 foo_#res := foo_~i~0; 9846#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 9845#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 9844#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 9843#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9842#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9841#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9840#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9839#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9838#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9837#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9836#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9834#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9831#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9829#L17-3 assume !(foo_~i~0 <= foo_~size); 9827#L17-4 foo_#res := foo_~i~0; 9825#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 9824#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 9823#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 9822#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9821#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9820#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9819#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9818#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9817#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9816#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9815#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9812#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9811#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9809#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9810#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9835#L17-3 assume !(foo_~i~0 <= foo_~size); 9832#L17-4 foo_#res := foo_~i~0; 9830#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 9828#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 9826#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 9769#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9770#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9765#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9766#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9761#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9762#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9757#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9758#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9753#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9754#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9814#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9813#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9744#L17-3 assume !(foo_~i~0 <= foo_~size); 9745#L17-4 foo_#res := foo_~i~0; 9723#L20 [2021-08-31 05:22:01,574 INFO L793 eck$LassoCheckResult]: Loop: 9723#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 9709#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 9710#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 9715#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9700#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9701#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9742#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9741#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9740#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9739#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9738#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9737#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9736#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9735#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9734#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9733#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9732#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9731#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 9727#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 9728#L17-3 assume !(foo_~i~0 <= foo_~size); 9722#L17-4 foo_#res := foo_~i~0; 9723#L20 [2021-08-31 05:22:01,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:22:01,575 INFO L82 PathProgramCache]: Analyzing trace with hash -84600011, now seen corresponding path program 28 times [2021-08-31 05:22:01,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:22:01,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147875350] [2021-08-31 05:22:01,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:22:01,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:22:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:22:01,699 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 451 proven. 442 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-08-31 05:22:01,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:22:01,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147875350] [2021-08-31 05:22:01,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147875350] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:22:01,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7453278] [2021-08-31 05:22:01,699 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-31 05:22:01,699 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:22:01,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:22:01,700 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:22:01,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2021-08-31 05:22:01,773 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-31 05:22:01,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 05:22:01,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-31 05:22:01,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:22:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 542 proven. 351 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-08-31 05:22:02,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:22:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 542 proven. 351 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-08-31 05:22:02,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7453278] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:22:02,188 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:22:02,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 25 [2021-08-31 05:22:02,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939392473] [2021-08-31 05:22:02,188 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:22:02,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:22:02,189 INFO L82 PathProgramCache]: Analyzing trace with hash 800411583, now seen corresponding path program 17 times [2021-08-31 05:22:02,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:22:02,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456027752] [2021-08-31 05:22:02,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:22:02,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:22:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:22:02,193 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:22:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:22:02,197 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:22:02,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:02,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 113 [2021-08-31 05:22:02,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:22:02,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-31 05:22:02,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2021-08-31 05:22:02,775 INFO L87 Difference]: Start difference. First operand 175 states and 186 transitions. cyclomatic complexity: 15 Second operand has 25 states, 25 states have (on average 3.36) internal successors, (84), 25 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:22:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:22:03,182 INFO L93 Difference]: Finished difference Result 193 states and 200 transitions. [2021-08-31 05:22:03,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-31 05:22:03,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 200 transitions. [2021-08-31 05:22:03,183 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2021-08-31 05:22:03,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 155 states and 160 transitions. [2021-08-31 05:22:03,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2021-08-31 05:22:03,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2021-08-31 05:22:03,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 160 transitions. [2021-08-31 05:22:03,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:22:03,184 INFO L681 BuchiCegarLoop]: Abstraction has 155 states and 160 transitions. [2021-08-31 05:22:03,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 160 transitions. [2021-08-31 05:22:03,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 137. [2021-08-31 05:22:03,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 136 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:22:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 142 transitions. [2021-08-31 05:22:03,186 INFO L704 BuchiCegarLoop]: Abstraction has 137 states and 142 transitions. [2021-08-31 05:22:03,186 INFO L587 BuchiCegarLoop]: Abstraction has 137 states and 142 transitions. [2021-08-31 05:22:03,186 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-08-31 05:22:03,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 142 transitions. [2021-08-31 05:22:03,187 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2021-08-31 05:22:03,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:22:03,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:22:03,188 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [28, 28, 7, 7, 7, 6, 6, 1, 1] [2021-08-31 05:22:03,188 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 1, 1, 1, 1, 1] [2021-08-31 05:22:03,188 INFO L791 eck$LassoCheckResult]: Stem: 10689#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10690#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 10698#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 10702#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10716#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10714#L17-3 assume !(foo_~i~0 <= foo_~size); 10709#L17-4 foo_#res := foo_~i~0; 10699#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 10693#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 10694#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 10818#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10816#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10814#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10812#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10810#L17-3 assume !(foo_~i~0 <= foo_~size); 10809#L17-4 foo_#res := foo_~i~0; 10700#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 10701#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 10703#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 10697#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10684#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10685#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10817#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10815#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10813#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10811#L17-3 assume !(foo_~i~0 <= foo_~size); 10706#L17-4 foo_#res := foo_~i~0; 10707#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 10808#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 10807#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 10806#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10805#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10804#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10803#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10802#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10801#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10800#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10799#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10798#L17-3 assume !(foo_~i~0 <= foo_~size); 10797#L17-4 foo_#res := foo_~i~0; 10796#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 10795#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 10794#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 10793#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10792#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10791#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10790#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10788#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10787#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10786#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10784#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10783#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10782#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10780#L17-3 assume !(foo_~i~0 <= foo_~size); 10779#L17-4 foo_#res := foo_~i~0; 10778#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 10776#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 10775#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 10774#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10772#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10771#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10770#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10768#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10767#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10766#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10764#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10763#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10762#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10758#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10759#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10754#L17-3 assume !(foo_~i~0 <= foo_~size); 10755#L17-4 foo_#res := foo_~i~0; 10752#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 10750#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 10751#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 10785#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10746#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10744#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10745#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10777#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10740#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10738#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10739#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10769#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10734#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10732#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10733#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10761#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10760#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10715#L17-3 assume !(foo_~i~0 <= foo_~size); 10710#L17-4 foo_#res := foo_~i~0; 10705#L20 [2021-08-31 05:22:03,188 INFO L793 eck$LassoCheckResult]: Loop: 10705#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 10691#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 10692#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 10708#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10682#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10683#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10696#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10727#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10726#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10725#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10724#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10723#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10722#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10721#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10720#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10719#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10718#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10717#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 10713#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 10712#L17-3 assume !(foo_~i~0 <= foo_~size); 10704#L17-4 foo_#res := foo_~i~0; 10705#L20 [2021-08-31 05:22:03,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:22:03,189 INFO L82 PathProgramCache]: Analyzing trace with hash 303824311, now seen corresponding path program 29 times [2021-08-31 05:22:03,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:22:03,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871018912] [2021-08-31 05:22:03,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:22:03,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:22:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:22:03,204 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:22:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:22:03,236 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:22:03,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:22:03,236 INFO L82 PathProgramCache]: Analyzing trace with hash 800411583, now seen corresponding path program 18 times [2021-08-31 05:22:03,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:22:03,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757330604] [2021-08-31 05:22:03,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:22:03,237 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:22:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:22:03,240 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:22:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:22:03,245 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:22:03,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:22:03,245 INFO L82 PathProgramCache]: Analyzing trace with hash -654565431, now seen corresponding path program 30 times [2021-08-31 05:22:03,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:22:03,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796004737] [2021-08-31 05:22:03,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:22:03,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:22:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:22:03,265 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:22:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:22:03,295 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:22:03,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 87 [2021-08-31 05:22:17,318 WARN L210 SmtUtils]: Spent 13.40s on a formula simplification. DAG size of input: 697 DAG size of output: 461 [2021-08-31 05:22:17,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:17,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:17,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:17,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:17,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:17,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:17,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:17,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:17,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:17,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:17,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:17,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:17,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:17,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:17,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:17,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:17,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:17,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:17,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:17,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:17,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 91 [2021-08-31 05:22:17,855 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:22:17,855 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:22:17,855 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:22:17,855 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:22:17,855 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:22:17,855 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:22:17,855 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:22:17,855 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:22:17,855 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysWithLenghtAtDeclaration.c_Iteration21_Lasso [2021-08-31 05:22:17,855 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:22:17,855 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:22:17,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:22:19,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:22:19,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:22:19,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:22:19,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:22:19,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:22:19,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:22:19,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:22:19,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:22:19,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:22:19,883 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:22:19,883 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 05:22:19,883 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:22:19,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:22:19,885 INFO L229 MonitoredProcess]: Starting monitored process 81 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) [2021-08-31 05:22:19,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2021-08-31 05:22:19,886 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 [2021-08-31 05:22:19,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:22:19,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:22:19,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:22:19,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:22:19,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:22:19,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:22:19,927 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:22:19,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2021-08-31 05:22:19,943 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:22:19,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:22:19,943 INFO L229 MonitoredProcess]: Starting monitored process 82 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) [2021-08-31 05:22:19,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2021-08-31 05:22:19,945 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 [2021-08-31 05:22:19,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:22:19,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:22:19,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:22:19,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:22:19,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:22:19,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:22:19,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:22:19,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2021-08-31 05:22:19,983 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:22:19,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:22:19,984 INFO L229 MonitoredProcess]: Starting monitored process 83 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) [2021-08-31 05:22:19,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2021-08-31 05:22:19,986 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 [2021-08-31 05:22:19,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:22:19,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:22:19,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:22:19,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:22:19,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:22:19,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:22:20,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:22:20,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2021-08-31 05:22:20,033 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:22:20,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:22:20,042 INFO L229 MonitoredProcess]: Starting monitored process 84 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) [2021-08-31 05:22:20,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2021-08-31 05:22:20,045 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 [2021-08-31 05:22:20,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:22:20,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:22:20,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:22:20,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:22:20,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:22:20,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:22:20,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:22:20,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2021-08-31 05:22:20,083 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:22:20,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:22:20,085 INFO L229 MonitoredProcess]: Starting monitored process 85 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) [2021-08-31 05:22:20,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2021-08-31 05:22:20,087 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 [2021-08-31 05:22:20,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:22:20,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:22:20,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:22:20,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:22:20,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:22:20,098 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:22:20,113 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 05:22:20,121 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-08-31 05:22:20,122 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2021-08-31 05:22:20,122 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:22:20,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:22:20,132 INFO L229 MonitoredProcess]: Starting monitored process 86 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) [2021-08-31 05:22:20,135 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 05:22:20,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2021-08-31 05:22:20,153 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-31 05:22:20,153 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 05:22:20,153 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#b~0.base)_7) = -8*ULTIMATE.start_main_~i~1 + 13*v_rep(select #length ULTIMATE.start_main_~#b~0.base)_7 Supporting invariants [] [2021-08-31 05:22:20,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2021-08-31 05:22:20,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2021-08-31 05:22:20,530 INFO L297 tatePredicateManager]: 113 out of 113 supporting invariants were superfluous and have been removed [2021-08-31 05:22:20,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:22:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:22:20,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 05:22:20,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:22:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:22:20,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-31 05:22:20,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:22:21,072 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:22:21,072 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2021-08-31 05:22:21,072 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 137 states and 142 transitions. cyclomatic complexity: 8 Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 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) [2021-08-31 05:22:21,268 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 137 states and 142 transitions. cyclomatic complexity: 8. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 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) Result 279 states and 292 transitions. Complement of second has 27 states. [2021-08-31 05:22:21,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2021-08-31 05:22:21,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 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) [2021-08-31 05:22:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 44 transitions. [2021-08-31 05:22:21,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 44 transitions. Stem has 91 letters. Loop has 21 letters. [2021-08-31 05:22:21,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:22:21,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 44 transitions. Stem has 112 letters. Loop has 21 letters. [2021-08-31 05:22:21,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:22:21,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 44 transitions. Stem has 91 letters. Loop has 42 letters. [2021-08-31 05:22:21,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:22:21,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 279 states and 292 transitions. [2021-08-31 05:22:21,271 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2021-08-31 05:22:21,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 279 states to 175 states and 185 transitions. [2021-08-31 05:22:21,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-08-31 05:22:21,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-08-31 05:22:21,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 185 transitions. [2021-08-31 05:22:21,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:22:21,272 INFO L681 BuchiCegarLoop]: Abstraction has 175 states and 185 transitions. [2021-08-31 05:22:21,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 185 transitions. [2021-08-31 05:22:21,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 163. [2021-08-31 05:22:21,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 163 states have (on average 1.0552147239263803) internal successors, (172), 162 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:22:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 172 transitions. [2021-08-31 05:22:21,274 INFO L704 BuchiCegarLoop]: Abstraction has 163 states and 172 transitions. [2021-08-31 05:22:21,274 INFO L587 BuchiCegarLoop]: Abstraction has 163 states and 172 transitions. [2021-08-31 05:22:21,275 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-08-31 05:22:21,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 172 transitions. [2021-08-31 05:22:21,275 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2021-08-31 05:22:21,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:22:21,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:22:21,276 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [28, 28, 7, 7, 7, 6, 6, 1, 1] [2021-08-31 05:22:21,276 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 1, 1, 1, 1, 1] [2021-08-31 05:22:21,276 INFO L791 eck$LassoCheckResult]: Stem: 11958#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11959#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 11967#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 11971#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11982#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11981#L17-3 assume !(foo_~i~0 <= foo_~size); 11972#L17-4 foo_#res := foo_~i~0; 11968#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 11962#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 11963#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 11966#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11953#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11954#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12113#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12112#L17-3 assume !(foo_~i~0 <= foo_~size); 11973#L17-4 foo_#res := foo_~i~0; 11969#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 11970#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 12111#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 12110#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12109#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12108#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12107#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12106#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12105#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12104#L17-3 assume !(foo_~i~0 <= foo_~size); 12103#L17-4 foo_#res := foo_~i~0; 12102#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 12101#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 12100#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 12099#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12098#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12097#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12096#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12095#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12094#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12093#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12092#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12091#L17-3 assume !(foo_~i~0 <= foo_~size); 12090#L17-4 foo_#res := foo_~i~0; 12089#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 12088#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 12087#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 12086#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12085#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12084#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12083#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12082#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12081#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12080#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12079#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12077#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12075#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12074#L17-3 assume !(foo_~i~0 <= foo_~size); 12073#L17-4 foo_#res := foo_~i~0; 12072#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 12071#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 12070#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 12069#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12067#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12065#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12063#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12062#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12061#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12059#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12057#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12056#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12055#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12053#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12054#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12049#L17-3 assume !(foo_~i~0 <= foo_~size); 12050#L17-4 foo_#res := foo_~i~0; 12078#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 12076#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 12023#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 12024#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12017#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12018#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12013#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12014#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12068#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12066#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12064#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12007#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12006#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12004#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12005#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 12000#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 12001#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11983#L17-3 assume !(foo_~i~0 <= foo_~size); 11984#L17-4 foo_#res := foo_~i~0; 11978#L20 [2021-08-31 05:22:21,276 INFO L793 eck$LassoCheckResult]: Loop: 11978#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 11960#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 11961#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 11974#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11951#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11952#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11965#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11997#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11996#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11995#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11994#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11993#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11992#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11991#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11990#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11989#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11988#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11987#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11986#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11985#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 11977#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 11975#L17-3 assume !(foo_~i~0 <= foo_~size); 11976#L17-4 foo_#res := foo_~i~0; 11978#L20 [2021-08-31 05:22:21,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:22:21,277 INFO L82 PathProgramCache]: Analyzing trace with hash 303824311, now seen corresponding path program 31 times [2021-08-31 05:22:21,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:22:21,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276251381] [2021-08-31 05:22:21,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:22:21,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:22:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:22:21,296 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:22:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:22:21,329 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:22:21,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:22:21,330 INFO L82 PathProgramCache]: Analyzing trace with hash 396441537, now seen corresponding path program 19 times [2021-08-31 05:22:21,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:22:21,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336859044] [2021-08-31 05:22:21,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:22:21,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:22:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:22:21,335 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:22:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:22:21,340 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:22:21,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:22:21,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1972097717, now seen corresponding path program 32 times [2021-08-31 05:22:21,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:22:21,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782821021] [2021-08-31 05:22:21,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:22:21,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:22:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:22:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1754 backedges. 136 proven. 1478 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2021-08-31 05:22:21,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:22:21,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782821021] [2021-08-31 05:22:21,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782821021] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:22:21,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552810731] [2021-08-31 05:22:21,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-31 05:22:21,479 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:22:21,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:22:21,480 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:22:21,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2021-08-31 05:22:21,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-31 05:22:21,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 05:22:21,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-31 05:22:21,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:22:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1754 backedges. 151 proven. 1463 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2021-08-31 05:22:21,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:22:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1754 backedges. 151 proven. 1463 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2021-08-31 05:22:22,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552810731] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:22:22,098 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:22:22,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2021-08-31 05:22:22,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926501257] [2021-08-31 05:22:22,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:22,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 119 [2021-08-31 05:22:23,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:22:23,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-31 05:22:23,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2021-08-31 05:22:23,097 INFO L87 Difference]: Start difference. First operand 163 states and 172 transitions. cyclomatic complexity: 13 Second operand has 30 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 30 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:22:24,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:22:24,051 INFO L93 Difference]: Finished difference Result 325 states and 341 transitions. [2021-08-31 05:22:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-08-31 05:22:24,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 325 states and 341 transitions. [2021-08-31 05:22:24,053 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2021-08-31 05:22:24,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 325 states to 305 states and 321 transitions. [2021-08-31 05:22:24,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2021-08-31 05:22:24,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2021-08-31 05:22:24,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 305 states and 321 transitions. [2021-08-31 05:22:24,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:22:24,054 INFO L681 BuchiCegarLoop]: Abstraction has 305 states and 321 transitions. [2021-08-31 05:22:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states and 321 transitions. [2021-08-31 05:22:24,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 204. [2021-08-31 05:22:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 204 states have (on average 1.053921568627451) internal successors, (215), 203 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:22:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 215 transitions. [2021-08-31 05:22:24,057 INFO L704 BuchiCegarLoop]: Abstraction has 204 states and 215 transitions. [2021-08-31 05:22:24,057 INFO L587 BuchiCegarLoop]: Abstraction has 204 states and 215 transitions. [2021-08-31 05:22:24,057 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-08-31 05:22:24,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 215 transitions. [2021-08-31 05:22:24,058 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2021-08-31 05:22:24,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:22:24,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:22:24,059 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [35, 35, 8, 8, 8, 7, 7, 1, 1] [2021-08-31 05:22:24,059 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 1, 1, 1, 1, 1] [2021-08-31 05:22:24,059 INFO L791 eck$LassoCheckResult]: Stem: 13302#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 13303#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 13312#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 13327#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13328#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13323#L17-3 assume !(foo_~i~0 <= foo_~size); 13324#L17-4 foo_#res := foo_~i~0; 13316#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 13309#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 13310#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 13315#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13300#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13301#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13314#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13483#L17-3 assume !(foo_~i~0 <= foo_~size); 13480#L17-4 foo_#res := foo_~i~0; 13317#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 13318#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 13479#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 13478#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13477#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13476#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13475#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13474#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13473#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13472#L17-3 assume !(foo_~i~0 <= foo_~size); 13471#L17-4 foo_#res := foo_~i~0; 13470#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 13469#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 13468#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 13467#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13466#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13465#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13464#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13463#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13462#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13461#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13460#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13459#L17-3 assume !(foo_~i~0 <= foo_~size); 13458#L17-4 foo_#res := foo_~i~0; 13457#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 13456#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 13455#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 13454#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13453#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13452#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13451#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13450#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13449#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13448#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13447#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13446#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13445#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13444#L17-3 assume !(foo_~i~0 <= foo_~size); 13443#L17-4 foo_#res := foo_~i~0; 13442#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 13441#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 13440#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 13439#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13438#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13437#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13436#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13435#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13434#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13433#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13432#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13431#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13429#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13426#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13424#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13422#L17-3 assume !(foo_~i~0 <= foo_~size); 13420#L17-4 foo_#res := foo_~i~0; 13419#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 13418#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 13417#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 13416#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13415#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13414#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13413#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13412#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13411#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13410#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13409#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13408#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13405#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13404#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13403#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13399#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13400#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13430#L17-3 assume !(foo_~i~0 <= foo_~size); 13427#L17-4 foo_#res := foo_~i~0; 13425#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 13423#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 13421#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 13373#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13374#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13369#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13370#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13365#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13366#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13361#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13362#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13357#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13358#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13353#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13354#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13407#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13406#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13344#L17-3 assume !(foo_~i~0 <= foo_~size); 13345#L17-4 foo_#res := foo_~i~0; 13320#L20 [2021-08-31 05:22:24,059 INFO L793 eck$LassoCheckResult]: Loop: 13320#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 13307#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 13308#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 13313#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13298#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13299#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13342#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13341#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13340#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13339#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13338#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13337#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13336#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13335#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13334#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13333#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13332#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13331#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13330#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13329#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 13325#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 13326#L17-3 assume !(foo_~i~0 <= foo_~size); 13319#L17-4 foo_#res := foo_~i~0; 13320#L20 [2021-08-31 05:22:24,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:22:24,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1027250631, now seen corresponding path program 33 times [2021-08-31 05:22:24,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:22:24,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788476540] [2021-08-31 05:22:24,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:22:24,060 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:22:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:22:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 813 proven. 643 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2021-08-31 05:22:24,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:22:24,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788476540] [2021-08-31 05:22:24,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788476540] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:22:24,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47257586] [2021-08-31 05:22:24,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-31 05:22:24,191 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:22:24,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:22:24,193 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:22:24,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2021-08-31 05:22:24,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-08-31 05:22:24,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 05:22:24,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 26 conjunts are in the unsatisfiable core [2021-08-31 05:22:24,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:22:24,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 794 proven. 175 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2021-08-31 05:22:24,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:22:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 807 proven. 162 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2021-08-31 05:22:24,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47257586] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:22:24,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:22:24,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 19] total 43 [2021-08-31 05:22:24,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832387151] [2021-08-31 05:22:24,967 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:22:24,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:22:24,967 INFO L82 PathProgramCache]: Analyzing trace with hash 396441537, now seen corresponding path program 20 times [2021-08-31 05:22:24,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:22:24,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79354262] [2021-08-31 05:22:24,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:22:24,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:22:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:22:24,971 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:22:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:22:24,976 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:22:26,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:26,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 113 [2021-08-31 05:22:26,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:22:26,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-08-31 05:22:26,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1484, Unknown=0, NotChecked=0, Total=1806 [2021-08-31 05:22:26,201 INFO L87 Difference]: Start difference. First operand 204 states and 215 transitions. cyclomatic complexity: 15 Second operand has 43 states, 43 states have (on average 2.9302325581395348) internal successors, (126), 43 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:22:27,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:22:27,453 INFO L93 Difference]: Finished difference Result 225 states and 232 transitions. [2021-08-31 05:22:27,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-08-31 05:22:27,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 232 transitions. [2021-08-31 05:22:27,455 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2021-08-31 05:22:27,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 183 states and 188 transitions. [2021-08-31 05:22:27,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-08-31 05:22:27,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-08-31 05:22:27,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 183 states and 188 transitions. [2021-08-31 05:22:27,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:22:27,456 INFO L681 BuchiCegarLoop]: Abstraction has 183 states and 188 transitions. [2021-08-31 05:22:27,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states and 188 transitions. [2021-08-31 05:22:27,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 162. [2021-08-31 05:22:27,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 162 states have (on average 1.0308641975308641) internal successors, (167), 161 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:22:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 167 transitions. [2021-08-31 05:22:27,460 INFO L704 BuchiCegarLoop]: Abstraction has 162 states and 167 transitions. [2021-08-31 05:22:27,461 INFO L587 BuchiCegarLoop]: Abstraction has 162 states and 167 transitions. [2021-08-31 05:22:27,461 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-08-31 05:22:27,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 167 transitions. [2021-08-31 05:22:27,461 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2021-08-31 05:22:27,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:22:27,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:22:27,462 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [36, 36, 8, 8, 8, 7, 7, 1, 1] [2021-08-31 05:22:27,462 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 1, 1, 1, 1, 1] [2021-08-31 05:22:27,462 INFO L791 eck$LassoCheckResult]: Stem: 14544#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 14545#L-1 havoc main_#res;havoc main_#t~ret3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~#mask~0.base, main_~#mask~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(128);call main_~#mask~0.base, main_~#mask~0.offset := #Ultimate.allocOnStack(32);main_~i~1 := 0; 14556#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 14560#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14574#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14572#L17-3 assume !(foo_~i~0 <= foo_~size); 14567#L17-4 foo_#res := foo_~i~0; 14557#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 14551#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 14552#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 14701#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14699#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14697#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14695#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14693#L17-3 assume !(foo_~i~0 <= foo_~size); 14692#L17-4 foo_#res := foo_~i~0; 14558#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 14559#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 14561#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 14555#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14542#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14543#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14700#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14698#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14696#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14694#L17-3 assume !(foo_~i~0 <= foo_~size); 14564#L17-4 foo_#res := foo_~i~0; 14565#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 14691#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 14690#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 14689#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14688#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14687#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14686#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14685#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14684#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14683#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14682#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14681#L17-3 assume !(foo_~i~0 <= foo_~size); 14680#L17-4 foo_#res := foo_~i~0; 14679#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 14678#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 14677#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 14676#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14675#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14674#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14673#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14672#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14671#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14670#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14669#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14668#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14667#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14666#L17-3 assume !(foo_~i~0 <= foo_~size); 14665#L17-4 foo_#res := foo_~i~0; 14664#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 14663#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 14662#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 14661#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14660#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14659#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14658#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14656#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14655#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14654#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14652#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14651#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14650#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14648#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14647#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14646#L17-3 assume !(foo_~i~0 <= foo_~size); 14644#L17-4 foo_#res := foo_~i~0; 14643#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 14642#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 14640#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 14639#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14638#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14636#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14635#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14634#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14632#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14631#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14630#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14628#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14627#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14626#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14623#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14621#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14622#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14617#L17-3 assume !(foo_~i~0 <= foo_~size); 14615#L17-4 foo_#res := foo_~i~0; 14616#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 14657#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 14612#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 14610#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14611#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14649#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14606#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14604#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14605#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14641#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14600#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14598#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14599#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14633#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14594#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14592#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14593#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14625#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14624#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14573#L17-3 assume !(foo_~i~0 <= foo_~size); 14568#L17-4 foo_#res := foo_~i~0; 14563#L20 [2021-08-31 05:22:27,462 INFO L793 eck$LassoCheckResult]: Loop: 14563#L20 main_#t~ret3 := foo_#res;call write~int(main_#t~ret3, main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~1, 4);havoc main_#t~ret3; 14549#L26-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 14550#L26-3 assume !!(main_~i~1 < 32);foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~#mask~0.base, main_~#mask~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; 14566#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14540#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14541#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14554#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14587#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14586#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14585#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14584#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14583#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14582#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14581#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14580#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14579#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14578#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14577#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14576#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14575#L17-3 assume !!(foo_~i~0 <= foo_~size);assume 0 <= foo_~i~0 && foo_~i~0 < 32;call foo_#t~mem1 := read~int(foo_~b.base, foo_~b.offset + foo_~i~0, 1);foo_~a~0 := foo_~a~0[foo_~i~0 := foo_#t~mem1];havoc foo_#t~mem1; 14571#L17-2 foo_#t~post0 := foo_~i~0;foo_~i~0 := 1 + foo_#t~post0;havoc foo_#t~post0; 14570#L17-3 assume !(foo_~i~0 <= foo_~size); 14562#L17-4 foo_#res := foo_~i~0; 14563#L20 [2021-08-31 05:22:27,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:22:27,463 INFO L82 PathProgramCache]: Analyzing trace with hash -654565431, now seen corresponding path program 34 times [2021-08-31 05:22:27,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:22:27,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229675769] [2021-08-31 05:22:27,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:22:27,463 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:22:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:22:27,483 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:22:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:22:27,511 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:22:27,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:22:27,512 INFO L82 PathProgramCache]: Analyzing trace with hash 396441537, now seen corresponding path program 21 times [2021-08-31 05:22:27,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:22:27,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924341480] [2021-08-31 05:22:27,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:22:27,512 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:22:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:22:27,516 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:22:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:22:27,530 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:22:27,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:22:27,530 INFO L82 PathProgramCache]: Analyzing trace with hash -190195975, now seen corresponding path program 35 times [2021-08-31 05:22:27,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:22:27,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860100740] [2021-08-31 05:22:27,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:22:27,531 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:22:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:22:27,555 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:22:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:22:27,592 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:22:28,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 98 [2021-08-31 05:22:59,785 WARN L210 SmtUtils]: Spent 31.15s on a formula simplification. DAG size of input: 848 DAG size of output: 551 [2021-08-31 05:22:59,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-31 05:22:59,917 INFO L354 Elim1Store]: treesize reduction 275, result has 3.2 percent of original size [2021-08-31 05:22:59,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 108 [2021-08-31 05:23:00,518 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:23:00,518 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:23:00,518 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:23:00,518 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:23:00,518 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:23:00,518 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:23:00,518 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:23:00,518 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:23:00,519 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysWithLenghtAtDeclaration.c_Iteration24_Lasso [2021-08-31 05:23:00,519 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:23:00,519 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:23:00,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:23:00,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:23:00,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:23:00,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:23:00,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:23:00,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:23:00,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:23:02,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:23:02,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:23:02,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:23:03,469 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:23:03,469 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 05:23:03,470 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:23:03,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:23:03,470 INFO L229 MonitoredProcess]: Starting monitored process 89 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) [2021-08-31 05:23:03,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2021-08-31 05:23:03,472 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 [2021-08-31 05:23:03,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:23:03,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:23:03,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:23:03,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:23:03,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:23:03,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:23:03,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:23:03,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:23:03,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2021-08-31 05:23:03,495 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:23:03,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:23:03,496 INFO L229 MonitoredProcess]: Starting monitored process 90 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) [2021-08-31 05:23:03,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2021-08-31 05:23:03,497 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 [2021-08-31 05:23:03,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:23:03,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:23:03,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:23:03,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:23:03,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:23:03,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:23:03,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:23:03,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2021-08-31 05:23:03,521 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:23:03,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:23:03,522 INFO L229 MonitoredProcess]: Starting monitored process 91 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) [2021-08-31 05:23:03,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2021-08-31 05:23:03,524 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 [2021-08-31 05:23:03,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:23:03,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:23:03,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:23:03,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:23:03,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:23:03,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:23:03,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:23:03,534 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:23:03,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2021-08-31 05:23:03,549 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:23:03,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:23:03,550 INFO L229 MonitoredProcess]: Starting monitored process 92 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) [2021-08-31 05:23:03,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2021-08-31 05:23:03,552 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 [2021-08-31 05:23:03,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:23:03,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:23:03,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:23:03,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:23:03,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:23:03,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:23:03,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:23:03,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2021-08-31 05:23:03,576 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:23:03,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:23:03,576 INFO L229 MonitoredProcess]: Starting monitored process 93 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) [2021-08-31 05:23:03,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2021-08-31 05:23:03,578 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 [2021-08-31 05:23:03,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:23:03,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:23:03,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:23:03,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:23:03,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:23:03,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:23:03,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:23:03,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:23:03,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2021-08-31 05:23:03,601 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:23:03,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:23:03,602 INFO L229 MonitoredProcess]: Starting monitored process 94 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) [2021-08-31 05:23:03,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2021-08-31 05:23:03,606 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 [2021-08-31 05:23:03,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:23:03,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:23:03,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:23:03,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:23:03,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:23:03,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:23:03,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:23:03,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:23:03,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2021-08-31 05:23:03,628 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:23:03,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:23:03,629 INFO L229 MonitoredProcess]: Starting monitored process 95 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) [2021-08-31 05:23:03,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2021-08-31 05:23:03,631 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 [2021-08-31 05:23:03,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:23:03,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:23:03,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:23:03,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:23:03,641 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:23:03,641 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:23:03,646 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:23:03,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2021-08-31 05:23:03,662 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:23:03,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:23:03,662 INFO L229 MonitoredProcess]: Starting monitored process 96 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) [2021-08-31 05:23:03,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2021-08-31 05:23:03,664 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 [2021-08-31 05:23:03,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:23:03,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:23:03,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:23:03,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:23:03,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:23:03,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:23:03,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:23:03,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2021-08-31 05:23:03,739 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:23:03,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:23:03,740 INFO L229 MonitoredProcess]: Starting monitored process 97 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) [2021-08-31 05:23:03,753 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 [2021-08-31 05:23:03,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:23:03,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:23:03,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:23:03,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:23:03,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:23:03,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:23:03,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2021-08-31 05:23:03,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:23:03,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2021-08-31 05:23:03,789 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:23:03,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:23:03,790 INFO L229 MonitoredProcess]: Starting monitored process 98 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) [2021-08-31 05:23:03,793 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 [2021-08-31 05:23:03,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:23:03,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:23:03,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:23:03,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:23:03,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:23:03,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:23:03,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2021-08-31 05:23:03,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:23:03,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2021-08-31 05:23:03,832 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:23:03,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:23:03,833 INFO L229 MonitoredProcess]: Starting monitored process 99 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) [2021-08-31 05:23:03,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2021-08-31 05:23:03,835 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 [2021-08-31 05:23:03,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:23:03,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:23:03,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:23:03,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:23:03,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:23:03,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:23:03,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:23:03,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2021-08-31 05:23:03,880 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:23:03,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:23:03,881 INFO L229 MonitoredProcess]: Starting monitored process 100 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) [2021-08-31 05:23:03,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2021-08-31 05:23:03,883 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 [2021-08-31 05:23:03,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:23:03,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:23:03,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:23:03,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:23:03,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:23:03,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:23:03,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:23:03,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2021-08-31 05:23:03,925 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:23:03,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:23:03,930 INFO L229 MonitoredProcess]: Starting monitored process 101 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) [2021-08-31 05:23:03,949 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 [2021-08-31 05:23:03,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:23:03,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:23:03,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:23:03,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:23:03,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:23:03,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:23:03,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:23:03,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2021-08-31 05:23:03,965 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:23:03,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2021-08-31 05:23:03,981 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:23:03,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:23:03,981 INFO L229 MonitoredProcess]: Starting monitored process 102 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) [2021-08-31 05:23:03,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2021-08-31 05:23:03,983 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 [2021-08-31 05:23:03,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:23:03,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:23:03,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:23:03,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:23:03,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:23:03,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:23:04,003 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 05:23:04,027 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2021-08-31 05:23:04,027 INFO L444 ModelExtractionUtils]: 3 out of 25 variables were initially zero. Simplification set additionally 15 variables to zero. [2021-08-31 05:23:04,027 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:23:04,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:23:04,028 INFO L229 MonitoredProcess]: Starting monitored process 103 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) [2021-08-31 05:23:04,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2021-08-31 05:23:04,030 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 05:23:04,050 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2021-08-31 05:23:04,050 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 05:23:04,050 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#b~0.base)_8, ULTIMATE.start_foo_#in~size) = 50*v_rep(select #length ULTIMATE.start_main_~#b~0.base)_8 - 23*ULTIMATE.start_foo_#in~size Supporting invariants [-23*ULTIMATE.start_foo_#in~size + 48*v_rep(select #length ULTIMATE.start_main_~#b~0.base)_8 >= 0, 24*ULTIMATE.start_main_~i~1 - 23*ULTIMATE.start_foo_#in~size >= 0] [2021-08-31 05:23:04,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2021-08-31 05:23:04,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2021-08-31 05:23:04,758 INFO L297 tatePredicateManager]: 182 out of 183 supporting invariants were superfluous and have been removed [2021-08-31 05:23:04,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:23:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:23:04,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-31 05:23:04,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:23:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:23:05,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 31 conjunts are in the unsatisfiable core [2021-08-31 05:23:05,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:23:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:23:06,145 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 15 loop predicates [2021-08-31 05:23:06,145 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 167 transitions. cyclomatic complexity: 8 Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:23:06,179 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 167 transitions. cyclomatic complexity: 8. Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 162 states and 167 transitions. Complement of second has 4 states. [2021-08-31 05:23:06,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-08-31 05:23:06,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:23:06,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2021-08-31 05:23:06,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 112 letters. Loop has 23 letters. [2021-08-31 05:23:06,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:23:06,181 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-31 05:23:06,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:23:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:23:06,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-31 05:23:06,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:23:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:23:06,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 31 conjunts are in the unsatisfiable core [2021-08-31 05:23:06,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:23:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:23:07,483 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 15 loop predicates [2021-08-31 05:23:07,483 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 167 transitions. cyclomatic complexity: 8 Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:23:07,514 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 167 transitions. cyclomatic complexity: 8. Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 162 states and 167 transitions. Complement of second has 4 states. [2021-08-31 05:23:07,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-08-31 05:23:07,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:23:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2021-08-31 05:23:07,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 112 letters. Loop has 23 letters. [2021-08-31 05:23:07,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:23:07,515 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-31 05:23:07,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:23:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:23:07,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-31 05:23:07,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:23:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:23:08,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 31 conjunts are in the unsatisfiable core [2021-08-31 05:23:08,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:23:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:23:20,874 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 15 loop predicates [2021-08-31 05:23:20,874 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 167 transitions. cyclomatic complexity: 8 Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:23:33,261 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 167 transitions. cyclomatic complexity: 8. Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 250 states and 263 transitions. Complement of second has 27 states. [2021-08-31 05:23:33,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2021-08-31 05:23:33,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:23:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 105 transitions. [2021-08-31 05:23:33,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 105 transitions. Stem has 112 letters. Loop has 23 letters. [2021-08-31 05:23:33,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:23:33,263 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-31 05:23:33,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:23:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:23:33,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-31 05:23:33,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:23:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:23:33,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 31 conjunts are in the unsatisfiable core [2021-08-31 05:23:33,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:23:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:23:43,987 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.10 stem predicates 15 loop predicates [2021-08-31 05:23:43,988 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 167 transitions. cyclomatic complexity: 8 Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:23:56,307 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 167 transitions. cyclomatic complexity: 8. Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 188 states and 193 transitions. Complement of second has 22 states. [2021-08-31 05:23:56,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2021-08-31 05:23:56,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:23:56,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 96 transitions. [2021-08-31 05:23:56,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 96 transitions. Stem has 112 letters. Loop has 23 letters. [2021-08-31 05:23:56,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:23:56,308 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-31 05:23:56,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:23:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:23:56,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-31 05:23:56,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:23:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:23:56,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 31 conjunts are in the unsatisfiable core [2021-08-31 05:23:56,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:23:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:23:57,621 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.10 stem predicates 15 loop predicates [2021-08-31 05:23:57,621 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 162 states and 167 transitions. cyclomatic complexity: 8 Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:23:58,003 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 162 states and 167 transitions. cyclomatic complexity: 8 Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1054 states and 1235 transitions. Complement of second has 97 states 28 powerset states69 rank states. The highest rank that occured is 3 [2021-08-31 05:23:58,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 10 stem states 1 non-accepting loop states 2 accepting loop states [2021-08-31 05:23:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:23:58,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 184 transitions. [2021-08-31 05:23:58,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 184 transitions. Stem has 112 letters. Loop has 23 letters. [2021-08-31 05:23:58,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:23:58,005 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-31 05:23:58,005 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: no settings was sufficient at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:549) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) 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) [2021-08-31 05:23:58,009 INFO L158 Benchmark]: Toolchain (without parser) took 156552.92ms. Allocated memory was 54.5MB in the beginning and 226.5MB in the end (delta: 172.0MB). Free memory was 32.3MB in the beginning and 173.3MB in the end (delta: -141.0MB). Peak memory consumption was 163.1MB. Max. memory is 16.1GB. [2021-08-31 05:23:58,009 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory was 36.4MB in the beginning and 36.3MB in the end (delta: 45.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 05:23:58,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 125.20ms. Allocated memory is still 54.5MB. Free memory was 32.1MB in the beginning and 36.8MB in the end (delta: -4.8MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2021-08-31 05:23:58,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.58ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 36.8MB in the beginning and 55.6MB in the end (delta: -18.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 05:23:58,009 INFO L158 Benchmark]: Boogie Preprocessor took 30.68ms. Allocated memory is still 71.3MB. Free memory was 55.6MB in the beginning and 54.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 05:23:58,010 INFO L158 Benchmark]: RCFGBuilder took 201.98ms. Allocated memory is still 71.3MB. Free memory was 54.5MB in the beginning and 45.5MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-08-31 05:23:58,012 INFO L158 Benchmark]: BuchiAutomizer took 156137.55ms. Allocated memory was 71.3MB in the beginning and 226.5MB in the end (delta: 155.2MB). Free memory was 45.5MB in the beginning and 173.3MB in the end (delta: -127.8MB). Peak memory consumption was 160.1MB. Max. memory is 16.1GB. [2021-08-31 05:23:58,013 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory was 36.4MB in the beginning and 36.3MB in the end (delta: 45.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 125.20ms. Allocated memory is still 54.5MB. Free memory was 32.1MB in the beginning and 36.8MB in the end (delta: -4.8MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.58ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 36.8MB in the beginning and 55.6MB in the end (delta: -18.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.68ms. Allocated memory is still 71.3MB. Free memory was 55.6MB in the beginning and 54.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 201.98ms. Allocated memory is still 71.3MB. Free memory was 54.5MB in the beginning and 45.5MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 156137.55ms. Allocated memory was 71.3MB in the beginning and 226.5MB in the end (delta: 155.2MB). Free memory was 45.5MB in the beginning and 173.3MB in the end (delta: -127.8MB). Peak memory consumption was 160.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: no settings was sufficient de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: no settings was sufficient: de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 05:23:58,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Forceful destruction successful, exit code 0 [2021-08-31 05:23:58,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2021-08-31 05:23:58,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Ended with exit code 0 [2021-08-31 05:23:58,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2021-08-31 05:23:58,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2021-08-31 05:23:59,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2021-08-31 05:23:59,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2021-08-31 05:23:59,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2021-08-31 05:23:59,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2021-08-31 05:23:59,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2021-08-31 05:24:00,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2021-08-31 05:24:00,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2021-08-31 05:24:00,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-08-31 05:24:00,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-31 05:24:00,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-31 05:24:01,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...