./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 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-linkedlists/ll_append-alloca-2.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 a94e514ac338898e2e1e54a42b19ae4490ac5c412319209fc14736a6de9b7386 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 15:02:43,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:02:43,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:02:43,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:02:43,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:02:43,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:02:43,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:02:43,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:02:43,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:02:43,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:02:43,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:02:43,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:02:43,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:02:43,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:02:43,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:02:43,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:02:43,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:02:43,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:02:43,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:02:43,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:02:43,506 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:02:43,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:02:43,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:02:43,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:02:43,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:02:43,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:02:43,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:02:43,514 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:02:43,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:02:43,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:02:43,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:02:43,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:02:43,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:02:43,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:02:43,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:02:43,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:02:43,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:02:43,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:02:43,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:02:43,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:02:43,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:02:43,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:02:43,526 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-14 15:02:43,563 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:02:43,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:02:43,564 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:02:43,564 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:02:43,565 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:02:43,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:02:43,566 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:02:43,566 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:02:43,566 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:02:43,567 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:02:43,567 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:02:43,567 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:02:43,568 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:02:43,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:02:43,568 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:02:43,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:02:43,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:02:43,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:02:43,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:02:43,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:02:43,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:02:43,569 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:02:43,569 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:02:43,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:02:43,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:02:43,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:02:43,570 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:02:43,570 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:02:43,571 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:02:43,572 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 -> a94e514ac338898e2e1e54a42b19ae4490ac5c412319209fc14736a6de9b7386 [2022-07-14 15:02:43,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:02:43,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:02:43,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:02:43,839 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:02:43,839 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:02:43,840 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2022-07-14 15:02:43,909 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35d8fe1ae/3f160fb5f789430f83f5669dc4854be8/FLAGdfcb82d20 [2022-07-14 15:02:44,376 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:02:44,376 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2022-07-14 15:02:44,386 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35d8fe1ae/3f160fb5f789430f83f5669dc4854be8/FLAGdfcb82d20 [2022-07-14 15:02:44,403 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35d8fe1ae/3f160fb5f789430f83f5669dc4854be8 [2022-07-14 15:02:44,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:02:44,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:02:44,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:02:44,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:02:44,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:02:44,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:02:44" (1/1) ... [2022-07-14 15:02:44,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5811a2b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:44, skipping insertion in model container [2022-07-14 15:02:44,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:02:44" (1/1) ... [2022-07-14 15:02:44,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:02:44,449 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:02:44,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:02:44,757 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:02:44,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:02:44,809 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:02:44,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:44 WrapperNode [2022-07-14 15:02:44,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:02:44,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:02:44,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:02:44,812 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:02:44,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:44" (1/1) ... [2022-07-14 15:02:44,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:44" (1/1) ... [2022-07-14 15:02:44,850 INFO L137 Inliner]: procedures = 115, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2022-07-14 15:02:44,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:02:44,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:02:44,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:02:44,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:02:44,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:44" (1/1) ... [2022-07-14 15:02:44,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:44" (1/1) ... [2022-07-14 15:02:44,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:44" (1/1) ... [2022-07-14 15:02:44,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:44" (1/1) ... [2022-07-14 15:02:44,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:44" (1/1) ... [2022-07-14 15:02:44,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:44" (1/1) ... [2022-07-14 15:02:44,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:44" (1/1) ... [2022-07-14 15:02:44,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:02:44,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:02:44,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:02:44,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:02:44,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:44" (1/1) ... [2022-07-14 15:02:44,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:44,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:44,911 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-14 15:02:44,913 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-14 15:02:44,945 INFO L130 BoogieDeclarations]: Found specification of procedure new_ll [2022-07-14 15:02:44,945 INFO L138 BoogieDeclarations]: Found implementation of procedure new_ll [2022-07-14 15:02:44,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 15:02:44,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 15:02:44,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 15:02:44,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 15:02:44,946 INFO L130 BoogieDeclarations]: Found specification of procedure length [2022-07-14 15:02:44,946 INFO L138 BoogieDeclarations]: Found implementation of procedure length [2022-07-14 15:02:44,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:02:44,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:02:45,019 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:02:45,021 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:02:45,136 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:02:45,141 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:02:45,142 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 15:02:45,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:02:45 BoogieIcfgContainer [2022-07-14 15:02:45,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:02:45,144 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:02:45,145 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:02:45,148 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:02:45,148 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:02:45,148 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:02:44" (1/3) ... [2022-07-14 15:02:45,149 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ebc6fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:02:45, skipping insertion in model container [2022-07-14 15:02:45,149 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:02:45,149 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:44" (2/3) ... [2022-07-14 15:02:45,149 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ebc6fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:02:45, skipping insertion in model container [2022-07-14 15:02:45,149 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:02:45,150 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:02:45" (3/3) ... [2022-07-14 15:02:45,150 INFO L354 chiAutomizerObserver]: Analyzing ICFG ll_append-alloca-2.i [2022-07-14 15:02:45,198 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:02:45,198 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:02:45,198 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:02:45,198 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:02:45,198 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:02:45,199 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:02:45,199 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:02:45,199 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:02:45,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 15:02:45,240 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-14 15:02:45,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:02:45,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:02:45,246 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:02:45,246 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:02:45,246 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:02:45,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 15:02:45,249 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-14 15:02:45,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:02:45,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:02:45,250 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:02:45,250 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:02:45,272 INFO L752 eck$LassoCheckResult]: Stem: 16#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~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 14#L574true assume !(main_~n~0#1 < 1); 26#L577true call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 13#new_llENTRYtrue [2022-07-14 15:02:45,273 INFO L754 eck$LassoCheckResult]: Loop: 13#new_llENTRYtrue ~n := #in~n; 20#L548true assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 15#L552true call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 13#new_llENTRYtrue [2022-07-14 15:02:45,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:45,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1418244, now seen corresponding path program 1 times [2022-07-14 15:02:45,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:45,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482219129] [2022-07-14 15:02:45,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:45,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:45,399 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:45,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:45,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:45,428 INFO L85 PathProgramCache]: Analyzing trace with hash 29967, now seen corresponding path program 1 times [2022-07-14 15:02:45,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:45,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377558553] [2022-07-14 15:02:45,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:45,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:45,453 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:45,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:45,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:45,476 INFO L85 PathProgramCache]: Analyzing trace with hash -698765780, now seen corresponding path program 1 times [2022-07-14 15:02:45,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:45,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680091177] [2022-07-14 15:02:45,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:45,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:45,498 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:45,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:46,217 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:02:46,218 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:02:46,219 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:02:46,219 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:02:46,219 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:02:46,219 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:46,220 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:02:46,220 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:02:46,220 INFO L133 ssoRankerPreferences]: Filename of dumped script: ll_append-alloca-2.i_Iteration1_Lasso [2022-07-14 15:02:46,220 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:02:46,221 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:02:46,238 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-14 15:02:46,246 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-14 15:02:46,248 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-14 15:02:46,250 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-14 15:02:46,252 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-14 15:02:46,255 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-14 15:02:46,257 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-14 15:02:46,263 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-14 15:02:46,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:46,269 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-14 15:02:46,271 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-14 15:02:46,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:46,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:46,279 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-14 15:02:46,281 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-14 15:02:46,283 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-14 15:02:46,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:46,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:46,290 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-14 15:02:46,292 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-14 15:02:46,295 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-14 15:02:46,297 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-14 15:02:46,299 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-14 15:02:46,302 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-14 15:02:46,305 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-14 15:02:46,307 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-14 15:02:46,309 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-14 15:02:46,311 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-14 15:02:46,314 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-14 15:02:46,371 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-14 15:02:46,373 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-14 15:02:46,375 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-14 15:02:46,377 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-14 15:02:46,379 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-14 15:02:46,381 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-14 15:02:46,383 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-14 15:02:46,385 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-14 15:02:46,387 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-14 15:02:46,389 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-14 15:02:46,390 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-14 15:02:46,392 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-14 15:02:46,394 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-14 15:02:46,395 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-14 15:02:46,586 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:02:46,590 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:02:46,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:46,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:46,596 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-14 15:02:46,599 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-14 15:02:46,600 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-14 15:02:46,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:46,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:46,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:46,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:46,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:46,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:46,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:46,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:46,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-14 15:02:46,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:46,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:46,642 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-14 15:02:46,646 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-14 15:02:46,647 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-14 15:02:46,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:46,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:46,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:46,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:46,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:46,656 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:46,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:46,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:46,694 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-14 15:02:46,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:46,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:46,696 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-14 15:02:46,696 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-14 15:02:46,698 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-14 15:02:46,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:46,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:46,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:46,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:46,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:46,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:46,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:46,716 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:46,736 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-14 15:02:46,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:46,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:46,738 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-14 15:02:46,741 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-14 15:02:46,742 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-14 15:02:46,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:46,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:46,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:46,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:46,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:46,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:46,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:46,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:46,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-14 15:02:46,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:46,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:46,790 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-14 15:02:46,790 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-14 15:02:46,792 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-14 15:02:46,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:46,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:46,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:46,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:46,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:46,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:46,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:46,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:46,843 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-14 15:02:46,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:46,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:46,846 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-14 15:02:46,855 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-14 15:02:46,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:46,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:46,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:46,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:46,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:46,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:46,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:46,866 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-14 15:02:46,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:46,901 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-14 15:02:46,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:46,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:46,904 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-14 15:02:46,906 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-14 15:02:46,907 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-14 15:02:46,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:46,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:46,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:46,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:46,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:46,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:46,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:46,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:46,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-14 15:02:46,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:46,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:46,936 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-14 15:02:46,937 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-14 15:02:46,938 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-14 15:02:46,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:46,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:46,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:46,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:46,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:46,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:46,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:46,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:46,964 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-14 15:02:46,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:46,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:46,966 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-14 15:02:46,967 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-14 15:02:46,968 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-14 15:02:46,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:46,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:46,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:46,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:46,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:46,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:46,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:46,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:46,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:46,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:46,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:46,999 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-14 15:02:47,000 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-14 15:02:47,001 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-14 15:02:47,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:47,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:47,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:47,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:47,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:47,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:47,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:47,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:47,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-07-14 15:02:47,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:47,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:47,030 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-14 15:02:47,030 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-14 15:02:47,032 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-14 15:02:47,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:47,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:47,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:47,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:47,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:47,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:47,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:47,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:47,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:47,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:47,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:47,057 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-14 15:02:47,057 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-14 15:02:47,059 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-14 15:02:47,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:47,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:47,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:47,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:47,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:47,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:47,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:47,100 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-14 15:02:47,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:47,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:47,102 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-14 15:02:47,103 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-14 15:02:47,104 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-14 15:02:47,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:47,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:47,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:47,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:47,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:47,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:47,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:47,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:47,129 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-14 15:02:47,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:47,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:47,131 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-14 15:02:47,132 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-14 15:02:47,133 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-14 15:02:47,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:47,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:47,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:47,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:47,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:47,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:47,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:47,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:47,157 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-14 15:02:47,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:47,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:47,159 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-14 15:02:47,160 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-14 15:02:47,161 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-14 15:02:47,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:47,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:47,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:47,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:47,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:47,167 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:47,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:47,168 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:47,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-14 15:02:47,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:47,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:47,185 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-14 15:02:47,186 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-14 15:02:47,187 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-14 15:02:47,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:47,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:47,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:47,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:47,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:47,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:47,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:47,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:47,221 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-14 15:02:47,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:47,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:47,222 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-14 15:02:47,223 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-14 15:02:47,225 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-14 15:02:47,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:47,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:47,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:47,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:47,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:47,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:47,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:47,233 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:47,248 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-14 15:02:47,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:47,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:47,250 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-14 15:02:47,251 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-14 15:02:47,252 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-14 15:02:47,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:47,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:47,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:47,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:47,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:47,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:47,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:47,267 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:47,284 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-14 15:02:47,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:47,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:47,286 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-14 15:02:47,287 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-14 15:02:47,288 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-14 15:02:47,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:47,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:47,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:47,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:47,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:47,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:47,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:47,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:47,325 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-14 15:02:47,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:47,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:47,326 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-14 15:02:47,327 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-14 15:02:47,329 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-14 15:02:47,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:47,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:47,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:47,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:47,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:47,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:47,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:47,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:47,384 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-14 15:02:47,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:47,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:47,386 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-14 15:02:47,392 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-14 15:02:47,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:47,399 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-14 15:02:47,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:47,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:47,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:47,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:47,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:47,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:47,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:47,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-14 15:02:47,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:47,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:47,428 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-14 15:02:47,430 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-14 15:02:47,431 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-14 15:02:47,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:47,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:47,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:47,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:47,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:47,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:47,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:47,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:47,461 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-14 15:02:47,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:47,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:47,464 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-14 15:02:47,465 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-14 15:02:47,466 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-14 15:02:47,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:47,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:47,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:47,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:47,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:47,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:47,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:47,473 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:47,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-14 15:02:47,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:47,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:47,490 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-14 15:02:47,490 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-14 15:02:47,492 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-14 15:02:47,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:47,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:47,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:47,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:47,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:47,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:47,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:47,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:47,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:47,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:47,523 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-14 15:02:47,524 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-14 15:02:47,525 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-14 15:02:47,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:47,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:47,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:47,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:47,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:47,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:47,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:47,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:47,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-14 15:02:47,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:47,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:47,558 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-14 15:02:47,558 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-14 15:02:47,559 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-14 15:02:47,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:47,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:47,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:47,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:47,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:47,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:47,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:47,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:47,584 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-14 15:02:47,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:47,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:47,586 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-14 15:02:47,593 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-14 15:02:47,593 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-14 15:02:47,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:47,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:47,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:47,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:47,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:47,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:47,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:47,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:47,619 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-14 15:02:47,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:47,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:47,621 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:47,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-14 15:02:47,623 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-14 15:02:47,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:47,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:47,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:47,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:47,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:47,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:47,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:47,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:47,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:47,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:47,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:47,649 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:47,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-14 15:02:47,651 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-14 15:02:47,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:47,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:47,657 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:02:47,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:47,663 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-14 15:02:47,663 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-14 15:02:47,681 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:02:47,707 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-14 15:02:47,708 INFO L444 ModelExtractionUtils]: 1 out of 11 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-07-14 15:02:47,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:47,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:47,723 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:47,724 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:02:47,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-14 15:02:47,776 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2022-07-14 15:02:47,776 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:02:47,776 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(new_ll_#in~n) = 1*new_ll_#in~n Supporting invariants [1*new_ll_#in~n >= 0] [2022-07-14 15:02:47,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:47,807 INFO L293 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2022-07-14 15:02:47,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:47,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 15:02:47,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:02:47,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:47,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 15:02:47,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:02:47,989 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-14 15:02:48,017 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-07-14 15:02:48,019 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:02:48,116 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4). Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 45 states and 54 transitions. Complement of second has 13 states. [2022-07-14 15:02:48,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 15:02:48,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:02:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2022-07-14 15:02:48,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2022-07-14 15:02:48,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:02:48,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2022-07-14 15:02:48,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:02:48,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2022-07-14 15:02:48,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:02:48,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2022-07-14 15:02:48,131 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-14 15:02:48,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 37 transitions. [2022-07-14 15:02:48,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-07-14 15:02:48,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-14 15:02:48,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2022-07-14 15:02:48,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:02:48,140 INFO L369 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-14 15:02:48,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2022-07-14 15:02:48,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-07-14 15:02:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 15:02:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-07-14 15:02:48,165 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-07-14 15:02:48,165 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-07-14 15:02:48,165 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:02:48,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2022-07-14 15:02:48,166 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-14 15:02:48,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:02:48,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:02:48,167 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:02:48,168 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:02:48,168 INFO L752 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 154#L574 assume !(main_~n~0#1 < 1); 143#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 162#new_llENTRY ~n := #in~n; 163#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 165#new_llFINAL assume true; 159#new_llEXIT >#57#return; 157#L577-1 main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; 158#L563 assume !(append_~x#1.base == 0 && append_~x#1.offset == 0);append_~s~0#1.base, append_~s~0#1.offset := append_~x#1.base, append_~x#1.offset; 160#L566-3 [2022-07-14 15:02:48,168 INFO L754 eck$LassoCheckResult]: Loop: 160#L566-3 call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~x#1.base, 4 + append_~x#1.offset, 8); 161#L566-1 assume !!(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$(append_~x#1.base, 4 + append_~x#1.offset, 8);append_~x#1.base, append_~x#1.offset := append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset; 160#L566-3 [2022-07-14 15:02:48,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:48,169 INFO L85 PathProgramCache]: Analyzing trace with hash 772923198, now seen corresponding path program 1 times [2022-07-14 15:02:48,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:48,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807735056] [2022-07-14 15:02:48,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:48,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:48,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 15:02:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:48,276 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-14 15:02:48,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:02:48,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807735056] [2022-07-14 15:02:48,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807735056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:02:48,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:02:48,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 15:02:48,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836227843] [2022-07-14 15:02:48,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:02:48,284 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:02:48,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:48,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 1 times [2022-07-14 15:02:48,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:48,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178267097] [2022-07-14 15:02:48,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:48,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:48,311 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:48,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:48,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:02:48,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 15:02:48,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 15:02:48,370 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 15:02:48,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:02:48,437 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-07-14 15:02:48,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 15:02:48,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2022-07-14 15:02:48,448 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-14 15:02:48,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2022-07-14 15:02:48,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-07-14 15:02:48,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-07-14 15:02:48,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2022-07-14 15:02:48,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:02:48,452 INFO L369 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-14 15:02:48,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2022-07-14 15:02:48,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-07-14 15:02:48,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 15:02:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-07-14 15:02:48,455 INFO L392 hiAutomatonCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-07-14 15:02:48,455 INFO L374 stractBuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-07-14 15:02:48,456 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:02:48,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. [2022-07-14 15:02:48,456 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-14 15:02:48,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:02:48,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:02:48,457 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:02:48,457 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:02:48,458 INFO L752 eck$LassoCheckResult]: Stem: 219#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 227#L574 assume !(main_~n~0#1 < 1); 217#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 234#new_llENTRY ~n := #in~n; 224#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 225#new_llFINAL assume true; 228#new_llEXIT >#57#return; 230#L577-1 main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; 231#L563 assume append_~x#1.base == 0 && append_~x#1.offset == 0;append_#res#1.base, append_#res#1.offset := append_~y#1.base, append_~y#1.offset; 213#L569 main_#t~ret10#1.base, main_#t~ret10#1.offset := append_#res#1.base, append_#res#1.offset;assume { :end_inline_append } true;main_~y~0#1.base, main_~y~0#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset; 214#L579 call main_#t~ret11#1 := length(main_~y~0#1.base, main_~y~0#1.offset);< 229#lengthENTRY [2022-07-14 15:02:48,458 INFO L754 eck$LassoCheckResult]: Loop: 229#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 222#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 223#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 229#lengthENTRY [2022-07-14 15:02:48,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:48,458 INFO L85 PathProgramCache]: Analyzing trace with hash -250149368, now seen corresponding path program 1 times [2022-07-14 15:02:48,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:48,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044348478] [2022-07-14 15:02:48,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:48,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:48,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 15:02:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:48,501 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-14 15:02:48,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:02:48,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044348478] [2022-07-14 15:02:48,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044348478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:02:48,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:02:48,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 15:02:48,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965558055] [2022-07-14 15:02:48,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:02:48,502 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:02:48,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:48,503 INFO L85 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 1 times [2022-07-14 15:02:48,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:48,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386881657] [2022-07-14 15:02:48,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:48,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:48,507 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:48,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:48,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:02:48,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 15:02:48,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 15:02:48,620 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. cyclomatic complexity: 8 Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 15:02:48,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:02:48,699 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-07-14 15:02:48,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 15:02:48,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2022-07-14 15:02:48,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-14 15:02:48,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2022-07-14 15:02:48,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-07-14 15:02:48,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-14 15:02:48,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2022-07-14 15:02:48,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:02:48,705 INFO L369 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-14 15:02:48,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2022-07-14 15:02:48,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-14 15:02:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 15:02:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-14 15:02:48,711 INFO L392 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-14 15:02:48,711 INFO L374 stractBuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-14 15:02:48,711 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:02:48,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2022-07-14 15:02:48,713 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-14 15:02:48,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:02:48,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:02:48,715 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:02:48,715 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:02:48,715 INFO L752 eck$LassoCheckResult]: Stem: 292#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 293#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 300#L574 assume !(main_~n~0#1 < 1); 287#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 307#new_llENTRY ~n := #in~n; 299#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 288#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 308#new_llENTRY ~n := #in~n; 297#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 298#new_llFINAL assume true; 301#new_llEXIT >#53#return; 286#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 289#new_llFINAL assume true; 309#new_llEXIT >#57#return; 303#L577-1 main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; 304#L563 assume !(append_~x#1.base == 0 && append_~x#1.offset == 0);append_~s~0#1.base, append_~s~0#1.offset := append_~x#1.base, append_~x#1.offset; 305#L566-3 [2022-07-14 15:02:48,715 INFO L754 eck$LassoCheckResult]: Loop: 305#L566-3 call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~x#1.base, 4 + append_~x#1.offset, 8); 306#L566-1 assume !!(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$(append_~x#1.base, 4 + append_~x#1.offset, 8);append_~x#1.base, append_~x#1.offset := append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset; 305#L566-3 [2022-07-14 15:02:48,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:48,716 INFO L85 PathProgramCache]: Analyzing trace with hash 704779872, now seen corresponding path program 1 times [2022-07-14 15:02:48,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:48,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154583154] [2022-07-14 15:02:48,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:48,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:48,758 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:48,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:48,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:48,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 2 times [2022-07-14 15:02:48,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:48,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134610645] [2022-07-14 15:02:48,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:48,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:48,793 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:48,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:48,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:48,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1311374651, now seen corresponding path program 1 times [2022-07-14 15:02:48,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:48,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964851125] [2022-07-14 15:02:48,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:48,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:48,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 15:02:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:48,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 15:02:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 15:02:48,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:02:48,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964851125] [2022-07-14 15:02:48,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964851125] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:02:48,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71824410] [2022-07-14 15:02:48,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:48,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:02:48,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:48,976 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:02:49,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-14 15:02:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:49,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-14 15:02:49,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:02:49,073 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 6 treesize of output 5 [2022-07-14 15:02:49,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 15:02:49,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 15:02:49,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 15:02:49,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 15:02:49,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:02:49,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:02:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 15:02:49,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71824410] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:02:49,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:02:49,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 19 [2022-07-14 15:02:49,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86839095] [2022-07-14 15:02:49,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:02:49,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:02:49,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 15:02:49,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-07-14 15:02:49,591 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-14 15:02:49,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:02:49,784 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-07-14 15:02:49,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 15:02:49,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2022-07-14 15:02:49,786 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-14 15:02:49,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 40 transitions. [2022-07-14 15:02:49,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-07-14 15:02:49,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-07-14 15:02:49,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2022-07-14 15:02:49,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:02:49,787 INFO L369 hiAutomatonCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-07-14 15:02:49,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2022-07-14 15:02:49,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-07-14 15:02:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 15:02:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-07-14 15:02:49,790 INFO L392 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-07-14 15:02:49,790 INFO L374 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-07-14 15:02:49,790 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 15:02:49,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2022-07-14 15:02:49,791 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-14 15:02:49,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:02:49,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:02:49,791 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:02:49,791 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:02:49,791 INFO L752 eck$LassoCheckResult]: Stem: 497#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 498#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 505#L574 assume !(main_~n~0#1 < 1); 493#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 514#new_llENTRY ~n := #in~n; 504#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 492#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 515#new_llENTRY ~n := #in~n; 502#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 503#new_llFINAL assume true; 510#new_llEXIT >#53#return; 511#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 521#new_llFINAL assume true; 520#new_llEXIT >#57#return; 508#L577-1 main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; 509#L563 assume append_~x#1.base == 0 && append_~x#1.offset == 0;append_#res#1.base, append_#res#1.offset := append_~y#1.base, append_~y#1.offset; 495#L569 main_#t~ret10#1.base, main_#t~ret10#1.offset := append_#res#1.base, append_#res#1.offset;assume { :end_inline_append } true;main_~y~0#1.base, main_~y~0#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset; 496#L579 call main_#t~ret11#1 := length(main_~y~0#1.base, main_~y~0#1.offset);< 507#lengthENTRY [2022-07-14 15:02:49,792 INFO L754 eck$LassoCheckResult]: Loop: 507#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 500#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 501#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 507#lengthENTRY [2022-07-14 15:02:49,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:49,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1311376214, now seen corresponding path program 1 times [2022-07-14 15:02:49,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:49,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944031616] [2022-07-14 15:02:49,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:49,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:49,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 15:02:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:49,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 15:02:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 15:02:49,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:02:49,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944031616] [2022-07-14 15:02:49,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944031616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:02:49,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:02:49,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 15:02:49,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371741737] [2022-07-14 15:02:49,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:02:49,857 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:02:49,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:49,858 INFO L85 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 2 times [2022-07-14 15:02:49,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:49,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939079468] [2022-07-14 15:02:49,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:49,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:49,862 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:49,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:49,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:02:49,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 15:02:49,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 15:02:49,961 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 15:02:50,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:02:50,023 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-07-14 15:02:50,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 15:02:50,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2022-07-14 15:02:50,028 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-14 15:02:50,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 41 transitions. [2022-07-14 15:02:50,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-07-14 15:02:50,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-07-14 15:02:50,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 41 transitions. [2022-07-14 15:02:50,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:02:50,031 INFO L369 hiAutomatonCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-07-14 15:02:50,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 41 transitions. [2022-07-14 15:02:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-07-14 15:02:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 15:02:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-07-14 15:02:50,038 INFO L392 hiAutomatonCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-07-14 15:02:50,038 INFO L374 stractBuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-07-14 15:02:50,038 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 15:02:50,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2022-07-14 15:02:50,039 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-14 15:02:50,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:02:50,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:02:50,040 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:02:50,040 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:02:50,040 INFO L752 eck$LassoCheckResult]: Stem: 591#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 592#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 599#L574 assume !(main_~n~0#1 < 1); 589#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 608#new_llENTRY ~n := #in~n; 598#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 588#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 609#new_llENTRY ~n := #in~n; 596#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 597#new_llFINAL assume true; 601#new_llEXIT >#53#return; 607#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 615#new_llFINAL assume true; 611#new_llEXIT >#57#return; 602#L577-1 main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; 603#L563 assume !(append_~x#1.base == 0 && append_~x#1.offset == 0);append_~s~0#1.base, append_~s~0#1.offset := append_~x#1.base, append_~x#1.offset; 613#L566-3 call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~x#1.base, 4 + append_~x#1.offset, 8); 606#L566-1 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset; 593#L566-4 call write~$Pointer$(append_~y#1.base, append_~y#1.offset, append_~x#1.base, 4 + append_~x#1.offset, 8);append_#res#1.base, append_#res#1.offset := append_~s~0#1.base, append_~s~0#1.offset; 585#L569 main_#t~ret10#1.base, main_#t~ret10#1.offset := append_#res#1.base, append_#res#1.offset;assume { :end_inline_append } true;main_~y~0#1.base, main_~y~0#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset; 586#L579 call main_#t~ret11#1 := length(main_~y~0#1.base, main_~y~0#1.offset);< 600#lengthENTRY [2022-07-14 15:02:50,040 INFO L754 eck$LassoCheckResult]: Loop: 600#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 594#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 595#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 600#lengthENTRY [2022-07-14 15:02:50,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:50,041 INFO L85 PathProgramCache]: Analyzing trace with hash -139719339, now seen corresponding path program 1 times [2022-07-14 15:02:50,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:50,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449515474] [2022-07-14 15:02:50,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:50,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:50,079 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:50,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:50,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:50,106 INFO L85 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 3 times [2022-07-14 15:02:50,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:50,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493878789] [2022-07-14 15:02:50,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:50,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:50,110 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:50,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:50,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:50,127 INFO L85 PathProgramCache]: Analyzing trace with hash -555510211, now seen corresponding path program 1 times [2022-07-14 15:02:50,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:50,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338427216] [2022-07-14 15:02:50,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:50,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:50,160 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:50,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:51,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 03:02:51 BoogieIcfgContainer [2022-07-14 15:02:51,935 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 15:02:51,936 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 15:02:51,936 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 15:02:51,936 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 15:02:51,936 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:02:45" (3/4) ... [2022-07-14 15:02:51,938 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-14 15:02:51,964 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 15:02:51,964 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 15:02:51,965 INFO L158 Benchmark]: Toolchain (without parser) took 7557.41ms. Allocated memory was 86.0MB in the beginning and 134.2MB in the end (delta: 48.2MB). Free memory was 50.1MB in the beginning and 77.7MB in the end (delta: -27.6MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2022-07-14 15:02:51,965 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 86.0MB. Free memory was 55.8MB in the beginning and 55.7MB in the end (delta: 26.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:02:51,965 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.45ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 50.0MB in the beginning and 73.8MB in the end (delta: -23.8MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2022-07-14 15:02:51,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.39ms. Allocated memory is still 104.9MB. Free memory was 73.8MB in the beginning and 71.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:02:51,966 INFO L158 Benchmark]: Boogie Preprocessor took 22.89ms. Allocated memory is still 104.9MB. Free memory was 71.8MB in the beginning and 70.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:02:51,966 INFO L158 Benchmark]: RCFGBuilder took 268.83ms. Allocated memory is still 104.9MB. Free memory was 70.5MB in the beginning and 59.1MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 15:02:51,966 INFO L158 Benchmark]: BuchiAutomizer took 6790.89ms. Allocated memory was 104.9MB in the beginning and 134.2MB in the end (delta: 29.4MB). Free memory was 58.8MB in the beginning and 78.7MB in the end (delta: -19.9MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2022-07-14 15:02:51,967 INFO L158 Benchmark]: Witness Printer took 28.52ms. Allocated memory is still 134.2MB. Free memory was 78.7MB in the beginning and 77.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:02:51,968 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.21ms. Allocated memory is still 86.0MB. Free memory was 55.8MB in the beginning and 55.7MB in the end (delta: 26.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.45ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 50.0MB in the beginning and 73.8MB in the end (delta: -23.8MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.39ms. Allocated memory is still 104.9MB. Free memory was 73.8MB in the beginning and 71.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.89ms. Allocated memory is still 104.9MB. Free memory was 71.8MB in the beginning and 70.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 268.83ms. Allocated memory is still 104.9MB. Free memory was 70.5MB in the beginning and 59.1MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 6790.89ms. Allocated memory was 104.9MB in the beginning and 134.2MB in the end (delta: 29.4MB). Free memory was 58.8MB in the beginning and 78.7MB in the end (delta: -19.9MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. * Witness Printer took 28.52ms. Allocated memory is still 134.2MB. Free memory was 78.7MB in the beginning and 77.7MB in the end (delta: 1.0MB). 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(n) and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 20 locations. The remainder module has 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 356 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 275 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 358 IncrementalHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 81 mSDtfsCounter, 358 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital143 mio100 ax100 hnf100 lsp95 ukn30 mio100 lsp40 div100 bol100 ite100 ukn100 eq217 hnf86 smp100 dnf121 smp100 tf100 neg92 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 128ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 555]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {x=0, NULL=0, y=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@15a54ad5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4a9ad32=0, NULL=1, xs=0, y=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e90a966=0, \result=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e6cd828=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@54cd910=0, n=0, x=0, s=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e90a966=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@15a54ad5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@118fce1c=0, s=0, x=0, \result=0, y=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@66e1d92c=0, y=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@54cd910=0, xs=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@66e1d92c=0, NULL=0, xs=0, xs=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@cfda1ed=0, y_length=0, \result=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4a9ad32=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 555]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L573] int n = __VERIFIER_nondet_int(); [L574] COND FALSE !(n < 1) [L577] CALL, EXPR new_ll(n) [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n [L552] CALL, EXPR new_ll(n-1) [L548] COND TRUE n == 0 [L549] return ((void *)0); [L552] RET, EXPR new_ll(n-1) [L552] head->next = new_ll(n-1) [L553] return head; [L577] RET, EXPR new_ll(n) [L577] node_t* x = new_ll(n); [L578] CALL, EXPR append(x, x) [L563] COND FALSE !(x == ((void *)0)) [L565] node_t* s = x; [L566] EXPR x->next [L566] COND FALSE !(x->next != ((void *)0)) [L568] x->next = y [L569] return s; [L578] RET, EXPR append(x, x) [L578] node_t* y = append(x, x); [L579] CALL length(y) Loop: [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-14 15:02:52,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:52,234 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)