./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 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/ArraysOfVariableLength4.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 f3d22aeda2fb15b9dd79854281ee0f5e475c0f7ee1551b76594f45703ddc81df --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:26:40,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:26:40,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:26:40,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:26:40,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:26:40,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:26:40,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:26:40,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:26:40,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:26:40,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:26:40,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:26:40,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:26:40,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:26:40,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:26:40,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:26:40,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:26:40,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:26:40,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:26:40,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:26:40,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:26:40,325 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:26:40,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:26:40,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:26:40,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:26:40,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:26:40,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:26:40,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:26:40,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:26:40,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:26:40,333 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:26:40,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:26:40,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:26:40,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:26:40,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:26:40,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:26:40,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:26:40,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:26:40,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:26:40,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:26:40,341 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:26:40,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:26:40,342 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:26:40,367 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:26:40,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:26:40,368 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:26:40,368 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:26:40,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:26:40,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:26:40,369 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:26:40,369 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:26:40,369 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:26:40,369 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:26:40,369 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:26:40,370 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:26:40,370 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:26:40,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:26:40,370 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:26:40,370 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:26:40,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:26:40,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:26:40,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:26:40,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:26:40,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:26:40,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:26:40,371 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:26:40,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:26:40,371 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:26:40,371 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:26:40,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:26:40,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:26:40,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:26:40,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:26:40,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:26:40,372 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:26:40,373 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:26:40,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 -> f3d22aeda2fb15b9dd79854281ee0f5e475c0f7ee1551b76594f45703ddc81df [2021-12-15 17:26:40,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:26:40,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:26:40,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:26:40,553 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:26:40,553 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:26:40,554 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4.c [2021-12-15 17:26:40,603 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f07edf06/a99ffba4893a4f86b318677146d26289/FLAGadd8b27f0 [2021-12-15 17:26:40,956 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:26:40,957 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4.c [2021-12-15 17:26:40,964 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f07edf06/a99ffba4893a4f86b318677146d26289/FLAGadd8b27f0 [2021-12-15 17:26:40,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f07edf06/a99ffba4893a4f86b318677146d26289 [2021-12-15 17:26:40,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:26:40,980 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:26:40,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:26:40,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:26:40,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:26:40,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:26:40" (1/1) ... [2021-12-15 17:26:40,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d6508be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:40, skipping insertion in model container [2021-12-15 17:26:40,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:26:40" (1/1) ... [2021-12-15 17:26:40,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:26:40,998 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:26:41,135 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:26:41,141 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:26:41,152 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:26:41,162 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:26:41,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41 WrapperNode [2021-12-15 17:26:41,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:26:41,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:26:41,165 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:26:41,165 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:26:41,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (1/1) ... [2021-12-15 17:26:41,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (1/1) ... [2021-12-15 17:26:41,192 INFO L137 Inliner]: procedures = 8, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2021-12-15 17:26:41,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:26:41,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:26:41,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:26:41,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:26:41,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (1/1) ... [2021-12-15 17:26:41,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (1/1) ... [2021-12-15 17:26:41,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (1/1) ... [2021-12-15 17:26:41,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (1/1) ... [2021-12-15 17:26:41,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (1/1) ... [2021-12-15 17:26:41,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (1/1) ... [2021-12-15 17:26:41,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (1/1) ... [2021-12-15 17:26:41,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:26:41,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:26:41,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:26:41,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:26:41,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (1/1) ... [2021-12-15 17:26:41,227 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:41,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:41,243 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-12-15 17:26:41,267 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-12-15 17:26:41,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 17:26:41,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:26:41,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:26:41,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 17:26:41,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 17:26:41,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 17:26:41,318 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:26:41,319 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:26:41,398 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:26:41,402 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:26:41,402 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-15 17:26:41,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:26:41 BoogieIcfgContainer [2021-12-15 17:26:41,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:26:41,404 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:26:41,404 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:26:41,406 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:26:41,407 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:26:41,407 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:26:40" (1/3) ... [2021-12-15 17:26:41,408 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70bb3d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:26:41, skipping insertion in model container [2021-12-15 17:26:41,408 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:26:41,408 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (2/3) ... [2021-12-15 17:26:41,409 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70bb3d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:26:41, skipping insertion in model container [2021-12-15 17:26:41,409 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:26:41,409 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:26:41" (3/3) ... [2021-12-15 17:26:41,410 INFO L388 chiAutomizerObserver]: Analyzing ICFG ArraysOfVariableLength4.c [2021-12-15 17:26:41,438 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:26:41,438 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:26:41,438 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:26:41,439 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:26:41,439 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:26:41,439 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:26:41,439 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:26:41,439 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:26:41,448 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-12-15 17:26:41,458 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-15 17:26:41,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:41,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:41,462 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:26:41,462 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-15 17:26:41,463 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:26:41,463 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-12-15 17:26:41,464 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-15 17:26:41,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:41,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:41,464 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:26:41,465 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-15 17:26:41,469 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; 7#L25-3true [2021-12-15 17:26:41,470 INFO L793 eck$LassoCheckResult]: Loop: 7#L25-3true assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 6#L15-3true assume !(foo_~i~0#1 < foo_~size#1); 13#L15-4true foo_#res#1 := foo_~i~0#1; 14#L18true main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 15#L25-2true main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 7#L25-3true [2021-12-15 17:26:41,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-15 17:26:41,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:41,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260822691] [2021-12-15 17:26:41,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:41,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:41,538 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:41,560 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:41,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:41,562 INFO L85 PathProgramCache]: Analyzing trace with hash 38364915, now seen corresponding path program 1 times [2021-12-15 17:26:41,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:41,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616950627] [2021-12-15 17:26:41,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:41,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:41,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:41,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:41,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616950627] [2021-12-15 17:26:41,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616950627] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:26:41,647 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:26:41,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:26:41,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509731335] [2021-12-15 17:26:41,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:26:41,651 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:26:41,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:41,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:26:41,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:26:41,681 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 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:26:41,715 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2021-12-15 17:26:41,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:26:41,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2021-12-15 17:26:41,723 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-15 17:26:41,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 16 transitions. [2021-12-15 17:26:41,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-15 17:26:41,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-15 17:26:41,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2021-12-15 17:26:41,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:41,728 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-15 17:26:41,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2021-12-15 17:26:41,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2021-12-15 17:26:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 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-12-15 17:26:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-12-15 17:26:41,745 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-12-15 17:26:41,745 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-12-15 17:26:41,746 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:26:41,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2021-12-15 17:26:41,747 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-15 17:26:41,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:41,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:41,748 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:26:41,748 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:26:41,748 INFO L791 eck$LassoCheckResult]: Stem: 49#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 50#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; 48#L25-3 [2021-12-15 17:26:41,749 INFO L793 eck$LassoCheckResult]: Loop: 48#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 51#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 52#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 57#L15-3 assume !(foo_~i~0#1 < foo_~size#1); 45#L15-4 foo_#res#1 := foo_~i~0#1; 46#L18 main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 47#L25-2 main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 48#L25-3 [2021-12-15 17:26:41,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:41,750 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-15 17:26:41,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:41,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135753118] [2021-12-15 17:26:41,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:41,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:41,773 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:41,788 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:41,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:41,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1732759051, now seen corresponding path program 1 times [2021-12-15 17:26:41,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:41,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282998235] [2021-12-15 17:26:41,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:41,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:41,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:41,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282998235] [2021-12-15 17:26:41,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282998235] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:26:41,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33913770] [2021-12-15 17:26:41,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:41,833 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:26:41,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:41,836 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:26:41,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 17:26:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:41,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 17:26:41,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:26:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:41,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:26:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:41,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33913770] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:26:41,963 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:26:41,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2021-12-15 17:26:41,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984622140] [2021-12-15 17:26:41,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:26:41,964 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:26:41,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:41,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 17:26:41,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2021-12-15 17:26:41,965 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand has 8 states, 8 states have (on average 1.875) 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-12-15 17:26:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:26:42,025 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2021-12-15 17:26:42,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 17:26:42,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2021-12-15 17:26:42,031 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2021-12-15 17:26:42,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2021-12-15 17:26:42,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-15 17:26:42,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-15 17:26:42,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2021-12-15 17:26:42,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:42,033 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-12-15 17:26:42,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2021-12-15 17:26:42,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-15 17:26:42,036 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-12-15 17:26:42,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2021-12-15 17:26:42,037 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-12-15 17:26:42,037 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-12-15 17:26:42,037 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:26:42,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2021-12-15 17:26:42,039 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2021-12-15 17:26:42,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:42,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:42,040 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:26:42,040 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1, 1, 1] [2021-12-15 17:26:42,040 INFO L791 eck$LassoCheckResult]: Stem: 128#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 129#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; 127#L25-3 [2021-12-15 17:26:42,040 INFO L793 eck$LassoCheckResult]: Loop: 127#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 130#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 131#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 136#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 142#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 141#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 140#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 139#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 138#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 137#L15-3 assume !(foo_~i~0#1 < foo_~size#1); 124#L15-4 foo_#res#1 := foo_~i~0#1; 125#L18 main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 126#L25-2 main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 127#L25-3 [2021-12-15 17:26:42,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:42,040 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-15 17:26:42,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:42,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115460758] [2021-12-15 17:26:42,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:42,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:42,046 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:42,050 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:42,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:42,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1316700165, now seen corresponding path program 2 times [2021-12-15 17:26:42,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:42,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449796965] [2021-12-15 17:26:42,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:42,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:42,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:42,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449796965] [2021-12-15 17:26:42,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449796965] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:26:42,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228603800] [2021-12-15 17:26:42,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 17:26:42,123 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:26:42,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:42,164 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:26:42,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 17:26:42,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 17:26:42,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:26:42,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:26:42,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:26:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:42,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:26:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:42,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228603800] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:26:42,343 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:26:42,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2021-12-15 17:26:42,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716706915] [2021-12-15 17:26:42,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:26:42,344 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:26:42,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:42,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 17:26:42,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2021-12-15 17:26:42,345 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 4 Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:26:42,386 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2021-12-15 17:26:42,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 17:26:42,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2021-12-15 17:26:42,387 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2021-12-15 17:26:42,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 33 transitions. [2021-12-15 17:26:42,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2021-12-15 17:26:42,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2021-12-15 17:26:42,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2021-12-15 17:26:42,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:42,389 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2021-12-15 17:26:42,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2021-12-15 17:26:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-12-15 17:26:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.064516129032258) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2021-12-15 17:26:42,391 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2021-12-15 17:26:42,391 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2021-12-15 17:26:42,391 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:26:42,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2021-12-15 17:26:42,391 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2021-12-15 17:26:42,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:42,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:42,392 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:26:42,392 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 1, 1, 1, 1, 1] [2021-12-15 17:26:42,392 INFO L791 eck$LassoCheckResult]: Stem: 270#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 271#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; 269#L25-3 [2021-12-15 17:26:42,393 INFO L793 eck$LassoCheckResult]: Loop: 269#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 275#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 279#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 272#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 273#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 296#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 295#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 294#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 293#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 292#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 291#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 290#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 289#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 288#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 287#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 286#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 285#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 284#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 283#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 282#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 281#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 280#L15-3 assume !(foo_~i~0#1 < foo_~size#1); 266#L15-4 foo_#res#1 := foo_~i~0#1; 267#L18 main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 268#L25-2 main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 269#L25-3 [2021-12-15 17:26:42,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:42,393 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-15 17:26:42,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:42,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316930193] [2021-12-15 17:26:42,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:42,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:42,401 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:42,405 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:42,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:42,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2131617415, now seen corresponding path program 3 times [2021-12-15 17:26:42,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:42,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417259704] [2021-12-15 17:26:42,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:42,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:42,528 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:42,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:42,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417259704] [2021-12-15 17:26:42,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417259704] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:26:42,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210846438] [2021-12-15 17:26:42,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 17:26:42,529 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:26:42,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:42,530 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:26:42,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 17:26:42,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-12-15 17:26:42,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:26:42,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-15 17:26:42,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:26:42,847 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:42,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:26:43,058 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:43,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210846438] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:26:43,062 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:26:43,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2021-12-15 17:26:43,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918834011] [2021-12-15 17:26:43,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:26:43,064 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:26:43,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:43,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-15 17:26:43,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2021-12-15 17:26:43,067 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. cyclomatic complexity: 4 Second operand has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:43,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:26:43,135 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2021-12-15 17:26:43,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-15 17:26:43,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 57 transitions. [2021-12-15 17:26:43,141 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2021-12-15 17:26:43,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 57 transitions. [2021-12-15 17:26:43,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2021-12-15 17:26:43,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2021-12-15 17:26:43,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 57 transitions. [2021-12-15 17:26:43,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:43,145 INFO L681 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-12-15 17:26:43,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 57 transitions. [2021-12-15 17:26:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-12-15 17:26:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 54 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-12-15 17:26:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2021-12-15 17:26:43,150 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-12-15 17:26:43,150 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-12-15 17:26:43,150 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:26:43,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 57 transitions. [2021-12-15 17:26:43,154 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2021-12-15 17:26:43,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:43,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:43,156 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:26:43,156 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [22, 22, 1, 1, 1, 1, 1] [2021-12-15 17:26:43,156 INFO L791 eck$LassoCheckResult]: Stem: 538#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 539#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; 537#L25-3 [2021-12-15 17:26:43,156 INFO L793 eck$LassoCheckResult]: Loop: 537#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 543#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 547#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 540#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 541#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 588#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 587#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 586#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 585#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 584#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 583#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 582#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 581#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 580#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 579#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 578#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 577#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 576#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 575#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 574#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 573#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 572#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 571#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 570#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 569#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 568#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 567#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 566#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 565#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 564#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 563#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 562#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 561#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 560#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 559#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 558#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 557#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 556#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 555#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 554#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 553#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 552#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 551#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 550#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 549#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 548#L15-3 assume !(foo_~i~0#1 < foo_~size#1); 534#L15-4 foo_#res#1 := foo_~i~0#1; 535#L18 main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 536#L25-2 main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 537#L25-3 [2021-12-15 17:26:43,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:43,157 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-15 17:26:43,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:43,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717397752] [2021-12-15 17:26:43,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:43,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:43,174 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:43,182 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:43,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:43,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1575559777, now seen corresponding path program 4 times [2021-12-15 17:26:43,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:43,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630619242] [2021-12-15 17:26:43,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:43,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:43,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:43,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630619242] [2021-12-15 17:26:43,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630619242] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:26:43,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472268041] [2021-12-15 17:26:43,508 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 17:26:43,509 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:26:43,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:43,510 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:26:43,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-15 17:26:43,580 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 17:26:43,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:26:43,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-15 17:26:43,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:26:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:44,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:26:44,323 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:44,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472268041] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:26:44,323 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:26:44,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 56 [2021-12-15 17:26:44,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138789119] [2021-12-15 17:26:44,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:26:44,324 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:26:44,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:44,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-12-15 17:26:44,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1343, Invalid=1849, Unknown=0, NotChecked=0, Total=3192 [2021-12-15 17:26:44,326 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. cyclomatic complexity: 4 Second operand has 57 states, 57 states have (on average 2.017543859649123) internal successors, (115), 56 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:44,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:26:44,402 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2021-12-15 17:26:44,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-15 17:26:44,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 77 transitions. [2021-12-15 17:26:44,403 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 72 [2021-12-15 17:26:44,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 77 transitions. [2021-12-15 17:26:44,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2021-12-15 17:26:44,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2021-12-15 17:26:44,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 77 transitions. [2021-12-15 17:26:44,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:44,404 INFO L681 BuchiCegarLoop]: Abstraction has 75 states and 77 transitions. [2021-12-15 17:26:44,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 77 transitions. [2021-12-15 17:26:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-12-15 17:26:44,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:26:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2021-12-15 17:26:44,407 INFO L704 BuchiCegarLoop]: Abstraction has 75 states and 77 transitions. [2021-12-15 17:26:44,407 INFO L587 BuchiCegarLoop]: Abstraction has 75 states and 77 transitions. [2021-12-15 17:26:44,407 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:26:44,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 77 transitions. [2021-12-15 17:26:44,407 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 72 [2021-12-15 17:26:44,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:44,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:44,408 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:26:44,408 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [32, 32, 1, 1, 1, 1, 1] [2021-12-15 17:26:44,408 INFO L791 eck$LassoCheckResult]: Stem: 1016#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1017#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; 1015#L25-3 [2021-12-15 17:26:44,408 INFO L793 eck$LassoCheckResult]: Loop: 1015#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 1021#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1025#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1018#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1019#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1086#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1085#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1084#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1083#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1082#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1081#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1080#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1079#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1078#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1077#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1076#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1075#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1074#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1073#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1072#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1071#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1070#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1069#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1068#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1067#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1066#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1065#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1064#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1063#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1062#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1061#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1060#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1059#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1058#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1057#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1056#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1055#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1054#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1053#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1052#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1051#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1050#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1049#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1048#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1047#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1046#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1045#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1044#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1043#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1042#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1041#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1040#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1039#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1038#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1037#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1036#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1035#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1034#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1033#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1032#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1031#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1030#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1029#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1028#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1027#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1026#L15-3 assume !(foo_~i~0#1 < foo_~size#1); 1012#L15-4 foo_#res#1 := foo_~i~0#1; 1013#L18 main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 1014#L25-2 main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1015#L25-3 [2021-12-15 17:26:44,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:44,409 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-12-15 17:26:44,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:44,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721762799] [2021-12-15 17:26:44,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:44,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:44,413 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:44,415 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:44,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:44,416 INFO L85 PathProgramCache]: Analyzing trace with hash 776556339, now seen corresponding path program 5 times [2021-12-15 17:26:44,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:44,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464671251] [2021-12-15 17:26:44,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:44,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:44,451 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:44,489 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:44,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:44,490 INFO L85 PathProgramCache]: Analyzing trace with hash -378248015, now seen corresponding path program 1 times [2021-12-15 17:26:44,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:44,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918102349] [2021-12-15 17:26:44,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:44,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:44,523 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:44,594 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:27:52,957 WARN L227 SmtUtils]: Spent 1.14m on a formula simplification. DAG size of input: 505 DAG size of output: 315 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-15 17:27:53,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:27:53,479 INFO L244 Elim1Store]: Index analysis took 472 ms [2021-12-15 17:27:53,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, 496 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 304 treesize of output 366 [2021-12-15 17:27:54,064 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:27:54,064 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:27:54,064 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:27:54,064 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:27:54,064 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:27:54,064 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:27:54,064 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:27:54,064 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:27:54,064 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysOfVariableLength4.c_Iteration6_Lasso [2021-12-15 17:27:54,064 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:27:54,064 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:27:54,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:27:54,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:27:54,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:27:54,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:27:56,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:27:56,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:27:56,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:27:56,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:27:56,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:27:56,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:27:56,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:27:56,982 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:27:56,987 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:27:56,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:27:56,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:27:56,992 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-12-15 17:27:56,995 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-12-15 17:27:56,997 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-12-15 17:27:57,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:27:57,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:27:57,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:27:57,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:27:57,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:27:57,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:27:57,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:27:57,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:27:57,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-12-15 17:27:57,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:27:57,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:27:57,025 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-12-15 17:27:57,027 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-12-15 17:27:57,028 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-12-15 17:27:57,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:27:57,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:27:57,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:27:57,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:27:57,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:27:57,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:27:57,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:27:57,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:27:57,064 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-12-15 17:27:57,064 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:27:57,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:27:57,066 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-12-15 17:27:57,069 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-12-15 17:27:57,071 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-12-15 17:27:57,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:27:57,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:27:57,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:27:57,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:27:57,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:27:57,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:27:57,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:27:57,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:27:57,112 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-12-15 17:27:57,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:27:57,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:27:57,113 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-12-15 17:27:57,114 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-12-15 17:27:57,116 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-12-15 17:27:57,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:27:57,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:27:57,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:27:57,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:27:57,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:27:57,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:27:57,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:27:57,137 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:27:57,154 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-12-15 17:27:57,154 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:27:57,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:27:57,155 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-12-15 17:27:57,156 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-12-15 17:27:57,157 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-12-15 17:27:57,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:27:57,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:27:57,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:27:57,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:27:57,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:27:57,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:27:57,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:27:57,164 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:27:57,181 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-12-15 17:27:57,181 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:27:57,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:27:57,182 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-12-15 17:27:57,182 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-12-15 17:27:57,184 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-12-15 17:27:57,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:27:57,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:27:57,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:27:57,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:27:57,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:27:57,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:27:57,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:27:57,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:27:57,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2021-12-15 17:27:57,214 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:27:57,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:27:57,214 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-12-15 17:27:57,215 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-12-15 17:27:57,216 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-12-15 17:27:57,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:27:57,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:27:57,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:27:57,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:27:57,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:27:57,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:27:57,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:27:57,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:27:57,243 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-12-15 17:27:57,244 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:27:57,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:27:57,244 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-12-15 17:27:57,245 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-12-15 17:27:57,247 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-12-15 17:27:57,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:27:57,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:27:57,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:27:57,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:27:57,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:27:57,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:27:57,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:27:57,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:27:57,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-15 17:27:57,268 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:27:57,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:27:57,269 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-12-15 17:27:57,269 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-12-15 17:27:57,271 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-12-15 17:27:57,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:27:57,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:27:57,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:27:57,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:27:57,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:27:57,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:27:57,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:27:57,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:27:57,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2021-12-15 17:27:57,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:27:57,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:27:57,299 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-12-15 17:27:57,300 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-12-15 17:27:57,301 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-12-15 17:27:57,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:27:57,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:27:57,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:27:57,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:27:57,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:27:57,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:27:57,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:27:57,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:27:57,323 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-12-15 17:27:57,323 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:27:57,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:27:57,324 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-12-15 17:27:57,324 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-12-15 17:27:57,325 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-12-15 17:27:57,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:27:57,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:27:57,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:27:57,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:27:57,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:27:57,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:27:57,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:27:57,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:27:57,363 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-12-15 17:27:57,364 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:27:57,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:27:57,365 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-12-15 17:27:57,381 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-12-15 17:27:57,382 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-12-15 17:27:57,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:27:57,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:27:57,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:27:57,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:27:57,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:27:57,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:27:57,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:27:57,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:27:57,405 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-12-15 17:27:57,405 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:27:57,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:27:57,406 INFO L229 MonitoredProcess]: Starting monitored process 18 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-12-15 17:27:57,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-15 17:27:57,408 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-12-15 17:27:57,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:27:57,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:27:57,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:27:57,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:27:57,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:27:57,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:27:57,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:27:57,414 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:27:57,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-15 17:27:57,431 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:27:57,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:27:57,432 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-12-15 17:27:57,434 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-12-15 17:27:57,434 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-12-15 17:27:57,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:27:57,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:27:57,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:27:57,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:27:57,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:27:57,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:27:57,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:27:57,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:27:57,455 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-12-15 17:27:57,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:27:57,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:27:57,456 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-12-15 17:27:57,458 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-12-15 17:27:57,458 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-12-15 17:27:57,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:27:57,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:27:57,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:27:57,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:27:57,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:27:57,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:27:57,491 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:27:57,518 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-12-15 17:27:57,518 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-15 17:27:57,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:27:57,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:27:57,520 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-12-15 17:27:57,522 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-12-15 17:27:57,529 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:27:57,552 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-15 17:27:57,552 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:27:57,553 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#b~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 1*v_rep(select #length ULTIMATE.start_main_~#b~0#1.base)_1 - 4*ULTIMATE.start_main_~i~1#1 Supporting invariants [1*ULTIMATE.start_main_~#b~0#1.offset >= 0] [2021-12-15 17:27:57,570 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-12-15 17:27:57,638 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-12-15 17:27:59,636 INFO L297 tatePredicateManager]: 375 out of 376 supporting invariants were superfluous and have been removed [2021-12-15 17:27:59,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:27:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:27:59,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 17:27:59,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:27:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:27:59,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 17:27:59,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:28:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2021-12-15 17:28:00,239 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-15 17:28:00,239 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 77 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:28:00,294 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 77 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 145 states and 151 transitions. Complement of second has 7 states. [2021-12-15 17:28:00,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:28:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:28:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2021-12-15 17:28:00,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 69 letters. [2021-12-15 17:28:00,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:28:00,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 71 letters. Loop has 69 letters. [2021-12-15 17:28:00,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:28:00,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 138 letters. [2021-12-15 17:28:00,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:28:00,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 151 transitions. [2021-12-15 17:28:00,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-12-15 17:28:00,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 141 states and 146 transitions. [2021-12-15 17:28:00,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2021-12-15 17:28:00,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2021-12-15 17:28:00,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 146 transitions. [2021-12-15 17:28:00,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:28:00,309 INFO L681 BuchiCegarLoop]: Abstraction has 141 states and 146 transitions. [2021-12-15 17:28:00,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 146 transitions. [2021-12-15 17:28:00,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 78. [2021-12-15 17:28:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.064102564102564) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:28:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2021-12-15 17:28:00,320 INFO L704 BuchiCegarLoop]: Abstraction has 78 states and 83 transitions. [2021-12-15 17:28:00,320 INFO L587 BuchiCegarLoop]: Abstraction has 78 states and 83 transitions. [2021-12-15 17:28:00,320 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:28:00,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 83 transitions. [2021-12-15 17:28:00,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-12-15 17:28:00,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:28:00,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:28:00,321 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-15 17:28:00,321 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:28:00,321 INFO L791 eck$LassoCheckResult]: Stem: 2982#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2983#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; 2988#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 2984#L15-3 [2021-12-15 17:28:00,321 INFO L793 eck$LassoCheckResult]: Loop: 2984#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 2985#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 2984#L15-3 [2021-12-15 17:28:00,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:28:00,322 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2021-12-15 17:28:00,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:28:00,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405209148] [2021-12-15 17:28:00,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:28:00,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:28:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:28:00,333 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:28:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:28:00,340 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:28:00,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:28:00,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 1 times [2021-12-15 17:28:00,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:28:00,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849004608] [2021-12-15 17:28:00,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:28:00,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:28:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:28:00,343 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:28:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:28:00,345 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:28:00,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:28:00,345 INFO L85 PathProgramCache]: Analyzing trace with hash 28698921, now seen corresponding path program 1 times [2021-12-15 17:28:00,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:28:00,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153401986] [2021-12-15 17:28:00,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:28:00,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:28:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:28:00,350 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:28:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:28:00,354 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace