./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d0878af360c86b536b5b3bc8d222f1c5ce26337b4ad6227d126c258cfe065cc9 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 14:25:20,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 14:25:20,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 14:25:20,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 14:25:20,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 14:25:20,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 14:25:20,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 14:25:20,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 14:25:20,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 14:25:20,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 14:25:20,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 14:25:20,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 14:25:20,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 14:25:20,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 14:25:20,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 14:25:20,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 14:25:20,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 14:25:20,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 14:25:20,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 14:25:20,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 14:25:20,122 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 14:25:20,127 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 14:25:20,127 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 14:25:20,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 14:25:20,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 14:25:20,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 14:25:20,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 14:25:20,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 14:25:20,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 14:25:20,134 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 14:25:20,135 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 14:25:20,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 14:25:20,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 14:25:20,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 14:25:20,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 14:25:20,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 14:25:20,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 14:25:20,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 14:25:20,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 14:25:20,138 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 14:25:20,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 14:25:20,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 14:25:20,141 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-23 14:25:20,158 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 14:25:20,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 14:25:20,159 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 14:25:20,159 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 14:25:20,160 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 14:25:20,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 14:25:20,160 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 14:25:20,160 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 14:25:20,160 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 14:25:20,160 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 14:25:20,161 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 14:25:20,161 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 14:25:20,161 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 14:25:20,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 14:25:20,161 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 14:25:20,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 14:25:20,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 14:25:20,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 14:25:20,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 14:25:20,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 14:25:20,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 14:25:20,162 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 14:25:20,162 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 14:25:20,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 14:25:20,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 14:25:20,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 14:25:20,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 14:25:20,163 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 14:25:20,164 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 14:25:20,164 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 -> d0878af360c86b536b5b3bc8d222f1c5ce26337b4ad6227d126c258cfe065cc9 [2022-07-23 14:25:20,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 14:25:20,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 14:25:20,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 14:25:20,382 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 14:25:20,383 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 14:25:20,384 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca.i [2022-07-23 14:25:20,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15899183f/b5be2f1221c04a5d8f1b497f47e41ca5/FLAG12cbbc502 [2022-07-23 14:25:20,827 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 14:25:20,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca.i [2022-07-23 14:25:20,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15899183f/b5be2f1221c04a5d8f1b497f47e41ca5/FLAG12cbbc502 [2022-07-23 14:25:21,245 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15899183f/b5be2f1221c04a5d8f1b497f47e41ca5 [2022-07-23 14:25:21,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 14:25:21,249 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 14:25:21,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 14:25:21,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 14:25:21,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 14:25:21,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:25:21" (1/1) ... [2022-07-23 14:25:21,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aaa7134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:25:21, skipping insertion in model container [2022-07-23 14:25:21,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:25:21" (1/1) ... [2022-07-23 14:25:21,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 14:25:21,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 14:25:21,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:25:21,516 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 14:25:21,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:25:21,575 INFO L208 MainTranslator]: Completed translation [2022-07-23 14:25:21,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:25:21 WrapperNode [2022-07-23 14:25:21,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 14:25:21,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 14:25:21,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 14:25:21,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 14:25:21,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:25:21" (1/1) ... [2022-07-23 14:25:21,597 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:25:21" (1/1) ... [2022-07-23 14:25:21,609 INFO L137 Inliner]: procedures = 110, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2022-07-23 14:25:21,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 14:25:21,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 14:25:21,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 14:25:21,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 14:25:21,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:25:21" (1/1) ... [2022-07-23 14:25:21,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:25:21" (1/1) ... [2022-07-23 14:25:21,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:25:21" (1/1) ... [2022-07-23 14:25:21,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:25:21" (1/1) ... [2022-07-23 14:25:21,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:25:21" (1/1) ... [2022-07-23 14:25:21,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:25:21" (1/1) ... [2022-07-23 14:25:21,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:25:21" (1/1) ... [2022-07-23 14:25:21,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 14:25:21,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 14:25:21,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 14:25:21,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 14:25:21,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:25:21" (1/1) ... [2022-07-23 14:25:21,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:21,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:21,665 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-23 14:25:21,667 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-23 14:25:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 14:25:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 14:25:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 14:25:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 14:25:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 14:25:21,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 14:25:21,778 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 14:25:21,779 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 14:25:21,905 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 14:25:21,909 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 14:25:21,910 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-23 14:25:21,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:25:21 BoogieIcfgContainer [2022-07-23 14:25:21,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 14:25:21,912 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 14:25:21,914 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 14:25:21,917 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 14:25:21,917 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:25:21,917 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 02:25:21" (1/3) ... [2022-07-23 14:25:21,918 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@523cbd47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:25:21, skipping insertion in model container [2022-07-23 14:25:21,918 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:25:21,918 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:25:21" (2/3) ... [2022-07-23 14:25:21,919 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@523cbd47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:25:21, skipping insertion in model container [2022-07-23 14:25:21,919 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:25:21,919 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:25:21" (3/3) ... [2022-07-23 14:25:21,920 INFO L354 chiAutomizerObserver]: Analyzing ICFG GulwaniJainKoskinen-2009PLDI-Fig1-alloca.i [2022-07-23 14:25:21,954 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 14:25:21,954 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 14:25:21,954 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 14:25:21,954 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 14:25:21,954 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 14:25:21,954 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 14:25:21,954 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 14:25:21,955 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 14:25:21,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:25:21,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:25:21,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:25:21,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:25:21,972 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-23 14:25:21,973 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:25:21,973 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 14:25:21,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:25:21,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:25:21,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:25:21,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:25:21,974 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-23 14:25:21,975 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:25:21,979 INFO L752 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 12#L552true assume !main_#t~short9#1; 2#L552-2true assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 8#L556-2true [2022-07-23 14:25:21,979 INFO L754 eck$LassoCheckResult]: Loop: 8#L556-2true call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 11#L555-1true assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 7#L556true assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 8#L556-2true [2022-07-23 14:25:21,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:25:21,983 INFO L85 PathProgramCache]: Analyzing trace with hash 925671, now seen corresponding path program 1 times [2022-07-23 14:25:21,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:25:21,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353410953] [2022-07-23 14:25:21,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:25:21,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:25:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:25:22,155 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-23 14:25:22,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:25:22,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353410953] [2022-07-23 14:25:22,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353410953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:25:22,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:25:22,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 14:25:22,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432609500] [2022-07-23 14:25:22,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:25:22,163 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:25:22,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:25:22,166 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 1 times [2022-07-23 14:25:22,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:25:22,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324275703] [2022-07-23 14:25:22,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:25:22,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:25:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:25:22,183 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:25:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:25:22,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:25:22,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:25:22,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 14:25:22,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 14:25:22,350 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:25:22,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:25:22,361 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-07-23 14:25:22,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 14:25:22,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2022-07-23 14:25:22,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:25:22,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 7 states and 8 transitions. [2022-07-23 14:25:22,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-23 14:25:22,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-23 14:25:22,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2022-07-23 14:25:22,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:25:22,369 INFO L369 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-07-23 14:25:22,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2022-07-23 14:25:22,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-07-23 14:25:22,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:25:22,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2022-07-23 14:25:22,384 INFO L392 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-07-23 14:25:22,384 INFO L374 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-07-23 14:25:22,385 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 14:25:22,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2022-07-23 14:25:22,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:25:22,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:25:22,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:25:22,386 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-23 14:25:22,386 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:25:22,386 INFO L752 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 37#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 40#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 34#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 35#L556-2 [2022-07-23 14:25:22,386 INFO L754 eck$LassoCheckResult]: Loop: 35#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 39#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 38#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 35#L556-2 [2022-07-23 14:25:22,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:25:22,387 INFO L85 PathProgramCache]: Analyzing trace with hash 925609, now seen corresponding path program 1 times [2022-07-23 14:25:22,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:25:22,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641993163] [2022-07-23 14:25:22,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:25:22,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:25:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:25:22,410 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:25:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:25:22,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:25:22,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:25:22,432 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 2 times [2022-07-23 14:25:22,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:25:22,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779016574] [2022-07-23 14:25:22,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:25:22,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:25:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:25:22,450 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:25:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:25:22,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:25:22,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:25:22,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029994, now seen corresponding path program 1 times [2022-07-23 14:25:22,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:25:22,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124645769] [2022-07-23 14:25:22,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:25:22,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:25:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:25:22,493 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:25:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:25:22,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:25:23,206 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:25:23,207 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:25:23,207 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:25:23,207 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:25:23,207 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:25:23,207 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:23,207 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:25:23,208 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:25:23,208 INFO L133 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca.i_Iteration2_Lasso [2022-07-23 14:25:23,208 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:25:23,208 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:25:23,224 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-23 14:25:23,227 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-23 14:25:23,229 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-23 14:25:23,234 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-23 14:25:23,236 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-23 14:25:23,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-23 14:25:23,240 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-23 14:25:23,242 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-23 14:25:23,245 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-23 14:25:23,249 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-23 14:25:23,251 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-23 14:25:23,253 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-23 14:25:23,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-23 14:25:23,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-23 14:25:23,260 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-23 14:25:23,261 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-23 14:25:23,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-23 14:25:23,265 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-23 14:25:23,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-23 14:25:23,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-23 14:25:23,662 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-23 14:25:23,976 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:25:23,979 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:25:23,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:23,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:23,981 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-23 14:25:24,000 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-23 14:25:24,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:25:24,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:25:24,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:25:24,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:25:24,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,067 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-23 14:25:24,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,070 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-23 14:25:24,071 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-23 14:25:24,072 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-23 14:25:24,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:25:24,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:25:24,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:25:24,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,099 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-23 14:25:24,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,102 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-23 14:25:24,103 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-23 14:25:24,105 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-23 14:25:24,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:25:24,115 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:25:24,133 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,149 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-23 14:25:24,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,151 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-23 14:25:24,152 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-23 14:25:24,153 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-23 14:25:24,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:25:24,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:25:24,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:25:24,172 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-23 14:25:24,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,189 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-23 14:25:24,190 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-23 14:25:24,192 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-23 14:25:24,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:25:24,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:25:24,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:25:24,200 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,216 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-23 14:25:24,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,217 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-23 14:25:24,218 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-23 14:25:24,219 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-23 14:25:24,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:25:24,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:25:24,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,257 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-23 14:25:24,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,260 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-23 14:25:24,261 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-23 14:25:24,263 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-23 14:25:24,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:25:24,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:25:24,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:25:24,287 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-23 14:25:24,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,305 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-23 14:25:24,306 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-23 14:25:24,307 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-23 14:25:24,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:25:24,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:25:24,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,340 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-23 14:25:24,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,341 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-23 14:25:24,342 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-23 14:25:24,343 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-23 14:25:24,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:25:24,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,350 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:25:24,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,350 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:25:24,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:25:24,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,370 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-23 14:25:24,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,372 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-23 14:25:24,378 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-23 14:25:24,378 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-23 14:25:24,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:25:24,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:25:24,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:25:24,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-23 14:25:24,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,405 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-23 14:25:24,408 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-23 14:25:24,409 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-23 14:25:24,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:25:24,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:25:24,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:25:24,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,434 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-23 14:25:24,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,435 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-23 14:25:24,436 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-23 14:25:24,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:25:24,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:25:24,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:25:24,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:25:24,445 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,460 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-23 14:25:24,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,461 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-23 14:25:24,462 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-23 14:25:24,463 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-23 14:25:24,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:25:24,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:25:24,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-23 14:25:24,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,536 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-23 14:25:24,538 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-23 14:25:24,539 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-23 14:25:24,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:25:24,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:25:24,563 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-23 14:25:24,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,584 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-23 14:25:24,584 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-23 14:25:24,586 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-23 14:25:24,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:25:24,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:25:24,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:25:24,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-23 14:25:24,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,632 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-23 14:25:24,633 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-23 14:25:24,635 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-23 14:25:24,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:25:24,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:25:24,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:25:24,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,660 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-23 14:25:24,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,664 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-23 14:25:24,666 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-23 14:25:24,667 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-23 14:25:24,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:25:24,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:25:24,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:25:24,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-07-23 14:25:24,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,704 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-23 14:25:24,705 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-23 14:25:24,706 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-23 14:25:24,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:25:24,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:25:24,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:25:24,724 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,739 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-23 14:25:24,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,741 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-23 14:25:24,743 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-23 14:25:24,743 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-23 14:25:24,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:25:24,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:25:24,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-23 14:25:24,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,777 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-23 14:25:24,778 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-23 14:25:24,779 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-23 14:25:24,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:25:24,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:25:24,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,831 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-23 14:25:24,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,833 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-23 14:25:24,837 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-23 14:25:24,838 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-23 14:25:24,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:25:24,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:25:24,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-23 14:25:24,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,885 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-23 14:25:24,899 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-23 14:25:24,900 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-23 14:25:24,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:25:24,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:25:24,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-23 14:25:24,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,942 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-23 14:25:24,943 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-23 14:25:24,944 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-23 14:25:24,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,953 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:25:24,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:25:24,963 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:24,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-23 14:25:24,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:24,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:24,982 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-23 14:25:24,983 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-23 14:25:24,984 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-23 14:25:24,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:24,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:24,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:24,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:24,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:25:24,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:25:25,010 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:25,041 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-23 14:25:25,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:25,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:25,056 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-23 14:25:25,057 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-23 14:25:25,058 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-23 14:25:25,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:25,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:25,064 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:25:25,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:25,073 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-23 14:25:25,073 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-23 14:25:25,090 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:25:25,135 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-23 14:25:25,135 INFO L444 ModelExtractionUtils]: 7 out of 21 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-23 14:25:25,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:25,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:25,138 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-23 14:25:25,199 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-23 14:25:25,200 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:25:25,222 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2022-07-23 14:25:25,222 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:25:25,222 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~id~0#1.base) ULTIMATE.start_main_~id~0#1.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_1 + 3*v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~id~0#1.base) ULTIMATE.start_main_~id~0#1.offset)_1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~id~0#1.base) ULTIMATE.start_main_~id~0#1.offset)_1 >= 0] [2022-07-23 14:25:25,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-23 14:25:25,324 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-23 14:25:25,329 INFO L293 tatePredicateManager]: 22 out of 25 supporting invariants were superfluous and have been removed [2022-07-23 14:25:25,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:25:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:25:25,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-23 14:25:25,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:25:25,416 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 14:25:25,417 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 14:25:25,443 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-23 14:25:25,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-07-23 14:25:25,448 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-07-23 14:25:25,467 INFO L356 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2022-07-23 14:25:25,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 70 [2022-07-23 14:25:25,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-23 14:25:25,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 38 treesize of output 25 [2022-07-23 14:25:25,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-23 14:25:25,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-23 14:25:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:25:25,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 14:25:25,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:25:25,680 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-23 14:25:25,683 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2022-07-23 14:25:25,683 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:25:25,764 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 16 transitions. Complement of second has 9 states. [2022-07-23 14:25:25,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 14:25:25,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:25:25,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2022-07-23 14:25:25,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 4 letters. Loop has 3 letters. [2022-07-23 14:25:25,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:25:25,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 7 letters. Loop has 3 letters. [2022-07-23 14:25:25,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:25:25,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 4 letters. Loop has 6 letters. [2022-07-23 14:25:25,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:25:25,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2022-07-23 14:25:25,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:25:25,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2022-07-23 14:25:25,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-07-23 14:25:25,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-23 14:25:25,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2022-07-23 14:25:25,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:25:25,772 INFO L369 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-07-23 14:25:25,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2022-07-23 14:25:25,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-23 14:25:25,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:25:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2022-07-23 14:25:25,773 INFO L392 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-07-23 14:25:25,773 INFO L374 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-07-23 14:25:25,773 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 14:25:25,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2022-07-23 14:25:25,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:25:25,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:25:25,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:25:25,775 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:25:25,775 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:25:25,775 INFO L752 eck$LassoCheckResult]: Stem: 214#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 215#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 223#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 212#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 213#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 222#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 216#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 217#L556-2 [2022-07-23 14:25:25,776 INFO L754 eck$LassoCheckResult]: Loop: 217#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 220#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 224#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 217#L556-2 [2022-07-23 14:25:25,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:25:25,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029996, now seen corresponding path program 1 times [2022-07-23 14:25:25,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:25:25,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491688767] [2022-07-23 14:25:25,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:25:25,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:25:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:25:25,845 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-23 14:25:25,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:25:25,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491688767] [2022-07-23 14:25:25,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491688767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:25:25,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:25:25,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 14:25:25,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852969413] [2022-07-23 14:25:25,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:25:25,846 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:25:25,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:25:25,847 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 3 times [2022-07-23 14:25:25,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:25:25,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271596415] [2022-07-23 14:25:25,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:25:25,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:25:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:25:25,852 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:25:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:25:25,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:25:25,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:25:25,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 14:25:25,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 14:25:25,982 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:25:26,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:25:26,013 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-07-23 14:25:26,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 14:25:26,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2022-07-23 14:25:26,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:25:26,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 17 transitions. [2022-07-23 14:25:26,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-23 14:25:26,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-23 14:25:26,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2022-07-23 14:25:26,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:25:26,015 INFO L369 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-23 14:25:26,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2022-07-23 14:25:26,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2022-07-23 14:25:26,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:25:26,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-07-23 14:25:26,016 INFO L392 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-23 14:25:26,016 INFO L374 stractBuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-23 14:25:26,016 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 14:25:26,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2022-07-23 14:25:26,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:25:26,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:25:26,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:25:26,017 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-07-23 14:25:26,017 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:25:26,017 INFO L752 eck$LassoCheckResult]: Stem: 257#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 258#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 265#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 255#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 256#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 263#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 261#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 262#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 264#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 259#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 260#L556-2 [2022-07-23 14:25:26,017 INFO L754 eck$LassoCheckResult]: Loop: 260#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 266#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 267#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 260#L556-2 [2022-07-23 14:25:26,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:25:26,018 INFO L85 PathProgramCache]: Analyzing trace with hash 658021387, now seen corresponding path program 1 times [2022-07-23 14:25:26,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:25:26,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244068986] [2022-07-23 14:25:26,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:25:26,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:25:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:25:26,047 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:25:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:25:26,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:25:26,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:25:26,079 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 4 times [2022-07-23 14:25:26,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:25:26,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422036724] [2022-07-23 14:25:26,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:25:26,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:25:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:25:26,099 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:25:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:25:26,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:25:26,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:25:26,103 INFO L85 PathProgramCache]: Analyzing trace with hash 884417224, now seen corresponding path program 2 times [2022-07-23 14:25:26,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:25:26,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203140006] [2022-07-23 14:25:26,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:25:26,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:25:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:25:26,120 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:25:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:25:26,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:25:27,423 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:25:27,423 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:25:27,423 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:25:27,423 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:25:27,423 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:25:27,423 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:27,423 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:25:27,423 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:25:27,423 INFO L133 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca.i_Iteration4_Lasso [2022-07-23 14:25:27,423 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:25:27,423 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:25:27,425 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-23 14:25:27,760 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-23 14:25:27,762 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-23 14:25:27,763 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-23 14:25:27,775 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-23 14:25:27,776 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-23 14:25:27,778 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-23 14:25:27,779 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-23 14:25:27,781 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-23 14:25:27,782 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-23 14:25:27,784 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-23 14:25:27,785 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-23 14:25:27,787 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-23 14:25:27,788 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-23 14:25:27,790 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-23 14:25:27,792 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-23 14:25:27,793 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-23 14:25:27,794 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-23 14:25:27,796 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-23 14:25:27,797 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-23 14:25:27,799 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-23 14:25:27,801 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-23 14:25:27,804 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-23 14:25:28,091 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:25:28,092 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:25:28,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:28,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:28,093 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-23 14:25:28,115 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-23 14:25:28,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:25:28,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:28,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:28,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:28,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:28,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:25:28,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:25:28,140 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:28,156 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-23 14:25:28,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:28,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:28,158 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-23 14:25:28,158 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-23 14:25:28,159 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-23 14:25:28,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:28,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:28,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:28,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:28,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:25:28,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:25:28,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:28,200 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-23 14:25:28,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:28,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:28,201 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-23 14:25:28,202 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-23 14:25:28,203 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-23 14:25:28,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:28,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:28,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:28,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:28,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:25:28,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:25:28,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:28,253 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-23 14:25:28,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:28,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:28,254 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-23 14:25:28,256 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-23 14:25:28,260 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-23 14:25:28,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:28,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:28,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:28,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:28,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:25:28,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:25:28,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:28,287 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-23 14:25:28,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:28,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:28,289 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:25:28,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-23 14:25:28,291 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-23 14:25:28,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:28,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:28,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:25:28,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:28,298 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:25:28,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:25:28,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:25:28,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-23 14:25:28,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:28,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:28,324 INFO L229 MonitoredProcess]: Starting monitored process 33 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-23 14:25:28,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-23 14:25:28,326 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-23 14:25:28,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:25:28,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:25:28,331 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:25:28,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:25:28,340 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-23 14:25:28,340 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-23 14:25:28,358 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:25:28,382 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-23 14:25:28,382 INFO L444 ModelExtractionUtils]: 4 out of 21 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-07-23 14:25:28,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:25:28,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:28,383 INFO L229 MonitoredProcess]: Starting monitored process 34 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-23 14:25:28,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-23 14:25:28,385 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:25:28,407 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2022-07-23 14:25:28,407 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:25:28,407 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_2) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_2 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_2 + 1 Supporting invariants [] [2022-07-23 14:25:28,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-23 14:25:28,509 INFO L293 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2022-07-23 14:25:28,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:25:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:25:28,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 14:25:28,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:25:28,560 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 14:25:28,560 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 14:25:28,605 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 14:25:28,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 14:25:28,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-23 14:25:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:25:28,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 14:25:28,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:25:28,655 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-23 14:25:28,655 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-07-23 14:25:28,656 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:25:28,698 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19 states and 23 transitions. Complement of second has 9 states. [2022-07-23 14:25:28,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 14:25:28,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:25:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2022-07-23 14:25:28,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 10 letters. Loop has 3 letters. [2022-07-23 14:25:28,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:25:28,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 13 letters. Loop has 3 letters. [2022-07-23 14:25:28,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:25:28,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 10 letters. Loop has 6 letters. [2022-07-23 14:25:28,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:25:28,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2022-07-23 14:25:28,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:25:28,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2022-07-23 14:25:28,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-07-23 14:25:28,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-23 14:25:28,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2022-07-23 14:25:28,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:25:28,702 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-23 14:25:28,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2022-07-23 14:25:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-23 14:25:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:25:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-07-23 14:25:28,704 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-23 14:25:28,704 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-23 14:25:28,704 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 14:25:28,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2022-07-23 14:25:28,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:25:28,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:25:28,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:25:28,705 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1] [2022-07-23 14:25:28,705 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:25:28,705 INFO L752 eck$LassoCheckResult]: Stem: 459#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 460#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 468#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 457#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 458#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 469#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 475#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 474#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 473#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 470#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 471#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 467#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 461#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 462#L556-2 [2022-07-23 14:25:28,705 INFO L754 eck$LassoCheckResult]: Loop: 462#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 465#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 472#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 462#L556-2 [2022-07-23 14:25:28,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:25:28,706 INFO L85 PathProgramCache]: Analyzing trace with hash 884417226, now seen corresponding path program 3 times [2022-07-23 14:25:28,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:25:28,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741229006] [2022-07-23 14:25:28,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:25:28,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:25:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:25:28,777 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 14:25:28,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:25:28,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741229006] [2022-07-23 14:25:28,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741229006] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:25:28,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557240871] [2022-07-23 14:25:28,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 14:25:28,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:25:28,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:28,796 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:25:28,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-07-23 14:25:28,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-23 14:25:28,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:25:28,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 14:25:28,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:25:28,878 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 14:25:28,878 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 14:25:28,898 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 14:25:28,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 14:25:28,911 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-23 14:25:28,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2022-07-23 14:25:28,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2022-07-23 14:25:28,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-23 14:25:28,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 14:25:28,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-23 14:25:28,990 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:25:28,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:25:29,045 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 14:25:29,045 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-07-23 14:25:29,140 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_210 Int) (|v_ULTIMATE.start_main_#t~malloc10#1.base_83| Int) (|v_ULTIMATE.start_main_~tmp~0#1.offset_65| Int) (|ULTIMATE.start_main_~maxId~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_5 |v_ULTIMATE.start_main_~tmp~0#1.offset_65|))) (or (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_83| (store (select |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_83|) |v_ULTIMATE.start_main_~tmp~0#1.offset_65| v_ArrVal_210)) |c_ULTIMATE.start_main_~maxId~0#1.base|) |ULTIMATE.start_main_~maxId~0#1.offset|) v_ArrVal_210) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_83|) 0)) (not (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|) 1) v_ArrVal_210)) (not (<= .cse0 0)) (<= .cse0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_83| v_arrayElimArr_5) |c_ULTIMATE.start_main_~maxId~0#1.base|) |ULTIMATE.start_main_~maxId~0#1.offset|))))) is different from false [2022-07-23 14:25:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:25:29,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557240871] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:25:29,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:25:29,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2022-07-23 14:25:29,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412174425] [2022-07-23 14:25:29,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:25:29,194 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:25:29,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:25:29,194 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 5 times [2022-07-23 14:25:29,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:25:29,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604113914] [2022-07-23 14:25:29,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:25:29,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:25:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:25:29,198 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:25:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:25:29,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:25:29,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:25:29,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 14:25:29,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=252, Unknown=1, NotChecked=32, Total=342 [2022-07-23 14:25:29,282 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 7 Second operand has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:25:29,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:25:29,451 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-07-23 14:25:29,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 14:25:29,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 39 transitions. [2022-07-23 14:25:29,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-07-23 14:25:29,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 32 states and 35 transitions. [2022-07-23 14:25:29,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-23 14:25:29,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-23 14:25:29,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 35 transitions. [2022-07-23 14:25:29,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:25:29,454 INFO L369 hiAutomatonCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-07-23 14:25:29,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 35 transitions. [2022-07-23 14:25:29,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-07-23 14:25:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:25:29,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-07-23 14:25:29,455 INFO L392 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-07-23 14:25:29,455 INFO L374 stractBuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-07-23 14:25:29,456 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-23 14:25:29,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 31 transitions. [2022-07-23 14:25:29,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-07-23 14:25:29,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:25:29,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:25:29,456 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1, 1, 1, 1] [2022-07-23 14:25:29,456 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2022-07-23 14:25:29,457 INFO L752 eck$LassoCheckResult]: Stem: 628#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 629#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 636#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 626#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 627#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 634#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 652#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 651#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 649#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 630#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 631#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 653#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 632#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 633#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 635#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 639#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 650#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 645#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 646#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 644#L556-2 [2022-07-23 14:25:29,457 INFO L754 eck$LassoCheckResult]: Loop: 644#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 648#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 640#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 641#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 637#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 638#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 643#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 647#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 642#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 644#L556-2 [2022-07-23 14:25:29,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:25:29,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1816884246, now seen corresponding path program 4 times [2022-07-23 14:25:29,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:25:29,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103752191] [2022-07-23 14:25:29,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:25:29,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:25:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:25:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 14:25:29,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:25:29,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103752191] [2022-07-23 14:25:29,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103752191] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:25:29,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555077459] [2022-07-23 14:25:29,654 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 14:25:29,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:25:29,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:29,655 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:25:29,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-07-23 14:25:29,731 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 14:25:29,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:25:29,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-23 14:25:29,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:25:29,753 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 14:25:29,754 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 14:25:29,804 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-23 14:25:29,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-07-23 14:25:29,830 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-23 14:25:29,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 14:25:29,905 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 14:25:29,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2022-07-23 14:25:29,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-07-23 14:25:29,966 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 14:25:29,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2022-07-23 14:25:30,076 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 14:25:30,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 46 [2022-07-23 14:25:30,205 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 14:25:30,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 51 [2022-07-23 14:25:30,401 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 14:25:30,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 121 treesize of output 117 [2022-07-23 14:25:30,536 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:25:30,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:25:31,635 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 14:25:31,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 86 [2022-07-23 14:25:31,903 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_269 Int) (v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_85| Int) (|ULTIMATE.start_main_~maxId~0#1.offset| Int) (|v_ULTIMATE.start_main_~tmp~0#1.offset_68| Int)) (let ((.cse0 (select v_arrayElimArr_8 |v_ULTIMATE.start_main_~tmp~0#1.offset_68|)) (.cse1 (select v_arrayElimArr_6 |v_ULTIMATE.start_main_~tmp~0#1.offset_68|)) (.cse3 (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_85| v_arrayElimArr_7)) (.cse2 (select v_arrayElimArr_7 |v_ULTIMATE.start_main_~tmp~0#1.offset_68|))) (or (not (<= .cse0 0)) (not (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|) 1) v_ArrVal_269)) (= .cse0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_85| v_arrayElimArr_8) |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|)) (not (= v_arrayElimArr_8 (store v_arrayElimArr_7 |v_ULTIMATE.start_main_~tmp~0#1.offset_68| .cse0))) (not (= v_arrayElimArr_6 (store v_arrayElimArr_8 |v_ULTIMATE.start_main_~tmp~0#1.offset_68| .cse1))) (<= .cse2 (select (select .cse3 |c_ULTIMATE.start_main_~maxId~0#1.base|) |ULTIMATE.start_main_~maxId~0#1.offset|)) (not (<= .cse2 (+ .cse1 1))) (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_85| (store (select |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_85|) |v_ULTIMATE.start_main_~tmp~0#1.offset_68| v_ArrVal_269)) |c_ULTIMATE.start_main_~maxId~0#1.base|) |ULTIMATE.start_main_~maxId~0#1.offset|) v_ArrVal_269) (not (<= .cse1 (+ .cse0 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_85|) 0)) (= .cse1 (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_85| v_arrayElimArr_6) |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|)) (= (select (select .cse3 |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|) .cse2)))) is different from false [2022-07-23 14:25:32,025 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:25:32,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555077459] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:25:32,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:25:32,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 37 [2022-07-23 14:25:32,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455784284] [2022-07-23 14:25:32,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:25:32,026 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:25:32,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:25:32,026 INFO L85 PathProgramCache]: Analyzing trace with hash -803259212, now seen corresponding path program 1 times [2022-07-23 14:25:32,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:25:32,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420745654] [2022-07-23 14:25:32,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:25:32,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:25:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:25:32,034 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:25:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:25:32,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:25:32,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:25:32,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-23 14:25:32,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1083, Unknown=1, NotChecked=70, Total=1406 [2022-07-23 14:25:32,340 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. cyclomatic complexity: 6 Second operand has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:25:46,220 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|))) (let ((.cse4 (<= |c_ULTIMATE.start_main_#t~mem15#1| |c_ULTIMATE.start_main_#t~mem16#1|)) (.cse2 (= .cse9 0)) (.cse3 (<= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~maxId~0#1.base|) |c_ULTIMATE.start_main_~maxId~0#1.offset|)))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~id~0#1.base|) 1) (forall ((v_ArrVal_276 Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~tmp~0#1.base|))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~tmp~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~tmp~0#1.offset| v_ArrVal_276)))) (or (<= v_ArrVal_276 (select (select .cse0 |c_ULTIMATE.start_main_~maxId~0#1.base|) |c_ULTIMATE.start_main_~maxId~0#1.offset|)) (= v_ArrVal_276 (select (select .cse0 |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|)) (not (<= v_ArrVal_276 (+ (select .cse1 |c_ULTIMATE.start_main_~tmp~0#1.offset|) 1))))))) (or (not |c_ULTIMATE.start_main_#t~short9#1|) .cse2 .cse3) (or (not .cse4) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~tmp~0#1.base| v_arrayElimArr_7)) (.cse5 (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~tmp~0#1.offset|)) (.cse7 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~tmp~0#1.offset|)) (.cse8 (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~tmp~0#1.offset|))) (or (<= .cse5 (select (select .cse6 |c_ULTIMATE.start_main_~maxId~0#1.base|) |c_ULTIMATE.start_main_~maxId~0#1.offset|)) (not (= v_arrayElimArr_6 (store v_arrayElimArr_8 |c_ULTIMATE.start_main_~tmp~0#1.offset| .cse7))) (not (<= .cse5 (+ .cse7 1))) (not (= v_arrayElimArr_8 (store v_arrayElimArr_7 |c_ULTIMATE.start_main_~tmp~0#1.offset| .cse8))) (not (<= .cse8 0)) (not (<= .cse7 (+ .cse8 1))) (= (select (select .cse6 |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|) .cse5) (= .cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~tmp~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|)) (= .cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~tmp~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|)))))) .cse4 (or .cse2 (<= 1 .cse9)) (or .cse2 .cse3) (= (select |c_#valid| |c_ULTIMATE.start_main_~maxId~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~id~0#1.base| |c_ULTIMATE.start_main_~tmp~0#1.base|)) (not (= |c_ULTIMATE.start_main_~maxId~0#1.base| |c_ULTIMATE.start_main_~tmp~0#1.base|)) (forall ((v_ArrVal_276 Int) (v_ArrVal_274 Int) (v_ArrVal_273 Int)) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~tmp~0#1.base|))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~tmp~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~tmp~0#1.offset| v_ArrVal_276)))) (or (<= v_ArrVal_276 (select (select .cse10 |c_ULTIMATE.start_main_~maxId~0#1.base|) |c_ULTIMATE.start_main_~maxId~0#1.offset|)) (not (<= v_ArrVal_274 (+ v_ArrVal_273 1))) (= v_ArrVal_274 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~tmp~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~tmp~0#1.offset| v_ArrVal_274)) |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|)) (not (<= v_ArrVal_273 0)) (= v_ArrVal_276 (select (select .cse10 |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|)) (not (<= v_ArrVal_276 (+ v_ArrVal_274 1))) (= v_ArrVal_273 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~tmp~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~tmp~0#1.offset| v_ArrVal_273)) |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|))))))))) is different from false [2022-07-23 14:25:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:25:46,784 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-07-23 14:25:46,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-23 14:25:46,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 76 transitions. [2022-07-23 14:25:46,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-07-23 14:25:46,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 63 states and 68 transitions. [2022-07-23 14:25:46,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-07-23 14:25:46,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-07-23 14:25:46,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 68 transitions. [2022-07-23 14:25:46,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:25:46,788 INFO L369 hiAutomatonCegarLoop]: Abstraction has 63 states and 68 transitions. [2022-07-23 14:25:46,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 68 transitions. [2022-07-23 14:25:46,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2022-07-23 14:25:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:25:46,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-07-23 14:25:46,790 INFO L392 hiAutomatonCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-07-23 14:25:46,790 INFO L374 stractBuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-07-23 14:25:46,790 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-23 14:25:46,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 50 transitions. [2022-07-23 14:25:46,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-07-23 14:25:46,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:25:46,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:25:46,793 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 5, 2, 1, 1, 1, 1] [2022-07-23 14:25:46,793 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2022-07-23 14:25:46,793 INFO L752 eck$LassoCheckResult]: Stem: 935#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 936#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 943#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 933#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 934#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 978#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 977#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 976#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 945#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 946#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 953#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 944#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 937#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 938#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 941#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 939#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 940#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 967#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 966#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 965#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 963#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 964#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 962#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 961#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 959#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 951#L556-2 [2022-07-23 14:25:46,793 INFO L754 eck$LassoCheckResult]: Loop: 951#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 960#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 947#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 948#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 952#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 958#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 957#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 956#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 955#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 950#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 954#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 949#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 951#L556-2 [2022-07-23 14:25:46,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:25:46,793 INFO L85 PathProgramCache]: Analyzing trace with hash 636022350, now seen corresponding path program 5 times [2022-07-23 14:25:46,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:25:46,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247236607] [2022-07-23 14:25:46,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:25:46,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:25:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:25:47,121 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:25:47,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:25:47,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247236607] [2022-07-23 14:25:47,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247236607] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:25:47,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564903437] [2022-07-23 14:25:47,122 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 14:25:47,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:25:47,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:25:47,160 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:25:47,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-07-23 14:25:47,261 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-07-23 14:25:47,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:25:47,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-23 14:25:47,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:25:47,277 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 14:25:47,277 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 14:25:47,313 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-23 14:25:47,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-23 14:25:47,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-23 14:25:47,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-23 14:25:47,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 9 [2022-07-23 14:25:47,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-23 14:25:47,422 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 14:25:47,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 14:25:47,440 INFO L356 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2022-07-23 14:25:47,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 63 [2022-07-23 14:25:47,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-23 14:25:47,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-23 14:25:47,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 9 [2022-07-23 14:25:47,541 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-07-23 14:25:47,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 38 [2022-07-23 14:25:47,644 INFO L356 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2022-07-23 14:25:47,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 51 [2022-07-23 14:25:47,839 INFO L356 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2022-07-23 14:25:47,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 43 [2022-07-23 14:25:47,988 INFO L356 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2022-07-23 14:25:47,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 42 [2022-07-23 14:25:48,648 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 14:25:48,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 40 [2022-07-23 14:25:49,310 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 14:25:49,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 46 [2022-07-23 14:25:49,453 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-23 14:25:49,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 31 [2022-07-23 14:25:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:25:49,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:26:13,158 WARN L233 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 14:26:25,269 WARN L233 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 14:26:37,445 WARN L233 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 14:27:13,720 WARN L233 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 14:27:49,000 WARN L233 SmtUtils]: Spent 12.10s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 14:27:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 9 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:27:49,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564903437] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:27:49,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:27:49,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 42 [2022-07-23 14:27:49,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931897406] [2022-07-23 14:27:49,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:27:49,106 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:27:49,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:49,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1662545091, now seen corresponding path program 2 times [2022-07-23 14:27:49,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:49,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714849701] [2022-07-23 14:27:49,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:49,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:49,126 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:49,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:50,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:27:50,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-23 14:27:50,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1590, Unknown=34, NotChecked=0, Total=1806 [2022-07-23 14:27:50,062 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. cyclomatic complexity: 7 Second operand has 43 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:27:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:27:57,911 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-07-23 14:27:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-23 14:27:57,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 84 transitions. [2022-07-23 14:27:57,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-07-23 14:27:57,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 75 states and 80 transitions. [2022-07-23 14:27:57,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-07-23 14:27:57,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-07-23 14:27:57,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 80 transitions. [2022-07-23 14:27:57,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:27:57,914 INFO L369 hiAutomatonCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-07-23 14:27:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 80 transitions. [2022-07-23 14:27:57,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 46. [2022-07-23 14:27:57,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:27:57,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-07-23 14:27:57,916 INFO L392 hiAutomatonCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-07-23 14:27:57,916 INFO L374 stractBuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-07-23 14:27:57,916 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-23 14:27:57,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 50 transitions. [2022-07-23 14:27:57,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-07-23 14:27:57,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:27:57,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:27:57,917 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 1, 1, 1, 1] [2022-07-23 14:27:57,917 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2022-07-23 14:27:57,917 INFO L752 eck$LassoCheckResult]: Stem: 1298#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1299#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 1307#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 1296#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 1297#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1333#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1332#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1331#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1330#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1329#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1328#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1327#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1326#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1306#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1305#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1302#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1303#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1325#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1324#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1323#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1322#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1321#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1320#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1312#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1318#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1310#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1311#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1300#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1301#L556-2 [2022-07-23 14:27:57,917 INFO L754 eck$LassoCheckResult]: Loop: 1301#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1341#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1334#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1313#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1308#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1309#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1340#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1339#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1338#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1336#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1337#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1335#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1301#L556-2 [2022-07-23 14:27:57,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:57,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1973167277, now seen corresponding path program 6 times [2022-07-23 14:27:57,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:57,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711177585] [2022-07-23 14:27:57,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:57,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:58,363 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 1 proven. 74 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-23 14:27:58,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:27:58,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711177585] [2022-07-23 14:27:58,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711177585] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:27:58,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602727396] [2022-07-23 14:27:58,363 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 14:27:58,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:27:58,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:58,365 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:27:58,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-07-23 14:27:58,492 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-07-23 14:27:58,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:27:58,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-23 14:27:58,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:27:58,506 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-23 14:27:58,508 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 6 treesize of output 5 [2022-07-23 14:27:58,520 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 14:27:58,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 14:27:58,571 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 14:27:58,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 14:27:58,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-07-23 14:27:58,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-07-23 14:27:58,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2022-07-23 14:27:58,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-07-23 14:27:58,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2022-07-23 14:27:58,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2022-07-23 14:27:58,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2022-07-23 14:27:59,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 38 [2022-07-23 14:27:59,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 50 [2022-07-23 14:27:59,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 22 [2022-07-23 14:27:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 10 proven. 62 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 14:27:59,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:28:01,165 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_88| Int) (v_ArrVal_441 Int) (|v_ULTIMATE.start_main_~tmp~0#1.offset_73| Int) (|ULTIMATE.start_main_~maxId~0#1.offset| Int) (v_ArrVal_449 Int) (v_ArrVal_445 (Array Int Int))) (let ((.cse3 (select v_ArrVal_445 |v_ULTIMATE.start_main_~tmp~0#1.offset_73|))) (let ((.cse5 (+ .cse3 1))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|)) (.cse4 (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_88| (store v_ArrVal_445 |v_ULTIMATE.start_main_~tmp~0#1.offset_73| .cse5))) (.cse1 (select |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_88|))) (or (not (<= v_ArrVal_441 (+ 2 .cse0))) (let ((.cse2 (+ .cse0 1))) (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_88| (store .cse1 |v_ULTIMATE.start_main_~tmp~0#1.offset_73| .cse2)) |c_ULTIMATE.start_main_~maxId~0#1.base|) |ULTIMATE.start_main_~maxId~0#1.offset|) .cse2)) (<= v_ArrVal_449 (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_88| (store v_ArrVal_445 |v_ULTIMATE.start_main_~tmp~0#1.offset_73| v_ArrVal_449)) |c_ULTIMATE.start_main_~maxId~0#1.base|) |ULTIMATE.start_main_~maxId~0#1.offset|)) (not (<= v_ArrVal_449 (+ 2 .cse3))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_88|) 0)) (< (select (select .cse4 |c_ULTIMATE.start_main_~maxId~0#1.base|) |ULTIMATE.start_main_~maxId~0#1.offset|) .cse5) (= (select (select .cse4 |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|) .cse5) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_88| v_ArrVal_445) |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|) .cse3) (<= v_ArrVal_441 (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_88| (store .cse1 |v_ULTIMATE.start_main_~tmp~0#1.offset_73| v_ArrVal_441)) |c_ULTIMATE.start_main_~maxId~0#1.base|) |ULTIMATE.start_main_~maxId~0#1.offset|))))))) is different from false [2022-07-23 14:28:01,267 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 59 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-23 14:28:01,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602727396] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:28:01,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:28:01,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 41 [2022-07-23 14:28:01,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458455897] [2022-07-23 14:28:01,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:28:01,268 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:28:01,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:01,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1662545091, now seen corresponding path program 3 times [2022-07-23 14:28:01,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:01,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890561633] [2022-07-23 14:28:01,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:01,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:01,278 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:01,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:02,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:28:02,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-23 14:28:02,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1414, Unknown=37, NotChecked=78, Total=1722 [2022-07-23 14:28:02,156 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. cyclomatic complexity: 7 Second operand has 42 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:28:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:28:03,419 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2022-07-23 14:28:03,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 14:28:03,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 72 transitions. [2022-07-23 14:28:03,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-07-23 14:28:03,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 47 states and 51 transitions. [2022-07-23 14:28:03,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-07-23 14:28:03,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-23 14:28:03,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 51 transitions. [2022-07-23 14:28:03,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:28:03,425 INFO L369 hiAutomatonCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-07-23 14:28:03,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 51 transitions. [2022-07-23 14:28:03,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-07-23 14:28:03,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:28:03,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-07-23 14:28:03,434 INFO L392 hiAutomatonCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-07-23 14:28:03,435 INFO L374 stractBuchiCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-07-23 14:28:03,435 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-23 14:28:03,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 43 transitions. [2022-07-23 14:28:03,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-07-23 14:28:03,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:28:03,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:28:03,437 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 1, 1, 1, 1] [2022-07-23 14:28:03,438 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2022-07-23 14:28:03,438 INFO L752 eck$LassoCheckResult]: Stem: 1650#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1651#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 1659#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 1648#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 1649#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1656#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1687#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1657#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1658#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1654#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1655#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1660#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1652#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1653#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1686#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1685#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1684#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1683#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1682#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1681#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1680#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1679#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1678#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1676#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1677#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1675#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1674#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1673#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1665#L556-2 [2022-07-23 14:28:03,439 INFO L754 eck$LassoCheckResult]: Loop: 1665#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1671#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1661#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1662#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1672#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1670#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1669#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1668#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1667#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 1664#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 1666#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1663#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1665#L556-2 [2022-07-23 14:28:03,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:03,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1653924631, now seen corresponding path program 7 times [2022-07-23 14:28:03,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:03,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335918837] [2022-07-23 14:28:03,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:03,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 8 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:28:04,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:28:04,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335918837] [2022-07-23 14:28:04,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335918837] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:28:04,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321265783] [2022-07-23 14:28:04,022 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 14:28:04,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:28:04,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:04,024 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:28:04,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-07-23 14:28:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:04,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-23 14:28:04,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:04,131 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 14:28:04,132 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 14:28:04,255 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-23 14:28:04,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2022-07-23 14:28:04,281 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-23 14:28:04,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 14:28:04,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-07-23 14:28:04,477 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 14:28:04,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-23 14:28:04,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-07-23 14:28:04,599 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 14:28:04,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2022-07-23 14:28:04,785 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 14:28:04,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 42 [2022-07-23 14:28:05,147 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 14:28:05,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 47 [2022-07-23 14:28:05,347 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 14:28:05,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 47 [2022-07-23 14:28:05,521 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 14:28:05,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 47 [2022-07-23 14:28:05,673 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-23 14:28:05,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 36 [2022-07-23 14:28:05,704 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:28:05,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:28:57,881 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-07-23 14:28:57,881 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-23 14:28:57,882 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:894) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:885) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkStemFeasibility(LassoCheck.java:840) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:755) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 43 more [2022-07-23 14:28:57,884 INFO L158 Benchmark]: Toolchain (without parser) took 216635.29ms. Allocated memory was 90.2MB in the beginning and 195.0MB in the end (delta: 104.9MB). Free memory was 54.1MB in the beginning and 79.3MB in the end (delta: -25.2MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2022-07-23 14:28:57,885 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 90.2MB. Free memory was 59.1MB in the beginning and 59.1MB in the end (delta: 27.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:28:57,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.36ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 54.0MB in the beginning and 81.1MB in the end (delta: -27.1MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2022-07-23 14:28:57,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.63ms. Allocated memory is still 111.1MB. Free memory was 81.1MB in the beginning and 79.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 14:28:57,885 INFO L158 Benchmark]: Boogie Preprocessor took 22.61ms. Allocated memory is still 111.1MB. Free memory was 79.4MB in the beginning and 78.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:28:57,885 INFO L158 Benchmark]: RCFGBuilder took 276.86ms. Allocated memory is still 111.1MB. Free memory was 78.1MB in the beginning and 67.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-23 14:28:57,885 INFO L158 Benchmark]: BuchiAutomizer took 215972.41ms. Allocated memory was 111.1MB in the beginning and 195.0MB in the end (delta: 83.9MB). Free memory was 67.1MB in the beginning and 79.3MB in the end (delta: -12.2MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. [2022-07-23 14:28:57,886 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.17ms. Allocated memory is still 90.2MB. Free memory was 59.1MB in the beginning and 59.1MB in the end (delta: 27.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.36ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 54.0MB in the beginning and 81.1MB in the end (delta: -27.1MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.63ms. Allocated memory is still 111.1MB. Free memory was 81.1MB in the beginning and 79.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.61ms. Allocated memory is still 111.1MB. Free memory was 79.4MB in the beginning and 78.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 276.86ms. Allocated memory is still 111.1MB. Free memory was 78.1MB in the beginning and 67.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 215972.41ms. Allocated memory was 111.1MB in the beginning and 195.0MB in the end (delta: 83.9MB). Free memory was 67.1MB in the beginning and 79.3MB in the end (delta: -12.2MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-23 14:28:57,899 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 101 [2022-07-23 14:28:57,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-07-23 14:28:58,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:58,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:58,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:58,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")