./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0e00bd958aa9fbd5730471fb19c0f431fb9410b6f9738fcfd6ac5e9594f9dc7f --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:18:47,392 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:18:47,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:18:47,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:18:47,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:18:47,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:18:47,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:18:47,431 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:18:47,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:18:47,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:18:47,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:18:47,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:18:47,440 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:18:47,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:18:47,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:18:47,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:18:47,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:18:47,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:18:47,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:18:47,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:18:47,457 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:18:47,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:18:47,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:18:47,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:18:47,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:18:47,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:18:47,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:18:47,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:18:47,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:18:47,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:18:47,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:18:47,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:18:47,471 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:18:47,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:18:47,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:18:47,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:18:47,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:18:47,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:18:47,474 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:18:47,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:18:47,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:18:47,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:18:47,477 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-13 03:18:47,513 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:18:47,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:18:47,514 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:18:47,514 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:18:47,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:18:47,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:18:47,516 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:18:47,517 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:18:47,517 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:18:47,517 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:18:47,518 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:18:47,518 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:18:47,518 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:18:47,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:18:47,518 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:18:47,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:18:47,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:18:47,519 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:18:47,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:18:47,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:18:47,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:18:47,520 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:18:47,520 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:18:47,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:18:47,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:18:47,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:18:47,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:18:47,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:18:47,522 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:18:47,523 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e00bd958aa9fbd5730471fb19c0f431fb9410b6f9738fcfd6ac5e9594f9dc7f [2022-07-13 03:18:47,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:18:47,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:18:47,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:18:47,809 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:18:47,809 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:18:47,811 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i [2022-07-13 03:18:47,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc74ce838/8cbef9484d4146e880448ae4e9fa2607/FLAGa158e392b [2022-07-13 03:18:48,359 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:18:48,360 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i [2022-07-13 03:18:48,371 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc74ce838/8cbef9484d4146e880448ae4e9fa2607/FLAGa158e392b [2022-07-13 03:18:48,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc74ce838/8cbef9484d4146e880448ae4e9fa2607 [2022-07-13 03:18:48,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:18:48,695 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:18:48,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:18:48,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:18:48,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:18:48,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:18:48" (1/1) ... [2022-07-13 03:18:48,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e5298e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:48, skipping insertion in model container [2022-07-13 03:18:48,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:18:48" (1/1) ... [2022-07-13 03:18:48,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:18:48,746 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:18:49,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:18:49,017 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:18:49,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:18:49,095 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:18:49,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:49 WrapperNode [2022-07-13 03:18:49,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:18:49,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:18:49,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:18:49,097 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:18:49,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:49" (1/1) ... [2022-07-13 03:18:49,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:49" (1/1) ... [2022-07-13 03:18:49,144 INFO L137 Inliner]: procedures = 111, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 120 [2022-07-13 03:18:49,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:18:49,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:18:49,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:18:49,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:18:49,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:49" (1/1) ... [2022-07-13 03:18:49,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:49" (1/1) ... [2022-07-13 03:18:49,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:49" (1/1) ... [2022-07-13 03:18:49,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:49" (1/1) ... [2022-07-13 03:18:49,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:49" (1/1) ... [2022-07-13 03:18:49,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:49" (1/1) ... [2022-07-13 03:18:49,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:49" (1/1) ... [2022-07-13 03:18:49,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:18:49,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:18:49,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:18:49,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:18:49,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:49" (1/1) ... [2022-07-13 03:18:49,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:49,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:49,229 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-07-13 03:18:49,236 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-07-13 03:18:49,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 03:18:49,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 03:18:49,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 03:18:49,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 03:18:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:18:49,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:18:49,354 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:18:49,355 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:18:49,557 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:18:49,561 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:18:49,562 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 03:18:49,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:18:49 BoogieIcfgContainer [2022-07-13 03:18:49,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:18:49,564 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:18:49,564 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:18:49,574 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:18:49,575 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:18:49,576 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:18:48" (1/3) ... [2022-07-13 03:18:49,577 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@274646d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:18:49, skipping insertion in model container [2022-07-13 03:18:49,577 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:18:49,577 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:49" (2/3) ... [2022-07-13 03:18:49,578 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@274646d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:18:49, skipping insertion in model container [2022-07-13 03:18:49,578 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:18:49,578 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:18:49" (3/3) ... [2022-07-13 03:18:49,579 INFO L354 chiAutomizerObserver]: Analyzing ICFG a.06-alloca.i [2022-07-13 03:18:49,647 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:18:49,647 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:18:49,647 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:18:49,648 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:18:49,648 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:18:49,648 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:18:49,648 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:18:49,648 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:18:49,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:18:49,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-13 03:18:49,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:18:49,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:18:49,682 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:18:49,683 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:18:49,683 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:18:49,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:18:49,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-13 03:18:49,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:18:49,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:18:49,687 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:18:49,688 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:18:49,693 INFO L752 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 19#L557-20true [2022-07-13 03:18:49,695 INFO L754 eck$LassoCheckResult]: Loop: 19#L557-20true call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 17#L557-1true assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 16#L557-3true test_fun_#t~short14#1 := test_fun_#t~short9#1; 8#L557-4true assume test_fun_#t~short14#1; 15#L557-9true test_fun_#t~short18#1 := test_fun_#t~short14#1; 14#L557-10true assume !test_fun_#t~short18#1; 12#L557-12true test_fun_#t~short20#1 := test_fun_#t~short18#1; 18#L557-13true assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 10#L557-15true test_fun_#t~short22#1 := test_fun_#t~short20#1; 6#L557-16true assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 20#L557-18true assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 19#L557-20true [2022-07-13 03:18:49,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:18:49,706 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 03:18:49,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:18:49,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764492280] [2022-07-13 03:18:49,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:18:49,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:18:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:49,867 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:18:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:49,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:18:49,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:18:49,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1442805661, now seen corresponding path program 1 times [2022-07-13 03:18:49,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:18:49,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140254101] [2022-07-13 03:18:49,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:18:49,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:18:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:18:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:18:50,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:18:50,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140254101] [2022-07-13 03:18:50,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140254101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:18:50,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:18:50,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 03:18:50,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180921969] [2022-07-13 03:18:50,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:18:50,036 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:18:50,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:18:50,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:18:50,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 03:18:50,080 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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-07-13 03:18:50,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:18:50,133 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-07-13 03:18:50,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 03:18:50,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2022-07-13 03:18:50,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-07-13 03:18:50,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 30 transitions. [2022-07-13 03:18:50,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-07-13 03:18:50,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2022-07-13 03:18:50,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2022-07-13 03:18:50,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:18:50,152 INFO L369 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-07-13 03:18:50,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2022-07-13 03:18:50,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2022-07-13 03:18:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:18:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-07-13 03:18:50,170 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-07-13 03:18:50,170 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-07-13 03:18:50,170 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:18:50,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2022-07-13 03:18:50,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2022-07-13 03:18:50,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:18:50,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:18:50,171 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:18:50,171 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:18:50,172 INFO L752 eck$LassoCheckResult]: Stem: 61#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 62#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 65#L557-20 [2022-07-13 03:18:50,172 INFO L754 eck$LassoCheckResult]: Loop: 65#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 74#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 73#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 66#L557-4 assume test_fun_#t~short14#1; 67#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 72#L557-10 assume test_fun_#t~short18#1;call test_fun_#t~mem17#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem16#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short18#1 := test_fun_#t~mem17#1 > test_fun_#t~mem15#1 + test_fun_#t~mem16#1; 70#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 71#L557-13 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 69#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 63#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 64#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 65#L557-20 [2022-07-13 03:18:50,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:18:50,174 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-13 03:18:50,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:18:50,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619201361] [2022-07-13 03:18:50,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:18:50,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:18:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:50,235 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:18:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:50,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:18:50,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:18:50,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1500063963, now seen corresponding path program 1 times [2022-07-13 03:18:50,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:18:50,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527755970] [2022-07-13 03:18:50,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:18:50,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:18:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:50,326 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:18:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:50,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:18:50,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:18:50,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1876539869, now seen corresponding path program 1 times [2022-07-13 03:18:50,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:18:50,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107843520] [2022-07-13 03:18:50,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:18:50,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:18:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:50,404 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:18:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:50,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:18:51,866 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:18:51,867 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:18:51,867 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:18:51,867 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:18:51,867 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:18:51,867 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:51,868 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:18:51,868 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:18:51,868 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.06-alloca.i_Iteration2_Lasso [2022-07-13 03:18:51,868 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:18:51,868 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:18:51,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:51,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:51,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:51,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:51,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:51,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:51,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:51,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:51,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:51,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:51,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:51,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:51,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:51,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:51,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:52,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:52,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:52,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:52,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:52,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:52,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:52,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:52,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:52,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:52,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:52,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:52,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:52,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:52,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:53,198 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:18:53,203 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:18:53,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:53,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:53,215 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-07-13 03:18:53,223 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-07-13 03:18:53,224 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-07-13 03:18:53,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:53,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:18:53,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:53,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:53,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:53,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:18:53,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:18:53,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:53,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-13 03:18:53,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:53,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:53,253 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-07-13 03:18:53,260 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-07-13 03:18:53,261 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-07-13 03:18:53,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:53,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:18:53,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:53,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:53,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:53,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:18:53,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:18:53,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:53,291 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-07-13 03:18:53,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:53,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:53,293 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-07-13 03:18:53,294 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-07-13 03:18:53,295 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-07-13 03:18:53,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:53,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:18:53,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:53,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:53,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:53,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:18:53,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:18:53,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:53,319 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-07-13 03:18:53,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:53,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:53,320 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-07-13 03:18:53,321 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-07-13 03:18:53,323 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-07-13 03:18:53,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:53,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:18:53,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:53,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:53,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:53,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:18:53,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:18:53,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:53,382 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-07-13 03:18:53,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:53,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:53,384 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-07-13 03:18:53,384 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-07-13 03:18:53,386 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-07-13 03:18:53,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:53,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:18:53,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:53,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:53,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:53,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:18:53,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:18:53,408 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:53,424 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-07-13 03:18:53,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:53,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:53,426 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-07-13 03:18:53,435 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-07-13 03:18:53,442 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-07-13 03:18:53,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:53,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:18:53,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:53,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:53,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:53,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:18:53,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:18:53,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:53,472 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-07-13 03:18:53,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:53,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:53,474 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-07-13 03:18:53,474 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-07-13 03:18:53,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:18:53,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:53,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:53,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:53,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:53,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:18:53,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:18:53,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:53,529 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-07-13 03:18:53,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:53,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:53,530 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-07-13 03:18:53,531 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-07-13 03:18:53,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-07-13 03:18:53,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:53,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:53,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:53,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:53,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:18:53,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:18:53,569 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:53,594 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-07-13 03:18:53,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:53,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:53,596 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-07-13 03:18:53,597 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-07-13 03:18:53,598 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-07-13 03:18:53,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:53,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:18:53,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:53,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:53,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:53,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:18:53,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:18:53,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:53,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-13 03:18:53,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:53,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:53,623 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-07-13 03:18:53,624 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-07-13 03:18:53,658 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-07-13 03:18:53,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:53,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:18:53,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:53,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:53,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:53,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:18:53,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:18:53,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:53,687 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-07-13 03:18:53,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:53,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:53,688 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-07-13 03:18:53,689 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-07-13 03:18:53,691 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-07-13 03:18:53,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:53,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:18:53,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:53,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:53,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:53,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:18:53,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:18:53,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:53,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-13 03:18:53,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:53,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:53,716 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-07-13 03:18:53,717 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-07-13 03:18:53,718 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-07-13 03:18:53,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:53,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:18:53,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:53,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:53,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:53,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:18:53,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:18:53,726 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:53,744 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-07-13 03:18:53,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:53,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:53,745 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-07-13 03:18:53,746 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-07-13 03:18:53,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-07-13 03:18:53,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:53,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:18:53,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:53,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:53,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:53,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:18:53,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:18:53,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:53,808 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-07-13 03:18:53,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:53,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:53,809 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-07-13 03:18:53,810 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-07-13 03:18:53,812 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-07-13 03:18:53,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:53,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:53,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:53,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:53,819 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:18:53,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:18:53,829 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:53,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-13 03:18:53,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:53,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:53,849 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-07-13 03:18:53,850 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-07-13 03:18:53,851 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-07-13 03:18:53,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:53,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:53,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:53,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:53,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:18:53,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:18:53,888 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:18:53,949 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-13 03:18:53,949 INFO L444 ModelExtractionUtils]: 13 out of 40 variables were initially zero. Simplification set additionally 24 variables to zero. [2022-07-13 03:18:53,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:53,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:53,960 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-07-13 03:18:53,988 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:18:53,996 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-07-13 03:18:54,006 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:18:54,007 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:18:54,007 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_1 + 4294967293 Supporting invariants [] [2022-07-13 03:18:54,054 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-07-13 03:18:54,172 INFO L293 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2022-07-13 03:18:54,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:18:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:18:54,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:18:54,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:18:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:18:54,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-13 03:18:54,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:18:54,439 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-07-13 03:18:54,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:18:54,469 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-07-13 03:18:54,470 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-07-13 03:18:54,622 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Result 73 states and 101 transitions. Complement of second has 12 states. [2022-07-13 03:18:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2022-07-13 03:18:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-07-13 03:18:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-07-13 03:18:54,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 2 letters. Loop has 11 letters. [2022-07-13 03:18:54,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:18:54,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 13 letters. Loop has 11 letters. [2022-07-13 03:18:54,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:18:54,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 2 letters. Loop has 22 letters. [2022-07-13 03:18:54,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:18:54,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 101 transitions. [2022-07-13 03:18:54,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2022-07-13 03:18:54,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 66 states and 92 transitions. [2022-07-13 03:18:54,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-13 03:18:54,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-07-13 03:18:54,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 92 transitions. [2022-07-13 03:18:54,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:18:54,633 INFO L369 hiAutomatonCegarLoop]: Abstraction has 66 states and 92 transitions. [2022-07-13 03:18:54,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 92 transitions. [2022-07-13 03:18:54,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 45. [2022-07-13 03:18:54,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 44 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:18:54,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-07-13 03:18:54,637 INFO L392 hiAutomatonCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-07-13 03:18:54,637 INFO L374 stractBuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-07-13 03:18:54,638 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:18:54,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 62 transitions. [2022-07-13 03:18:54,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2022-07-13 03:18:54,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:18:54,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:18:54,639 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 03:18:54,639 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:18:54,640 INFO L752 eck$LassoCheckResult]: Stem: 376#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 377#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 382#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 401#L557-1 [2022-07-13 03:18:54,640 INFO L754 eck$LassoCheckResult]: Loop: 401#L557-1 assume !test_fun_#t~short9#1; 397#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 398#L557-4 assume test_fun_#t~short14#1; 416#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 394#L557-10 assume test_fun_#t~short18#1;call test_fun_#t~mem17#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem16#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short18#1 := test_fun_#t~mem17#1 > test_fun_#t~mem15#1 + test_fun_#t~mem16#1; 390#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 391#L557-13 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 388#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 378#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 379#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 405#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 401#L557-1 [2022-07-13 03:18:54,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:18:54,641 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2022-07-13 03:18:54,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:18:54,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012818853] [2022-07-13 03:18:54,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:18:54,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:18:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:54,673 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:18:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:54,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:18:54,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:18:54,707 INFO L85 PathProgramCache]: Analyzing trace with hash 962628681, now seen corresponding path program 1 times [2022-07-13 03:18:54,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:18:54,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400111670] [2022-07-13 03:18:54,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:18:54,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:18:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:18:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:18:54,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:18:54,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400111670] [2022-07-13 03:18:54,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400111670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:18:54,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:18:54,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:18:54,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410078539] [2022-07-13 03:18:54,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:18:54,735 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:18:54,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:18:54,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:18:54,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 03:18:54,736 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. cyclomatic complexity: 19 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-07-13 03:18:54,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:18:54,761 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2022-07-13 03:18:54,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 03:18:54,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 82 transitions. [2022-07-13 03:18:54,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2022-07-13 03:18:54,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 82 transitions. [2022-07-13 03:18:54,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-07-13 03:18:54,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-07-13 03:18:54,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 82 transitions. [2022-07-13 03:18:54,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:18:54,765 INFO L369 hiAutomatonCegarLoop]: Abstraction has 59 states and 82 transitions. [2022-07-13 03:18:54,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 82 transitions. [2022-07-13 03:18:54,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2022-07-13 03:18:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:18:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2022-07-13 03:18:54,768 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 54 transitions. [2022-07-13 03:18:54,768 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2022-07-13 03:18:54,768 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:18:54,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2022-07-13 03:18:54,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-13 03:18:54,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:18:54,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:18:54,769 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 03:18:54,769 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:18:54,770 INFO L752 eck$LassoCheckResult]: Stem: 489#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 490#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 495#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 510#L557-1 [2022-07-13 03:18:54,770 INFO L754 eck$LassoCheckResult]: Loop: 510#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 508#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 496#L557-4 assume !test_fun_#t~short14#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem10#1 < 0; 497#L557-6 assume test_fun_#t~short13#1;call test_fun_#t~mem12#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem12#1 > -2147483648 - test_fun_#t~mem11#1; 485#L557-8 test_fun_#t~short14#1 := test_fun_#t~short13#1; 486#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 506#L557-10 assume !test_fun_#t~short18#1; 502#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 503#L557-13 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 500#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 491#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 492#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 513#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 510#L557-1 [2022-07-13 03:18:54,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:18:54,770 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2022-07-13 03:18:54,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:18:54,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934994738] [2022-07-13 03:18:54,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:18:54,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:18:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:54,792 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:18:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:54,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:18:54,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:18:54,815 INFO L85 PathProgramCache]: Analyzing trace with hash 623036047, now seen corresponding path program 1 times [2022-07-13 03:18:54,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:18:54,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035124407] [2022-07-13 03:18:54,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:18:54,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:18:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:18:54,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:18:54,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:18:54,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035124407] [2022-07-13 03:18:54,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035124407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:18:54,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:18:54,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 03:18:54,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231440881] [2022-07-13 03:18:54,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:18:54,838 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:18:54,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:18:54,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:18:54,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 03:18:54,839 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. cyclomatic complexity: 17 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-07-13 03:18:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:18:54,862 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2022-07-13 03:18:54,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 03:18:54,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 78 transitions. [2022-07-13 03:18:54,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2022-07-13 03:18:54,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 78 transitions. [2022-07-13 03:18:54,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-07-13 03:18:54,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-13 03:18:54,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 78 transitions. [2022-07-13 03:18:54,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:18:54,866 INFO L369 hiAutomatonCegarLoop]: Abstraction has 58 states and 78 transitions. [2022-07-13 03:18:54,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 78 transitions. [2022-07-13 03:18:54,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2022-07-13 03:18:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 42 states have internal predecessors, (58), 0 states have call successors, (0), 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-07-13 03:18:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2022-07-13 03:18:54,869 INFO L392 hiAutomatonCegarLoop]: Abstraction has 43 states and 58 transitions. [2022-07-13 03:18:54,869 INFO L374 stractBuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2022-07-13 03:18:54,869 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:18:54,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 58 transitions. [2022-07-13 03:18:54,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2022-07-13 03:18:54,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:18:54,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:18:54,870 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 03:18:54,870 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:18:54,871 INFO L752 eck$LassoCheckResult]: Stem: 595#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 596#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 601#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 621#L557-1 [2022-07-13 03:18:54,871 INFO L754 eck$LassoCheckResult]: Loop: 621#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 618#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 602#L557-4 assume !test_fun_#t~short14#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem10#1 < 0; 603#L557-6 assume test_fun_#t~short13#1;call test_fun_#t~mem12#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem12#1 > -2147483648 - test_fun_#t~mem11#1; 591#L557-8 test_fun_#t~short14#1 := test_fun_#t~short13#1; 592#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 612#L557-10 assume test_fun_#t~short18#1;call test_fun_#t~mem17#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem16#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short18#1 := test_fun_#t~mem17#1 > test_fun_#t~mem15#1 + test_fun_#t~mem16#1; 608#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 609#L557-13 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 606#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 597#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 598#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 626#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 621#L557-1 [2022-07-13 03:18:54,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:18:54,871 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times [2022-07-13 03:18:54,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:18:54,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356058158] [2022-07-13 03:18:54,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:18:54,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:18:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:54,890 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:18:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:54,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:18:54,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:18:54,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1151971315, now seen corresponding path program 1 times [2022-07-13 03:18:54,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:18:54,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873957902] [2022-07-13 03:18:54,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:18:54,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:18:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:18:54,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:18:54,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:18:54,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873957902] [2022-07-13 03:18:54,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873957902] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:18:54,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:18:54,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 03:18:54,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004290876] [2022-07-13 03:18:54,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:18:54,969 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:18:54,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:18:54,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 03:18:54,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 03:18:54,970 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. cyclomatic complexity: 17 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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-07-13 03:18:55,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:18:55,174 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-07-13 03:18:55,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 03:18:55,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 140 transitions. [2022-07-13 03:18:55,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2022-07-13 03:18:55,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 87 states and 107 transitions. [2022-07-13 03:18:55,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2022-07-13 03:18:55,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2022-07-13 03:18:55,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 107 transitions. [2022-07-13 03:18:55,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:18:55,178 INFO L369 hiAutomatonCegarLoop]: Abstraction has 87 states and 107 transitions. [2022-07-13 03:18:55,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 107 transitions. [2022-07-13 03:18:55,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2022-07-13 03:18:55,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 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-07-13 03:18:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2022-07-13 03:18:55,182 INFO L392 hiAutomatonCegarLoop]: Abstraction has 47 states and 59 transitions. [2022-07-13 03:18:55,182 INFO L374 stractBuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2022-07-13 03:18:55,182 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:18:55,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2022-07-13 03:18:55,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2022-07-13 03:18:55,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:18:55,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:18:55,183 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 03:18:55,183 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:18:55,183 INFO L752 eck$LassoCheckResult]: Stem: 780#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 781#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 786#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 806#L557-1 [2022-07-13 03:18:55,183 INFO L754 eck$LassoCheckResult]: Loop: 806#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 803#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 804#L557-4 assume !test_fun_#t~short14#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem10#1 < 0; 793#L557-6 assume !test_fun_#t~short13#1; 776#L557-8 test_fun_#t~short14#1 := test_fun_#t~short13#1; 777#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 799#L557-10 assume !test_fun_#t~short18#1; 800#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 810#L557-13 assume !test_fun_#t~short20#1; 791#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 782#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 783#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 811#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 806#L557-1 [2022-07-13 03:18:55,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:18:55,184 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 4 times [2022-07-13 03:18:55,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:18:55,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513489048] [2022-07-13 03:18:55,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:18:55,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:18:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:55,207 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:18:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:55,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:18:55,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:18:55,220 INFO L85 PathProgramCache]: Analyzing trace with hash 231856079, now seen corresponding path program 1 times [2022-07-13 03:18:55,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:18:55,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666832947] [2022-07-13 03:18:55,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:18:55,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:18:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:18:55,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:18:55,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:18:55,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666832947] [2022-07-13 03:18:55,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666832947] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:18:55,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:18:55,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 03:18:55,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124850961] [2022-07-13 03:18:55,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:18:55,239 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:18:55,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:18:55,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:18:55,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 03:18:55,240 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-07-13 03:18:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:18:55,255 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-07-13 03:18:55,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 03:18:55,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 62 transitions. [2022-07-13 03:18:55,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-07-13 03:18:55,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 43 states and 50 transitions. [2022-07-13 03:18:55,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-13 03:18:55,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-13 03:18:55,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2022-07-13 03:18:55,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:18:55,257 INFO L369 hiAutomatonCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-07-13 03:18:55,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2022-07-13 03:18:55,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-13 03:18:55,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:18:55,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-07-13 03:18:55,259 INFO L392 hiAutomatonCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-07-13 03:18:55,259 INFO L374 stractBuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-07-13 03:18:55,260 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 03:18:55,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2022-07-13 03:18:55,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-07-13 03:18:55,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:18:55,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:18:55,261 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 03:18:55,261 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:18:55,261 INFO L752 eck$LassoCheckResult]: Stem: 889#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 890#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 895#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 913#L557-1 [2022-07-13 03:18:55,261 INFO L754 eck$LassoCheckResult]: Loop: 913#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 914#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 922#L557-4 assume !test_fun_#t~short14#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem10#1 < 0; 903#L557-6 assume !test_fun_#t~short13#1; 885#L557-8 test_fun_#t~short14#1 := test_fun_#t~short13#1; 886#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 908#L557-10 assume test_fun_#t~short18#1;call test_fun_#t~mem17#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem16#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short18#1 := test_fun_#t~mem17#1 > test_fun_#t~mem15#1 + test_fun_#t~mem16#1; 904#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 905#L557-13 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 901#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 891#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 892#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 917#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 913#L557-1 [2022-07-13 03:18:55,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:18:55,262 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 5 times [2022-07-13 03:18:55,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:18:55,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217189808] [2022-07-13 03:18:55,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:18:55,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:18:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:55,280 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:18:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:55,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:18:55,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:18:55,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1544998325, now seen corresponding path program 1 times [2022-07-13 03:18:55,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:18:55,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770391125] [2022-07-13 03:18:55,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:18:55,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:18:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:18:55,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:18:55,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:18:55,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770391125] [2022-07-13 03:18:55,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770391125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:18:55,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:18:55,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 03:18:55,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680071084] [2022-07-13 03:18:55,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:18:55,317 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:18:55,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:18:55,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 03:18:55,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 03:18:55,318 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:18:55,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:18:55,344 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-07-13 03:18:55,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 03:18:55,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 54 transitions. [2022-07-13 03:18:55,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-13 03:18:55,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 39 states and 42 transitions. [2022-07-13 03:18:55,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-13 03:18:55,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-13 03:18:55,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 42 transitions. [2022-07-13 03:18:55,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:18:55,347 INFO L369 hiAutomatonCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-07-13 03:18:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 42 transitions. [2022-07-13 03:18:55,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-07-13 03:18:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:18:55,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-07-13 03:18:55,349 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-07-13 03:18:55,349 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-07-13 03:18:55,349 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 03:18:55,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions. [2022-07-13 03:18:55,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-13 03:18:55,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:18:55,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:18:55,350 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 03:18:55,350 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:18:55,351 INFO L752 eck$LassoCheckResult]: Stem: 993#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 994#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 999#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 1015#L557-1 [2022-07-13 03:18:55,351 INFO L754 eck$LassoCheckResult]: Loop: 1015#L557-1 assume !test_fun_#t~short9#1; 1013#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 1000#L557-4 assume !test_fun_#t~short14#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem10#1 < 0; 1001#L557-6 assume test_fun_#t~short13#1;call test_fun_#t~mem12#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem12#1 > -2147483648 - test_fun_#t~mem11#1; 989#L557-8 test_fun_#t~short14#1 := test_fun_#t~short13#1; 990#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 1011#L557-10 assume test_fun_#t~short18#1;call test_fun_#t~mem17#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem16#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short18#1 := test_fun_#t~mem17#1 > test_fun_#t~mem15#1 + test_fun_#t~mem16#1; 1006#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 1007#L557-13 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 1004#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 995#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 996#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 1018#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 1015#L557-1 [2022-07-13 03:18:55,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:18:55,351 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 6 times [2022-07-13 03:18:55,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:18:55,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861468563] [2022-07-13 03:18:55,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:18:55,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:18:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:55,368 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:18:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:55,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:18:55,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:18:55,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1738777329, now seen corresponding path program 1 times [2022-07-13 03:18:55,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:18:55,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960683677] [2022-07-13 03:18:55,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:18:55,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:18:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:55,396 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:18:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:55,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:18:55,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:18:55,405 INFO L85 PathProgramCache]: Analyzing trace with hash -403715764, now seen corresponding path program 1 times [2022-07-13 03:18:55,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:18:55,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047073347] [2022-07-13 03:18:55,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:18:55,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:18:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:55,445 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:18:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:18:55,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:18:56,959 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:18:56,960 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:18:56,960 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:18:56,960 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:18:56,960 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:18:56,960 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:56,960 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:18:56,960 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:18:56,960 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.06-alloca.i_Iteration8_Lasso [2022-07-13 03:18:56,960 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:18:56,960 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:18:56,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:56,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:56,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:57,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:18:58,484 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:18:58,485 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:18:58,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:58,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:58,488 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-07-13 03:18:58,492 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-07-13 03:18:58,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:18:58,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:58,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:18:58,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:58,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:58,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:58,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:18:58,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:18:58,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:58,517 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-07-13 03:18:58,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:58,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:58,518 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-07-13 03:18:58,519 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-07-13 03:18:58,520 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-07-13 03:18:58,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:58,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:18:58,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:58,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:58,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:58,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:18:58,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:18:58,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:58,544 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-07-13 03:18:58,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:58,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:58,546 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-07-13 03:18:58,549 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-07-13 03:18:58,550 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-07-13 03:18:58,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:58,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:58,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:58,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:58,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:18:58,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:18:58,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:58,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-13 03:18:58,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:58,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:58,577 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-07-13 03:18:58,591 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-07-13 03:18:58,591 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-07-13 03:18:58,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:58,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:58,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:58,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:58,603 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:18:58,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:18:58,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:58,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-13 03:18:58,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:58,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:58,639 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-07-13 03:18:58,640 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-07-13 03:18:58,641 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-07-13 03:18:58,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:58,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:58,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:58,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:58,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:18:58,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:18:58,649 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:58,664 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-07-13 03:18:58,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:58,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:58,666 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-07-13 03:18:58,671 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-07-13 03:18:58,671 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-07-13 03:18:58,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:58,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:58,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:58,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:58,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:18:58,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:18:58,680 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:58,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-13 03:18:58,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:58,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:58,696 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-07-13 03:18:58,704 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-07-13 03:18:58,704 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-07-13 03:18:58,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:58,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:58,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:58,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:58,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:18:58,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:18:58,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:58,762 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-07-13 03:18:58,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:58,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:58,763 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-07-13 03:18:58,765 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-07-13 03:18:58,766 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-07-13 03:18:58,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:58,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:58,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:58,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:58,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:18:58,774 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:18:58,777 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:58,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-13 03:18:58,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:58,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:58,795 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-07-13 03:18:58,795 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-07-13 03:18:58,797 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-07-13 03:18:58,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:58,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:18:58,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:18:58,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:58,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:18:58,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:18:58,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:18:58,825 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-07-13 03:18:58,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:58,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:58,827 INFO L229 MonitoredProcess]: Starting monitored process 27 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-07-13 03:18:58,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-13 03:18:58,829 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-07-13 03:18:58,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:18:58,835 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-13 03:18:58,835 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 03:18:58,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:18:58,861 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2022-07-13 03:18:58,861 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-13 03:18:58,919 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:18:59,138 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2022-07-13 03:18:59,138 INFO L444 ModelExtractionUtils]: 35 out of 76 variables were initially zero. Simplification set additionally 34 variables to zero. [2022-07-13 03:18:59,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:18:59,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:18:59,140 INFO L229 MonitoredProcess]: Starting monitored process 28 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-07-13 03:18:59,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-13 03:18:59,142 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:18:59,149 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2022-07-13 03:18:59,150 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:18:59,150 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_2, ULTIMATE.start_test_fun_~y#1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_2 - 4294967293*ULTIMATE.start_test_fun_~y#1 Supporting invariants [-1*ULTIMATE.start_test_fun_~y#1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2 >= 0] [2022-07-13 03:18:59,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-13 03:18:59,306 INFO L293 tatePredicateManager]: 37 out of 38 supporting invariants were superfluous and have been removed [2022-07-13 03:18:59,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:18:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:18:59,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 03:18:59,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:18:59,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:18:59,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:18:59,473 INFO L356 Elim1Store]: treesize reduction 104, result has 32.0 percent of original size [2022-07-13 03:18:59,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 134 [2022-07-13 03:18:59,495 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:18:59,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 197 [2022-07-13 03:18:59,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 03:18:59,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-13 03:18:59,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-13 03:18:59,721 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-13 03:18:59,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 20 [2022-07-13 03:18:59,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-13 03:18:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:18:59,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-13 03:18:59,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:18:59,956 INFO L356 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-07-13 03:18:59,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 84 [2022-07-13 03:19:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:19:00,066 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2022-07-13 03:19:00,066 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 5 Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:00,164 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 5. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 78 states and 87 transitions. Complement of second has 11 states. [2022-07-13 03:19:00,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-13 03:19:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-07-13 03:19:00,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 3 letters. Loop has 13 letters. [2022-07-13 03:19:00,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:19:00,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 16 letters. Loop has 13 letters. [2022-07-13 03:19:00,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:19:00,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 3 letters. Loop has 26 letters. [2022-07-13 03:19:00,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:19:00,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 87 transitions. [2022-07-13 03:19:00,169 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-13 03:19:00,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 0 states and 0 transitions. [2022-07-13 03:19:00,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-13 03:19:00,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-13 03:19:00,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-13 03:19:00,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:19:00,169 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 03:19:00,169 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 03:19:00,169 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 03:19:00,169 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-13 03:19:00,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-13 03:19:00,170 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-13 03:19:00,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-13 03:19:00,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 03:19:00 BoogieIcfgContainer [2022-07-13 03:19:00,175 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 03:19:00,176 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 03:19:00,176 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 03:19:00,176 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 03:19:00,177 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:18:49" (3/4) ... [2022-07-13 03:19:00,179 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 03:19:00,179 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 03:19:00,179 INFO L158 Benchmark]: Toolchain (without parser) took 11484.61ms. Allocated memory was 86.0MB in the beginning and 159.4MB in the end (delta: 73.4MB). Free memory was 63.4MB in the beginning and 47.1MB in the end (delta: 16.3MB). Peak memory consumption was 87.9MB. Max. memory is 16.1GB. [2022-07-13 03:19:00,180 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 86.0MB. Free memory was 61.9MB in the beginning and 61.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:19:00,180 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.23ms. Allocated memory is still 86.0MB. Free memory was 63.1MB in the beginning and 56.1MB in the end (delta: 7.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 03:19:00,180 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.59ms. Allocated memory is still 86.0MB. Free memory was 55.9MB in the beginning and 54.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:19:00,181 INFO L158 Benchmark]: Boogie Preprocessor took 49.74ms. Allocated memory is still 86.0MB. Free memory was 54.1MB in the beginning and 52.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:19:00,181 INFO L158 Benchmark]: RCFGBuilder took 367.97ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 52.7MB in the beginning and 86.4MB in the end (delta: -33.7MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2022-07-13 03:19:00,181 INFO L158 Benchmark]: BuchiAutomizer took 10611.25ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 86.4MB in the beginning and 47.1MB in the end (delta: 39.4MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. [2022-07-13 03:19:00,181 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 159.4MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:19:00,183 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 86.0MB. Free memory was 61.9MB in the beginning and 61.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.23ms. Allocated memory is still 86.0MB. Free memory was 63.1MB in the beginning and 56.1MB in the end (delta: 7.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.59ms. Allocated memory is still 86.0MB. Free memory was 55.9MB in the beginning and 54.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.74ms. Allocated memory is still 86.0MB. Free memory was 54.1MB in the beginning and 52.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 367.97ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 52.7MB in the beginning and 86.4MB in the end (delta: -33.7MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 10611.25ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 86.4MB in the beginning and 47.1MB in the end (delta: 39.4MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. * Witness Printer took 3.12ms. Allocated memory is still 159.4MB. Free memory is still 47.1MB. There was no memory consumed. 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 8 terminating modules (6 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z_ref][z_ref] + 4294967293 and consists of 7 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z_ref][z_ref] + -4294967293 * y and consists of 7 locations. 6 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.5s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 8.6s. Construction of modules took 0.2s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 101 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 205 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 204 mSDsluCounter, 442 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 282 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 285 IncrementalHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 160 mSDtfsCounter, 285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI6 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital449 mio100 ax104 hnf100 lsp94 ukn55 mio100 lsp34 div100 bol105 ite100 ukn100 eq179 hnf89 smp100 dnf138 smp97 tf100 neg98 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 324ms VariablesStem: 14 VariablesLoop: 9 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-13 03:19:00,217 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