./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/stroeder1-alloca-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/stroeder1-alloca-1.i -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 7ecc590057ed2a75208183cfd6234616268fa2b1af2dc90ae740756ef7d3d489 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:35:33,196 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:35:33,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:35:33,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:35:33,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:35:33,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:35:33,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:35:33,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:35:33,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:35:33,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:35:33,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:35:33,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:35:33,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:35:33,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:35:33,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:35:33,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:35:33,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:35:33,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:35:33,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:35:33,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:35:33,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:35:33,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:35:33,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:35:33,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:35:33,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:35:33,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:35:33,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:35:33,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:35:33,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:35:33,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:35:33,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:35:33,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:35:33,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:35:33,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:35:33,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:35:33,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:35:33,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:35:33,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:35:33,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:35:33,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:35:33,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:35:33,280 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:35:33,305 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:35:33,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:35:33,306 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:35:33,306 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:35:33,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:35:33,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:35:33,307 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:35:33,308 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:35:33,308 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:35:33,308 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:35:33,308 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:35:33,309 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:35:33,309 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:35:33,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:35:33,309 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:35:33,309 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:35:33,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:35:33,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:35:33,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:35:33,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:35:33,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:35:33,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:35:33,310 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:35:33,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:35:33,310 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:35:33,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:35:33,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:35:33,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:35:33,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:35:33,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:35:33,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:35:33,312 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:35:33,312 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 -> 7ecc590057ed2a75208183cfd6234616268fa2b1af2dc90ae740756ef7d3d489 [2022-02-21 04:35:33,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:35:33,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:35:33,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:35:33,585 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:35:33,586 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:35:33,587 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/stroeder1-alloca-1.i [2022-02-21 04:35:33,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12463a0e6/8dcaa6310af044f4963f8078a6b6a2bd/FLAGec88f6e6a [2022-02-21 04:35:34,139 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:35:34,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/stroeder1-alloca-1.i [2022-02-21 04:35:34,148 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12463a0e6/8dcaa6310af044f4963f8078a6b6a2bd/FLAGec88f6e6a [2022-02-21 04:35:34,514 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12463a0e6/8dcaa6310af044f4963f8078a6b6a2bd [2022-02-21 04:35:34,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:35:34,518 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:35:34,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:34,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:35:34,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:35:34,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:34" (1/1) ... [2022-02-21 04:35:34,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@643bb10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:34, skipping insertion in model container [2022-02-21 04:35:34,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:34" (1/1) ... [2022-02-21 04:35:34,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:35:34,571 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:35:34,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:34,922 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:35:34,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:34,988 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:35:34,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:34 WrapperNode [2022-02-21 04:35:34,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:34,995 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:34,995 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:35:34,995 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:35:35,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:34" (1/1) ... [2022-02-21 04:35:35,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:34" (1/1) ... [2022-02-21 04:35:35,041 INFO L137 Inliner]: procedures = 116, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 50 [2022-02-21 04:35:35,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:35,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:35:35,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:35:35,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:35:35,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:34" (1/1) ... [2022-02-21 04:35:35,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:34" (1/1) ... [2022-02-21 04:35:35,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:34" (1/1) ... [2022-02-21 04:35:35,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:34" (1/1) ... [2022-02-21 04:35:35,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:34" (1/1) ... [2022-02-21 04:35:35,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:34" (1/1) ... [2022-02-21 04:35:35,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:34" (1/1) ... [2022-02-21 04:35:35,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:35:35,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:35:35,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:35:35,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:35:35,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:34" (1/1) ... [2022-02-21 04:35:35,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:35,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:35,117 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:35,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:35:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:35:35,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:35:35,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:35:35,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:35:35,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:35:35,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:35:35,225 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:35:35,226 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:35:35,392 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:35:35,395 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:35:35,395 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 04:35:35,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:35 BoogieIcfgContainer [2022-02-21 04:35:35,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:35:35,397 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:35:35,397 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:35:35,413 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:35:35,413 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:35,414 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:35:34" (1/3) ... [2022-02-21 04:35:35,414 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58deb07d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:35, skipping insertion in model container [2022-02-21 04:35:35,415 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:35,415 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:34" (2/3) ... [2022-02-21 04:35:35,415 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58deb07d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:35, skipping insertion in model container [2022-02-21 04:35:35,415 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:35,415 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:35" (3/3) ... [2022-02-21 04:35:35,416 INFO L388 chiAutomizerObserver]: Analyzing ICFG stroeder1-alloca-1.i [2022-02-21 04:35:35,464 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:35:35,471 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:35:35,473 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:35:35,473 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:35:35,473 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:35:35,473 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:35:35,473 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:35:35,473 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:35:35,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:35,502 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:35:35,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:35,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:35,505 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 04:35:35,506 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:35,506 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:35:35,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:35,510 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:35:35,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:35,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:35,511 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 04:35:35,511 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:35,515 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10#L526true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 4#L526-2true call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~i~1#1 := 0; 5#L531-3true [2022-02-21 04:35:35,515 INFO L793 eck$LassoCheckResult]: Loop: 5#L531-3true assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet7#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; 11#L531-2true main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 5#L531-3true [2022-02-21 04:35:35,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:35,522 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-02-21 04:35:35,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:35,528 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117177584] [2022-02-21 04:35:35,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:35,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:35,608 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:35,631 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:35,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:35,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2022-02-21 04:35:35,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:35,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381801733] [2022-02-21 04:35:35,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:35,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:35,672 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:35,693 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:35,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:35,697 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2022-02-21 04:35:35,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:35,698 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831264566] [2022-02-21 04:35:35,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:35,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:35,754 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:35,783 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:36,107 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:36,108 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:36,108 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:36,108 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:36,108 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:36,108 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:36,108 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:36,109 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:36,109 INFO L133 ssoRankerPreferences]: Filename of dumped script: stroeder1-alloca-1.i_Iteration1_Lasso [2022-02-21 04:35:36,109 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:36,109 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:36,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:36,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:36,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:36,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:36,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:36,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:36,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:36,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:36,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:36,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:36,697 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:36,701 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:36,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:36,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:36,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:36,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:35:36,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:36,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:36,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:36,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:36,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:36,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:36,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:36,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:36,771 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:36,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 04:35:36,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:36,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:36,791 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:36,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:35:36,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:36,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:36,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:36,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:36,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:36,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:36,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:36,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:36,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:36,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:36,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:36,850 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:36,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:35:36,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:36,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:36,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:36,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:36,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:36,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:36,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:36,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:36,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:36,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:36,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:36,916 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:36,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:35:36,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:36,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:36,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:36,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:36,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:36,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:36,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:36,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:36,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:36,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:36,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:36,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:36,954 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:36,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:35:36,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:36,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:36,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:36,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:36,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:36,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:36,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:36,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:36,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:36,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:36,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:37,000 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:37,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:35:37,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:37,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:37,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:37,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:37,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:37,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:37,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:37,037 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:37,096 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-02-21 04:35:37,096 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-02-21 04:35:37,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:37,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:37,107 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:37,129 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:37,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:35:37,164 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:37,164 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:37,164 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~array_size~0#1) = -1*ULTIMATE.start_main_~i~1#1 + 1*ULTIMATE.start_main_~array_size~0#1 Supporting invariants [] [2022-02-21 04:35:37,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:37,198 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-02-21 04:35:37,203 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet7#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1;" "main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" [2022-02-21 04:35:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:37,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:37,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:37,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:37,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {24#unseeded} is VALID [2022-02-21 04:35:37,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {24#unseeded} is VALID [2022-02-21 04:35:37,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#unseeded} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {24#unseeded} is VALID [2022-02-21 04:35:37,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#unseeded} call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~i~1#1 := 0; {24#unseeded} is VALID [2022-02-21 04:35:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:37,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:37,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:37,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(>= oldRank0 (+ |ULTIMATE.start_main_~array_size~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|)))} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet7#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {66#(and (>= oldRank0 (+ |ULTIMATE.start_main_~array_size~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|))) (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-21 04:35:37,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#(and (>= oldRank0 (+ |ULTIMATE.start_main_~array_size~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|))) (< |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|))} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {52#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~array_size~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|)))) unseeded)} is VALID [2022-02-21 04:35:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:37,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:37,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:37,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,339 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:35:37,340 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,397 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32 states and 42 transitions. Complement of second has 7 states. [2022-02-21 04:35:37,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:37,397 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:37,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,398 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:35:37,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:37,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:37,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,401 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:37,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:37,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:37,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2022-02-21 04:35:37,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:37,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:37,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:37,403 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,404 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:35:37,405 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:35:37,405 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,406 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:37,406 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:37,406 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 42 transitions. cyclomatic complexity: 14 [2022-02-21 04:35:37,407 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:37,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:37,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:37,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:37,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:37,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:37,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:37,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:37,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:37,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:37,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 32 letters. [2022-02-21 04:35:37,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 32 letters. [2022-02-21 04:35:37,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 32 letters. Loop has 32 letters. [2022-02-21 04:35:37,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 14 letters. [2022-02-21 04:35:37,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 14 letters. [2022-02-21 04:35:37,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 14 letters. [2022-02-21 04:35:37,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:37,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:37,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:37,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:37,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:37,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:37,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:37,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:37,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:37,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:37,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:37,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:37,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:37,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:37,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:37,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:37,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:37,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:37,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:37,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:37,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:37,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:37,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:37,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:37,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:37,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:37,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:37,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,431 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-02-21 04:35:37,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:37,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:37,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:37,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:37,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. cyclomatic complexity: 14 [2022-02-21 04:35:37,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:37,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 10 states and 13 transitions. [2022-02-21 04:35:37,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 04:35:37,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 04:35:37,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2022-02-21 04:35:37,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:37,441 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 04:35:37,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2022-02-21 04:35:37,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-02-21 04:35:37,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:37,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 13 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,455 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 13 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,456 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:37,458 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2022-02-21 04:35:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2022-02-21 04:35:37,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:37,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:37,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states and 13 transitions. [2022-02-21 04:35:37,459 INFO L87 Difference]: Start difference. First operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states and 13 transitions. [2022-02-21 04:35:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:37,459 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2022-02-21 04:35:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2022-02-21 04:35:37,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:37,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:37,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:37,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:37,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2022-02-21 04:35:37,461 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 04:35:37,461 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 04:35:37,461 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:35:37,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2022-02-21 04:35:37,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:37,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:37,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:37,462 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:35:37,462 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:37,462 INFO L791 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 118#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 119#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 112#L526-2 call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~i~1#1 := 0; 113#L531-3 assume !(main_~i~1#1 < main_~array_size~0#1); 115#L531-4 assume { :begin_inline_sumOfThirdBytes } true;sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset, sumOfThirdBytes_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sumOfThirdBytes_#res#1;havoc sumOfThirdBytes_#t~mem3#1, sumOfThirdBytes_#t~post2#1, sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset, sumOfThirdBytes_~array_size#1, sumOfThirdBytes_~i~0#1, sumOfThirdBytes_~sum~0#1, sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset := sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset;sumOfThirdBytes_~array_size#1 := sumOfThirdBytes_#in~array_size#1;havoc sumOfThirdBytes_~i~0#1;havoc sumOfThirdBytes_~sum~0#1;havoc sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~sum~0#1 := 0;sumOfThirdBytes_~i~0#1 := 0; 120#L517-3 [2022-02-21 04:35:37,462 INFO L793 eck$LassoCheckResult]: Loop: 120#L517-3 assume !!(sumOfThirdBytes_~i~0#1 < sumOfThirdBytes_~array_size#1);sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset + 4 * sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~p~0#1.base, 2 + sumOfThirdBytes_~p~0#1.offset;call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1);sumOfThirdBytes_~sum~0#1 := sumOfThirdBytes_~sum~0#1 + sumOfThirdBytes_#t~mem3#1;havoc sumOfThirdBytes_#t~mem3#1; 121#L517-2 sumOfThirdBytes_#t~post2#1 := sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~i~0#1 := 1 + sumOfThirdBytes_#t~post2#1;havoc sumOfThirdBytes_#t~post2#1; 120#L517-3 [2022-02-21 04:35:37,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:37,462 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2022-02-21 04:35:37,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:37,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103517885] [2022-02-21 04:35:37,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:37,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:37,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {145#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {145#true} is VALID [2022-02-21 04:35:37,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {145#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {145#true} is VALID [2022-02-21 04:35:37,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {145#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {147#(<= 1 |ULTIMATE.start_main_~array_size~0#1|)} is VALID [2022-02-21 04:35:37,507 INFO L290 TraceCheckUtils]: 3: Hoare triple {147#(<= 1 |ULTIMATE.start_main_~array_size~0#1|)} call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~i~1#1 := 0; {148#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-21 04:35:37,507 INFO L290 TraceCheckUtils]: 4: Hoare triple {148#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~array_size~0#1|))} assume !(main_~i~1#1 < main_~array_size~0#1); {146#false} is VALID [2022-02-21 04:35:37,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#false} assume { :begin_inline_sumOfThirdBytes } true;sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset, sumOfThirdBytes_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sumOfThirdBytes_#res#1;havoc sumOfThirdBytes_#t~mem3#1, sumOfThirdBytes_#t~post2#1, sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset, sumOfThirdBytes_~array_size#1, sumOfThirdBytes_~i~0#1, sumOfThirdBytes_~sum~0#1, sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset := sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset;sumOfThirdBytes_~array_size#1 := sumOfThirdBytes_#in~array_size#1;havoc sumOfThirdBytes_~i~0#1;havoc sumOfThirdBytes_~sum~0#1;havoc sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~sum~0#1 := 0;sumOfThirdBytes_~i~0#1 := 0; {146#false} is VALID [2022-02-21 04:35:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:37,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:37,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103517885] [2022-02-21 04:35:37,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103517885] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:37,508 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:37,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:35:37,509 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042473012] [2022-02-21 04:35:37,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:37,510 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:35:37,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:37,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2022-02-21 04:35:37,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:37,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146385285] [2022-02-21 04:35:37,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:37,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,517 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,521 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:37,575 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:37,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:35:37,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:35:37,577 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:37,633 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2022-02-21 04:35:37,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:35:37,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:37,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:37,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2022-02-21 04:35:37,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:37,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2022-02-21 04:35:37,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 04:35:37,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 04:35:37,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2022-02-21 04:35:37,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:37,645 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-02-21 04:35:37,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2022-02-21 04:35:37,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2022-02-21 04:35:37,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:37,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 13 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,646 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 13 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,646 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:37,646 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2022-02-21 04:35:37,647 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2022-02-21 04:35:37,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:37,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:37,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 13 transitions. [2022-02-21 04:35:37,647 INFO L87 Difference]: Start difference. First operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 13 transitions. [2022-02-21 04:35:37,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:37,648 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2022-02-21 04:35:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2022-02-21 04:35:37,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:37,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:37,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:37,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:37,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2022-02-21 04:35:37,649 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2022-02-21 04:35:37,649 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2022-02-21 04:35:37,649 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:35:37,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2022-02-21 04:35:37,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:37,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:37,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:37,650 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:37,650 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:37,650 INFO L791 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 168#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 169#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 162#L526-2 call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~i~1#1 := 0; 163#L531-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet7#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; 164#L531-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 165#L531-3 assume !(main_~i~1#1 < main_~array_size~0#1); 166#L531-4 assume { :begin_inline_sumOfThirdBytes } true;sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset, sumOfThirdBytes_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sumOfThirdBytes_#res#1;havoc sumOfThirdBytes_#t~mem3#1, sumOfThirdBytes_#t~post2#1, sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset, sumOfThirdBytes_~array_size#1, sumOfThirdBytes_~i~0#1, sumOfThirdBytes_~sum~0#1, sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset := sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset;sumOfThirdBytes_~array_size#1 := sumOfThirdBytes_#in~array_size#1;havoc sumOfThirdBytes_~i~0#1;havoc sumOfThirdBytes_~sum~0#1;havoc sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~sum~0#1 := 0;sumOfThirdBytes_~i~0#1 := 0; 170#L517-3 [2022-02-21 04:35:37,650 INFO L793 eck$LassoCheckResult]: Loop: 170#L517-3 assume !!(sumOfThirdBytes_~i~0#1 < sumOfThirdBytes_~array_size#1);sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset + 4 * sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~p~0#1.base, 2 + sumOfThirdBytes_~p~0#1.offset;call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1);sumOfThirdBytes_~sum~0#1 := sumOfThirdBytes_~sum~0#1 + sumOfThirdBytes_#t~mem3#1;havoc sumOfThirdBytes_#t~mem3#1; 171#L517-2 sumOfThirdBytes_#t~post2#1 := sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~i~0#1 := 1 + sumOfThirdBytes_#t~post2#1;havoc sumOfThirdBytes_#t~post2#1; 170#L517-3 [2022-02-21 04:35:37,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:37,651 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2022-02-21 04:35:37,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:37,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712940395] [2022-02-21 04:35:37,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:37,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,673 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,687 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:37,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:37,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2022-02-21 04:35:37,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:37,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676126831] [2022-02-21 04:35:37,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:37,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,696 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,701 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:37,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:37,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2022-02-21 04:35:37,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:37,702 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889980018] [2022-02-21 04:35:37,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:37,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,721 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:37,737 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:38,104 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:38,105 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:38,105 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:38,105 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:38,105 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:38,105 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:38,105 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:38,105 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:38,105 INFO L133 ssoRankerPreferences]: Filename of dumped script: stroeder1-alloca-1.i_Iteration3_Lasso [2022-02-21 04:35:38,105 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:38,105 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:38,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,309 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:38,311 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:38,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:38,656 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:38,656 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:38,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:38,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:38,658 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:38,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:38,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:38,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:38,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:38,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:38,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:38,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:38,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:38,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:35:38,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:38,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:38,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:38,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:38,719 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:38,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:35:38,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:38,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:38,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:38,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:38,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:38,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:38,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:38,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:38,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:38,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:38,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:38,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:38,781 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) [2022-02-21 04:35:38,782 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 [2022-02-21 04:35:38,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:38,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:38,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:38,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:38,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:38,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:38,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:38,793 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:38,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:38,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:38,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:38,812 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) [2022-02-21 04:35:38,813 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 [2022-02-21 04:35:38,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:38,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:38,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:38,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:38,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:38,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:38,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:38,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:38,868 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 [2022-02-21 04:35:38,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:38,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:38,870 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) [2022-02-21 04:35:38,871 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 [2022-02-21 04:35:38,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:38,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:38,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:38,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:38,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:38,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:38,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:38,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:38,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:38,914 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 [2022-02-21 04:35:38,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:38,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:38,915 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) [2022-02-21 04:35:38,916 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 [2022-02-21 04:35:38,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:38,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:38,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:38,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:38,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:38,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:38,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:38,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:38,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:38,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:38,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:38,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:38,956 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) [2022-02-21 04:35:38,957 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 [2022-02-21 04:35:38,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:38,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:38,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:38,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:38,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:38,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:38,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:38,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:38,999 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 [2022-02-21 04:35:39,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,001 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) [2022-02-21 04:35:39,002 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 [2022-02-21 04:35:39,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:39,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:39,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:39,052 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 [2022-02-21 04:35:39,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,054 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) [2022-02-21 04:35:39,055 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 [2022-02-21 04:35:39,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:39,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:39,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:39,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:39,084 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 [2022-02-21 04:35:39,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,085 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) [2022-02-21 04:35:39,086 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 [2022-02-21 04:35:39,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:39,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:39,110 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:39,132 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 [2022-02-21 04:35:39,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,134 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) [2022-02-21 04:35:39,135 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 [2022-02-21 04:35:39,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:39,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:39,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:39,189 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 [2022-02-21 04:35:39,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,190 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) [2022-02-21 04:35:39,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:39,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:39,214 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 [2022-02-21 04:35:39,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:39,238 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 [2022-02-21 04:35:39,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,239 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) [2022-02-21 04:35:39,240 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 [2022-02-21 04:35:39,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,284 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:39,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:39,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:39,336 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 [2022-02-21 04:35:39,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,337 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:39,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 04:35:39,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:39,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:39,365 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:39,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:39,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,436 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:39,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 04:35:39,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:39,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:39,461 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:39,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:39,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,479 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:39,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 04:35:39,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:39,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:39,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:39,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:39,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:39,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,530 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:39,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 04:35:39,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:39,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:39,561 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:39,572 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 04:35:39,572 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-02-21 04:35:39,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,582 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:39,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 04:35:39,601 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:39,631 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:39,631 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:39,632 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sumOfThirdBytes_~i~0#1, ULTIMATE.start_sumOfThirdBytes_~array_size#1) = -1*ULTIMATE.start_sumOfThirdBytes_~i~0#1 + 1*ULTIMATE.start_sumOfThirdBytes_~array_size#1 Supporting invariants [] [2022-02-21 04:35:39,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:39,678 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2022-02-21 04:35:39,681 INFO L390 LassoCheck]: Loop: "assume !!(sumOfThirdBytes_~i~0#1 < sumOfThirdBytes_~array_size#1);sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset + 4 * sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~p~0#1.base, 2 + sumOfThirdBytes_~p~0#1.offset;call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1);sumOfThirdBytes_~sum~0#1 := sumOfThirdBytes_~sum~0#1 + sumOfThirdBytes_#t~mem3#1;havoc sumOfThirdBytes_#t~mem3#1;" "sumOfThirdBytes_#t~post2#1 := sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~i~0#1 := 1 + sumOfThirdBytes_#t~post2#1;havoc sumOfThirdBytes_#t~post2#1;" [2022-02-21 04:35:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:39,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:39,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:39,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:39,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {203#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {203#unseeded} is VALID [2022-02-21 04:35:39,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~nondet7#1, main_#t~post6#1, main_~i~1#1, main_#t~ret8#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {203#unseeded} is VALID [2022-02-21 04:35:39,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {203#unseeded} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {203#unseeded} is VALID [2022-02-21 04:35:39,726 INFO L290 TraceCheckUtils]: 3: Hoare triple {203#unseeded} call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~i~1#1 := 0; {203#unseeded} is VALID [2022-02-21 04:35:39,727 INFO L290 TraceCheckUtils]: 4: Hoare triple {203#unseeded} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet7#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet7#1; {203#unseeded} is VALID [2022-02-21 04:35:39,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {203#unseeded} main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {203#unseeded} is VALID [2022-02-21 04:35:39,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {203#unseeded} assume !(main_~i~1#1 < main_~array_size~0#1); {203#unseeded} is VALID [2022-02-21 04:35:39,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {203#unseeded} assume { :begin_inline_sumOfThirdBytes } true;sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset, sumOfThirdBytes_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sumOfThirdBytes_#res#1;havoc sumOfThirdBytes_#t~mem3#1, sumOfThirdBytes_#t~post2#1, sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset, sumOfThirdBytes_~array_size#1, sumOfThirdBytes_~i~0#1, sumOfThirdBytes_~sum~0#1, sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset := sumOfThirdBytes_#in~numbers#1.base, sumOfThirdBytes_#in~numbers#1.offset;sumOfThirdBytes_~array_size#1 := sumOfThirdBytes_#in~array_size#1;havoc sumOfThirdBytes_~i~0#1;havoc sumOfThirdBytes_~sum~0#1;havoc sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset;sumOfThirdBytes_~sum~0#1 := 0;sumOfThirdBytes_~i~0#1 := 0; {203#unseeded} is VALID [2022-02-21 04:35:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:39,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:39,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:39,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {206#(>= oldRank0 (+ |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (* (- 1) |ULTIMATE.start_sumOfThirdBytes_~i~0#1|)))} assume !!(sumOfThirdBytes_~i~0#1 < sumOfThirdBytes_~array_size#1);sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~#numbers#1.base, sumOfThirdBytes_~#numbers#1.offset + 4 * sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset := sumOfThirdBytes_~p~0#1.base, 2 + sumOfThirdBytes_~p~0#1.offset;call sumOfThirdBytes_#t~mem3#1 := read~int(sumOfThirdBytes_~p~0#1.base, sumOfThirdBytes_~p~0#1.offset, 1);sumOfThirdBytes_~sum~0#1 := sumOfThirdBytes_~sum~0#1 + sumOfThirdBytes_#t~mem3#1;havoc sumOfThirdBytes_#t~mem3#1; {252#(and (< |ULTIMATE.start_sumOfThirdBytes_~i~0#1| |ULTIMATE.start_sumOfThirdBytes_~array_size#1|) (>= oldRank0 (+ |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (* (- 1) |ULTIMATE.start_sumOfThirdBytes_~i~0#1|))))} is VALID [2022-02-21 04:35:39,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {252#(and (< |ULTIMATE.start_sumOfThirdBytes_~i~0#1| |ULTIMATE.start_sumOfThirdBytes_~array_size#1|) (>= oldRank0 (+ |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (* (- 1) |ULTIMATE.start_sumOfThirdBytes_~i~0#1|))))} sumOfThirdBytes_#t~post2#1 := sumOfThirdBytes_~i~0#1;sumOfThirdBytes_~i~0#1 := 1 + sumOfThirdBytes_#t~post2#1;havoc sumOfThirdBytes_#t~post2#1; {226#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_sumOfThirdBytes_~array_size#1| (* (- 1) |ULTIMATE.start_sumOfThirdBytes_~i~0#1|)))))} is VALID [2022-02-21 04:35:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:39,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:39,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:39,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,761 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:35:39,761 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,777 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 15 transitions. Complement of second has 4 states. [2022-02-21 04:35:39,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:39,778 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:39,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2022-02-21 04:35:39,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:39,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:39,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:39,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:39,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:39,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2022-02-21 04:35:39,779 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:39,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:39,779 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2022-02-21 04:35:39,779 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:39,779 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:39,779 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:39,780 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2022-02-21 04:35:39,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2022-02-21 04:35:39,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:39,780 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:35:39,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:39,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:39,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:39,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:39,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:39,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:39,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:35:39,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:35:39,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:35:39,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2022-02-21 04:35:39,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 10 letters. [2022-02-21 04:35:39,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 10 letters. [2022-02-21 04:35:39,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:39,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:39,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:39,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:39,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:39,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:39,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:39,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:39,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:39,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:39,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:39,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:39,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,809 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 04:35:39,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:39,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:39,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:39,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2022-02-21 04:35:39,822 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:39,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2022-02-21 04:35:39,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:35:39,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:35:39,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:35:39,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:39,822 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:39,822 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:39,822 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:39,823 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:35:39,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:35:39,823 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:39,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:39,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:35:39 BoogieIcfgContainer [2022-02-21 04:35:39,830 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:35:39,830 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:35:39,830 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:35:39,830 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:35:39,839 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:35" (3/4) ... [2022-02-21 04:35:39,841 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:35:39,842 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:35:39,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:39,843 INFO L158 Benchmark]: Toolchain (without parser) took 5324.25ms. Allocated memory was 81.8MB in the beginning and 144.7MB in the end (delta: 62.9MB). Free memory was 47.2MB in the beginning and 113.7MB in the end (delta: -66.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:39,843 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 81.8MB. Free memory was 61.2MB in the beginning and 61.2MB in the end (delta: 24.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:39,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.78ms. Allocated memory was 81.8MB in the beginning and 113.2MB in the end (delta: 31.5MB). Free memory was 47.0MB in the beginning and 81.7MB in the end (delta: -34.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:35:39,848 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.28ms. Allocated memory is still 113.2MB. Free memory was 81.7MB in the beginning and 80.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:39,849 INFO L158 Benchmark]: Boogie Preprocessor took 38.54ms. Allocated memory is still 113.2MB. Free memory was 80.1MB in the beginning and 78.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:39,849 INFO L158 Benchmark]: RCFGBuilder took 315.60ms. Allocated memory is still 113.2MB. Free memory was 78.5MB in the beginning and 67.0MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 04:35:39,850 INFO L158 Benchmark]: BuchiAutomizer took 4432.52ms. Allocated memory was 113.2MB in the beginning and 144.7MB in the end (delta: 31.5MB). Free memory was 67.0MB in the beginning and 114.9MB in the end (delta: -47.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:39,850 INFO L158 Benchmark]: Witness Printer took 11.67ms. Allocated memory is still 144.7MB. Free memory was 114.9MB in the beginning and 113.8MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:39,851 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 81.8MB. Free memory was 61.2MB in the beginning and 61.2MB in the end (delta: 24.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 473.78ms. Allocated memory was 81.8MB in the beginning and 113.2MB in the end (delta: 31.5MB). Free memory was 47.0MB in the beginning and 81.7MB in the end (delta: -34.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.28ms. Allocated memory is still 113.2MB. Free memory was 81.7MB in the beginning and 80.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.54ms. Allocated memory is still 113.2MB. Free memory was 80.1MB in the beginning and 78.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 315.60ms. Allocated memory is still 113.2MB. Free memory was 78.5MB in the beginning and 67.0MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 4432.52ms. Allocated memory was 113.2MB in the beginning and 144.7MB in the end (delta: 31.5MB). Free memory was 67.0MB in the beginning and 114.9MB in the end (delta: -47.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 11.67ms. Allocated memory is still 144.7MB. Free memory was 114.9MB in the beginning and 113.8MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function array_size + -1 * i and consists of 5 locations. One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 27 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital128 mio100 ax114 hnf100 lsp82 ukn82 mio100 lsp62 div134 bol100 ite100 ukn100 eq163 hnf92 smp81 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 43ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:35:39,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE