./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array17_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-15/array17_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 c64c4370fd8b6e918e28e5e9f3a24e52a6875ae7268f4c7e3f97f19ee293047c --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 14:31:40,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 14:31:40,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 14:31:40,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 14:31:40,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 14:31:40,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 14:31:40,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 14:31:40,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 14:31:40,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 14:31:40,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 14:31:40,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 14:31:40,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 14:31:40,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 14:31:40,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 14:31:40,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 14:31:40,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 14:31:40,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 14:31:40,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 14:31:40,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 14:31:40,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 14:31:40,095 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 14:31:40,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 14:31:40,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 14:31:40,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 14:31:40,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 14:31:40,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 14:31:40,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 14:31:40,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 14:31:40,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 14:31:40,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 14:31:40,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 14:31:40,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 14:31:40,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 14:31:40,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 14:31:40,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 14:31:40,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 14:31:40,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 14:31:40,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 14:31:40,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 14:31:40,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 14:31:40,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 14:31:40,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 14:31:40,114 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:31:40,136 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 14:31:40,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 14:31:40,137 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 14:31:40,137 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 14:31:40,138 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 14:31:40,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 14:31:40,138 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 14:31:40,138 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 14:31:40,139 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 14:31:40,139 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 14:31:40,139 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 14:31:40,139 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 14:31:40,140 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 14:31:40,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 14:31:40,140 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 14:31:40,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 14:31:40,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 14:31:40,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 14:31:40,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 14:31:40,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 14:31:40,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 14:31:40,142 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 14:31:40,142 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 14:31:40,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 14:31:40,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 14:31:40,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 14:31:40,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 14:31:40,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 14:31:40,143 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 14:31:40,144 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 -> c64c4370fd8b6e918e28e5e9f3a24e52a6875ae7268f4c7e3f97f19ee293047c [2022-07-23 14:31:40,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 14:31:40,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 14:31:40,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 14:31:40,374 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 14:31:40,375 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 14:31:40,376 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array17_alloca.i [2022-07-23 14:31:40,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68227240f/bbb195ef64524de38bc20bb00c11e1c2/FLAG4c9f3112b [2022-07-23 14:31:40,839 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 14:31:40,839 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array17_alloca.i [2022-07-23 14:31:40,845 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68227240f/bbb195ef64524de38bc20bb00c11e1c2/FLAG4c9f3112b [2022-07-23 14:31:40,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68227240f/bbb195ef64524de38bc20bb00c11e1c2 [2022-07-23 14:31:40,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 14:31:40,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 14:31:40,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 14:31:40,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 14:31:40,865 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 14:31:40,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:31:40" (1/1) ... [2022-07-23 14:31:40,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7953cb11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:31:40, skipping insertion in model container [2022-07-23 14:31:40,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:31:40" (1/1) ... [2022-07-23 14:31:40,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 14:31:40,908 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 14:31:41,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:31:41,107 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 14:31:41,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:31:41,184 INFO L208 MainTranslator]: Completed translation [2022-07-23 14:31:41,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:31:41 WrapperNode [2022-07-23 14:31:41,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 14:31:41,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 14:31:41,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 14:31:41,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 14:31:41,196 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:31:41" (1/1) ... [2022-07-23 14:31:41,209 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:31:41" (1/1) ... [2022-07-23 14:31:41,222 INFO L137 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 64 [2022-07-23 14:31:41,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 14:31:41,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 14:31:41,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 14:31:41,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 14:31:41,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:31:41" (1/1) ... [2022-07-23 14:31:41,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:31:41" (1/1) ... [2022-07-23 14:31:41,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:31:41" (1/1) ... [2022-07-23 14:31:41,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:31:41" (1/1) ... [2022-07-23 14:31:41,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:31:41" (1/1) ... [2022-07-23 14:31:41,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:31:41" (1/1) ... [2022-07-23 14:31:41,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:31:41" (1/1) ... [2022-07-23 14:31:41,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 14:31:41,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 14:31:41,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 14:31:41,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 14:31:41,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:31:41" (1/1) ... [2022-07-23 14:31:41,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:41,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:41,315 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:31:41,322 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:31:41,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 14:31:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 14:31:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 14:31:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 14:31:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 14:31:41,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 14:31:41,385 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 14:31:41,387 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 14:31:41,474 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 14:31:41,478 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 14:31:41,478 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 14:31:41,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:31:41 BoogieIcfgContainer [2022-07-23 14:31:41,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 14:31:41,480 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 14:31:41,480 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 14:31:41,482 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 14:31:41,483 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:31:41,483 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 02:31:40" (1/3) ... [2022-07-23 14:31:41,484 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@331be29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:31:41, skipping insertion in model container [2022-07-23 14:31:41,484 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:31:41,484 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:31:41" (2/3) ... [2022-07-23 14:31:41,484 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@331be29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:31:41, skipping insertion in model container [2022-07-23 14:31:41,484 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:31:41,484 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:31:41" (3/3) ... [2022-07-23 14:31:41,485 INFO L354 chiAutomizerObserver]: Analyzing ICFG array17_alloca.i [2022-07-23 14:31:41,519 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 14:31:41,519 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 14:31:41,520 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 14:31:41,520 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 14:31:41,520 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 14:31:41,520 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 14:31:41,520 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 14:31:41,520 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 14:31:41,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 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:31:41,534 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-23 14:31:41,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:31:41,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:31:41,538 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-23 14:31:41,538 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:31:41,539 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 14:31:41,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 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:31:41,540 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-23 14:31:41,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:31:41,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:31:41,541 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-23 14:31:41,541 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:31:41,545 INFO L752 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 13#L367true assume !(main_~length~0#1 < 1); 11#L367-2true assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 14#L371true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 16#L373true assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 4#L375-3true [2022-07-23 14:31:41,545 INFO L754 eck$LassoCheckResult]: Loop: 4#L375-3true assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 9#L375-2true main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 4#L375-3true [2022-07-23 14:31:41,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:31:41,550 INFO L85 PathProgramCache]: Analyzing trace with hash 889572334, now seen corresponding path program 1 times [2022-07-23 14:31:41,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:31:41,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821156766] [2022-07-23 14:31:41,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:31:41,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:31:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:41,677 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:31:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:41,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:31:41,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:31:41,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2022-07-23 14:31:41,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:31:41,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693737769] [2022-07-23 14:31:41,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:31:41,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:31:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:41,709 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:31:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:41,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:31:41,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:31:41,717 INFO L85 PathProgramCache]: Analyzing trace with hash 180522064, now seen corresponding path program 1 times [2022-07-23 14:31:41,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:31:41,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684414077] [2022-07-23 14:31:41,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:31:41,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:31:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:41,733 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:31:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:41,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:31:41,953 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:31:41,954 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:31:41,954 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:31:41,954 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:31:41,954 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:31:41,955 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:41,955 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:31:41,955 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:31:41,955 INFO L133 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration1_Lasso [2022-07-23 14:31:41,955 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:31:41,955 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:31:41,966 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:31:41,971 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:31:41,973 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:31:41,975 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:31:41,977 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:31:41,979 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:31:41,980 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:31:41,982 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:31:41,984 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:31:41,985 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:31:41,987 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:31:41,989 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:31:42,075 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:31:42,251 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:31:42,254 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:31:42,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:42,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:42,257 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:31:42,275 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:31:42,277 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:31:42,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:42,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:31:42,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:42,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:42,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:42,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:31:42,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:31:42,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:31:42,321 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:31:42,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:42,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:42,324 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:31:42,325 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:31:42,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:31:42,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:42,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:42,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:42,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:42,342 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:31:42,342 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:31:42,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:31:42,371 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:31:42,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:42,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:42,383 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:31:42,384 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:31:42,385 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:31:42,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:42,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:31:42,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:42,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:42,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:42,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:31:42,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:31:42,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:31:42,415 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:31:42,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:42,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:42,417 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:31:42,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:31:42,443 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:31:42,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:42,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:31:42,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:42,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:42,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:42,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:31:42,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:31:42,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:31:42,484 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:31:42,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:42,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:42,486 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:31:42,491 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:31:42,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:31:42,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:42,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:31:42,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:42,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:42,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:42,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:31:42,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:31:42,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:31:42,535 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:31:42,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:42,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:42,537 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:31:42,539 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:31:42,540 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:31:42,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:42,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:31:42,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:42,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:42,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:42,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:31:42,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:31:42,562 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:31:42,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-23 14:31:42,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:42,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:42,582 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:31:42,583 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:31:42,584 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:31:42,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:42,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:31:42,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:42,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:42,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:42,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:31:42,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:31:42,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:31:42,610 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:31:42,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:42,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:42,611 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:31:42,612 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:31:42,614 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:31:42,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:42,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:31:42,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:42,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:42,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:42,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:31:42,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:31:42,626 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:31:42,642 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:31:42,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:42,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:42,644 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:31:42,645 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:31:42,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:31:42,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:42,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:31:42,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:42,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:42,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:42,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:31:42,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:31:42,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:31:42,684 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:31:42,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:42,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:42,685 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:31:42,686 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:31:42,689 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:31:42,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:42,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:31:42,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:42,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:42,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:42,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:31:42,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:31:42,698 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:31:42,714 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:31:42,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:42,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:42,715 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:31:42,716 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:31:42,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:31:42,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:42,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:42,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:42,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:42,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:31:42,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:31:42,730 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:31:42,748 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:31:42,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:42,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:42,750 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:31:42,753 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:31:42,754 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:31:42,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:42,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:31:42,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:42,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:42,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:42,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:31:42,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:31:42,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:31:42,788 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:31:42,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:42,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:42,790 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:31:42,791 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:31:42,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:31:42,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:42,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:42,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:42,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:42,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:31:42,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:31:42,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:31:42,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-23 14:31:42,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:42,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:42,833 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:31:42,834 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:31:42,835 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:31:42,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:42,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:42,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:42,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:42,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:31:42,843 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:31:42,854 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:31:42,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-23 14:31:42,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:42,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:42,871 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:31:42,872 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:31:42,873 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:31:42,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:42,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:42,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:42,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:42,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:31:42,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:31:42,901 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:31:42,951 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-23 14:31:42,951 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. [2022-07-23 14:31:42,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:42,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:42,971 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:31:42,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-23 14:31:42,996 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:31:43,018 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 14:31:43,018 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:31:43,019 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~arr~0#1.offset) = -4*ULTIMATE.start_main_~i~0#1 + 2*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 1*ULTIMATE.start_main_~arr~0#1.offset Supporting invariants [] [2022-07-23 14:31:43,040 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:31:43,047 INFO L293 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-07-23 14:31:43,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:31:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:31:43,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:31:43,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:31:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:31:43,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 14:31:43,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:31:43,139 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:31:43,164 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 14:31:43,165 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:31:43,193 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Result 34 states and 49 transitions. Complement of second has 7 states. [2022-07-23 14:31:43,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 14:31:43,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:31:43,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-07-23 14:31:43,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-23 14:31:43,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:31:43,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-23 14:31:43,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:31:43,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 6 letters. Loop has 4 letters. [2022-07-23 14:31:43,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:31:43,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 49 transitions. [2022-07-23 14:31:43,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:31:43,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 12 states and 16 transitions. [2022-07-23 14:31:43,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-07-23 14:31:43,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-23 14:31:43,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2022-07-23 14:31:43,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:31:43,221 INFO L369 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-07-23 14:31:43,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2022-07-23 14:31:43,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-07-23 14:31:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) 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:31:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-07-23 14:31:43,238 INFO L392 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-07-23 14:31:43,238 INFO L374 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-07-23 14:31:43,238 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 14:31:43,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-07-23 14:31:43,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:31:43,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:31:43,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:31:43,241 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:31:43,241 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:31:43,242 INFO L752 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 122#L367 assume !(main_~length~0#1 < 1); 120#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 121#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 123#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 114#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 115#L375-4 main_~j~0#1 := 1; 112#L380-2 [2022-07-23 14:31:43,242 INFO L754 eck$LassoCheckResult]: Loop: 112#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 113#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 112#L380-2 [2022-07-23 14:31:43,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:31:43,247 INFO L85 PathProgramCache]: Analyzing trace with hash 180522006, now seen corresponding path program 1 times [2022-07-23 14:31:43,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:31:43,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803254097] [2022-07-23 14:31:43,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:31:43,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:31:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:31:43,321 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:31:43,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:31:43,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803254097] [2022-07-23 14:31:43,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803254097] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:31:43,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:31:43,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:31:43,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-07-23 14:31:43,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717291539] [2022-07-23 14:31:43,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:31:43,328 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:31:43,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:31:43,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 1 times [2022-07-23 14:31:43,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:31:43,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993298676] [2022-07-23 14:31:43,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:31:43,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:31:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:43,335 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:31:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:43,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:31:43,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:31:43,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 14:31:43,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 14:31:43,407 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:31:43,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:31:43,436 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-07-23 14:31:43,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 14:31:43,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2022-07-23 14:31:43,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:31:43,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2022-07-23 14:31:43,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-23 14:31:43,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-23 14:31:43,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2022-07-23 14:31:43,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:31:43,440 INFO L369 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-07-23 14:31:43,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2022-07-23 14:31:43,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-07-23 14:31:43,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 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:31:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2022-07-23 14:31:43,443 INFO L392 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-07-23 14:31:43,443 INFO L374 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-07-23 14:31:43,444 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 14:31:43,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2022-07-23 14:31:43,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:31:43,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:31:43,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:31:43,447 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:31:43,447 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:31:43,447 INFO L752 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 154#L367 assume !(main_~length~0#1 < 1); 148#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 149#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 155#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 150#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 151#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 152#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 153#L375-4 main_~j~0#1 := 1; 144#L380-2 [2022-07-23 14:31:43,447 INFO L754 eck$LassoCheckResult]: Loop: 144#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 145#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 144#L380-2 [2022-07-23 14:31:43,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:31:43,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1683012600, now seen corresponding path program 1 times [2022-07-23 14:31:43,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:31:43,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754411193] [2022-07-23 14:31:43,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:31:43,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:31:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:43,475 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:31:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:43,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:31:43,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:31:43,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 2 times [2022-07-23 14:31:43,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:31:43,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758397068] [2022-07-23 14:31:43,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:31:43,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:31:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:43,501 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:31:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:43,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:31:43,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:31:43,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1827560517, now seen corresponding path program 1 times [2022-07-23 14:31:43,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:31:43,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675809552] [2022-07-23 14:31:43,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:31:43,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:31:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:31:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:31:43,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:31:43,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675809552] [2022-07-23 14:31:43,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675809552] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:31:43,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799677269] [2022-07-23 14:31:43,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:31:43,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:31:43,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:43,582 INFO L229 MonitoredProcess]: Starting monitored process 18 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:31:43,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-23 14:31:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:31:43,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 14:31:43,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:31:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:31:43,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:31:43,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:31:43,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799677269] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:31:43,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:31:43,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-07-23 14:31:43,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053467407] [2022-07-23 14:31:43,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:31:43,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:31:43,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 14:31:43,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 14:31:43,704 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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:31:43,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:31:43,760 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-07-23 14:31:43,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 14:31:43,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2022-07-23 14:31:43,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:31:43,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 15 states and 17 transitions. [2022-07-23 14:31:43,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-23 14:31:43,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-23 14:31:43,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2022-07-23 14:31:43,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:31:43,762 INFO L369 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-23 14:31:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2022-07-23 14:31:43,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-07-23 14:31:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 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:31:43,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-07-23 14:31:43,764 INFO L392 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-23 14:31:43,764 INFO L374 stractBuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-23 14:31:43,764 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 14:31:43,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2022-07-23 14:31:43,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:31:43,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:31:43,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:31:43,765 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:31:43,765 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:31:43,765 INFO L752 eck$LassoCheckResult]: Stem: 272#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 273#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 276#L367 assume !(main_~length~0#1 < 1); 274#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 275#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 277#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 268#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 269#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 270#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 271#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 279#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 278#L375-4 main_~j~0#1 := 1; 266#L380-2 [2022-07-23 14:31:43,765 INFO L754 eck$LassoCheckResult]: Loop: 266#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 267#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 266#L380-2 [2022-07-23 14:31:43,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:31:43,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1827505318, now seen corresponding path program 2 times [2022-07-23 14:31:43,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:31:43,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149396090] [2022-07-23 14:31:43,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:31:43,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:31:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:43,776 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:31:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:43,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:31:43,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:31:43,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 3 times [2022-07-23 14:31:43,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:31:43,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746596180] [2022-07-23 14:31:43,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:31:43,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:31:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:43,788 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:31:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:43,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:31:43,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:31:43,792 INFO L85 PathProgramCache]: Analyzing trace with hash 409014941, now seen corresponding path program 2 times [2022-07-23 14:31:43,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:31:43,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529368188] [2022-07-23 14:31:43,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:31:43,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:31:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:43,808 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:31:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:43,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:31:44,142 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:31:44,142 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:31:44,142 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:31:44,142 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:31:44,142 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:31:44,142 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:44,142 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:31:44,142 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:31:44,142 INFO L133 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration4_Lasso [2022-07-23 14:31:44,142 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:31:44,142 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:31:44,144 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:31:44,147 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:31:44,149 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:31:44,151 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:31:44,153 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:31:44,312 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:31:44,318 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:31:44,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:31:44,321 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:31:44,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:31:44,324 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:31:44,326 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:31:44,482 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:31:44,482 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:31:44,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:44,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:44,492 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:31:44,508 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:31:44,508 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:31:44,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:44,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:31:44,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:44,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:44,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:44,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:31:44,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:31:44,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:31:44,556 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:31:44,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:44,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:44,557 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:31:44,564 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:31:44,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:44,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:31:44,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:44,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:44,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:44,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:31:44,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:31:44,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:31:44,580 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:31:44,612 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:31:44,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:44,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:44,613 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:31:44,625 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:31:44,626 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:31:44,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:44,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:44,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:44,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:44,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:31:44,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:31:44,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:31:44,689 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:31:44,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:44,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:44,690 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:31:44,691 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:31:44,694 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:31:44,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:44,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:31:44,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:44,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:44,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:44,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:31:44,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:31:44,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:31:44,717 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:31:44,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:44,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:44,744 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:31:44,744 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:31:44,746 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:31:44,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:44,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:44,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:44,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:44,754 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:31:44,754 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:31:44,764 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:31:44,789 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:31:44,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:44,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:44,790 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:31:44,792 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:31:44,793 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:31:44,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:31:44,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:31:44,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:31:44,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:31:44,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:31:44,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:31:44,823 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:31:44,844 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-23 14:31:44,845 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-07-23 14:31:44,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:31:44,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:44,846 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:31:44,855 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:31:44,863 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:31:44,869 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 14:31:44,869 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:31:44,869 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-07-23 14:31:44,886 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:31:44,895 INFO L293 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-07-23 14:31:44,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:31:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:31:44,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:31:44,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:31:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:31:44,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 14:31:44,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:31:44,944 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:31:44,945 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 14:31:44,945 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:31:44,953 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 22 transitions. Complement of second has 5 states. [2022-07-23 14:31:44,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-23 14:31:44,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:31:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-07-23 14:31:44,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 12 letters. Loop has 2 letters. [2022-07-23 14:31:44,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:31:44,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2022-07-23 14:31:44,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:31:44,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 12 letters. Loop has 4 letters. [2022-07-23 14:31:44,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:31:44,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2022-07-23 14:31:44,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:31:44,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 22 transitions. [2022-07-23 14:31:44,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-23 14:31:44,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-07-23 14:31:44,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2022-07-23 14:31:44,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:31:44,956 INFO L369 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-07-23 14:31:44,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2022-07-23 14:31:44,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-23 14:31:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 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:31:44,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-07-23 14:31:44,958 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-07-23 14:31:44,958 INFO L374 stractBuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-07-23 14:31:44,958 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 14:31:44,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2022-07-23 14:31:44,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:31:44,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:31:44,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:31:44,959 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:31:44,959 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:31:44,959 INFO L752 eck$LassoCheckResult]: Stem: 390#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 391#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 398#L367 assume !(main_~length~0#1 < 1); 392#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 393#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 399#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 394#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 395#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 396#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 397#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 402#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 400#L375-4 main_~j~0#1 := 1; 401#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 389#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 385#L380-2 [2022-07-23 14:31:44,959 INFO L754 eck$LassoCheckResult]: Loop: 385#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 386#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 385#L380-2 [2022-07-23 14:31:44,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:31:44,959 INFO L85 PathProgramCache]: Analyzing trace with hash 409014943, now seen corresponding path program 1 times [2022-07-23 14:31:44,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:31:44,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672854524] [2022-07-23 14:31:44,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:31:44,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:31:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:31:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:31:45,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:31:45,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672854524] [2022-07-23 14:31:45,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672854524] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:31:45,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780284874] [2022-07-23 14:31:45,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:31:45,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:31:45,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:45,121 INFO L229 MonitoredProcess]: Starting monitored process 26 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:31:45,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-23 14:31:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:31:45,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 14:31:45,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:31:45,210 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 15 treesize of output 11 [2022-07-23 14:31:45,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-23 14:31:45,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:31:45,264 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 25 treesize of output 24 [2022-07-23 14:31:45,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 14:31:45,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:31:45,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:31:45,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 14:31:45,350 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 14:31:45,351 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 6 case distinctions, treesize of input 34 treesize of output 18 [2022-07-23 14:31:45,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:31:45,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:31:45,905 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int) (v_ArrVal_60 Int)) (or (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_60)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_56| 4))) (<= (+ (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 (- 4))) 1) (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1)))) (not (< 0 |v_ULTIMATE.start_main_~j~0#1_56|)) (not (<= |c_ULTIMATE.start_main_~value~0#1| v_ArrVal_60)) (not (<= |v_ULTIMATE.start_main_~j~0#1_56| 1)))) is different from false [2022-07-23 14:31:46,386 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int) (v_ArrVal_60 Int)) (or (not (< 0 |v_ULTIMATE.start_main_~j~0#1_56|)) (not (<= |c_ULTIMATE.start_main_~value~0#1| v_ArrVal_60)) (not (<= |v_ULTIMATE.start_main_~j~0#1_56| 1)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4) v_ArrVal_60)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_56| 4))) (<= (+ (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 (- 4))) 1) (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1)))))) is different from false [2022-07-23 14:31:46,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2022-07-23 14:31:46,409 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-23 14:31:46,410 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 814 treesize of output 724 [2022-07-23 14:31:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-23 14:31:46,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780284874] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:31:46,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:31:46,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 16 [2022-07-23 14:31:46,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674592325] [2022-07-23 14:31:46,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:31:46,522 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:31:46,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:31:46,522 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 4 times [2022-07-23 14:31:46,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:31:46,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545818228] [2022-07-23 14:31:46,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:31:46,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:31:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:46,526 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:31:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:46,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:31:46,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:31:46,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-23 14:31:46,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2022-07-23 14:31:46,575 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. cyclomatic complexity: 7 Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 17 states have internal predecessors, (29), 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:31:47,021 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int) (v_ArrVal_60 Int)) (or (not (< 0 |v_ULTIMATE.start_main_~j~0#1_56|)) (not (<= |c_ULTIMATE.start_main_~value~0#1| v_ArrVal_60)) (not (<= |v_ULTIMATE.start_main_~j~0#1_56| 1)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4) v_ArrVal_60)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_56| 4))) (<= (+ (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 (- 4))) 1) (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1)))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) 1) |c_ULTIMATE.start_main_~value~0#1|) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2022-07-23 14:31:47,469 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) 0) 1) |c_ULTIMATE.start_main_~value~0#1|) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~j~0#1_56| Int) (v_ArrVal_60 Int)) (or (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_60)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_56| 4))) (<= (+ (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 (- 4))) 1) (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1)))) (not (< 0 |v_ULTIMATE.start_main_~j~0#1_56|)) (not (<= |c_ULTIMATE.start_main_~value~0#1| v_ArrVal_60)) (not (<= |v_ULTIMATE.start_main_~j~0#1_56| 1)))) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2022-07-23 14:31:47,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:31:47,505 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-07-23 14:31:47,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 14:31:47,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2022-07-23 14:31:47,507 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-23 14:31:47,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 35 transitions. [2022-07-23 14:31:47,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-23 14:31:47,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-23 14:31:47,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2022-07-23 14:31:47,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:31:47,507 INFO L369 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-07-23 14:31:47,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2022-07-23 14:31:47,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-07-23 14:31:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:31:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-07-23 14:31:47,509 INFO L392 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-07-23 14:31:47,509 INFO L374 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-07-23 14:31:47,509 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-23 14:31:47,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2022-07-23 14:31:47,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:31:47,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:31:47,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:31:47,510 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:31:47,510 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:31:47,510 INFO L752 eck$LassoCheckResult]: Stem: 545#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 549#L367 assume !(main_~length~0#1 < 1); 547#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 548#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 550#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 541#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 542#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 543#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 544#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 557#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 556#L375-4 main_~j~0#1 := 1; 555#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 539#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 538#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 540#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 536#L380-2 [2022-07-23 14:31:47,510 INFO L754 eck$LassoCheckResult]: Loop: 536#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 537#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 536#L380-2 [2022-07-23 14:31:47,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:31:47,510 INFO L85 PathProgramCache]: Analyzing trace with hash -2073631454, now seen corresponding path program 1 times [2022-07-23 14:31:47,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:31:47,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137203410] [2022-07-23 14:31:47,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:31:47,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:31:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:31:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:31:47,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:31:47,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137203410] [2022-07-23 14:31:47,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137203410] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:31:47,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537640039] [2022-07-23 14:31:47,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:31:47,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:31:47,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:47,584 INFO L229 MonitoredProcess]: Starting monitored process 27 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:31:47,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-23 14:31:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:31:47,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 14:31:47,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:31:47,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:31:47,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:31:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:31:47,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537640039] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:31:47,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:31:47,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2022-07-23 14:31:47,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99009506] [2022-07-23 14:31:47,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:31:47,703 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:31:47,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:31:47,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 5 times [2022-07-23 14:31:47,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:31:47,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193296404] [2022-07-23 14:31:47,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:31:47,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:31:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:47,706 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:31:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:31:47,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:31:47,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:31:47,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 14:31:47,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-07-23 14:31:47,755 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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:31:47,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:31:47,811 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-07-23 14:31:47,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 14:31:47,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2022-07-23 14:31:47,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:31:47,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 25 transitions. [2022-07-23 14:31:47,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-07-23 14:31:47,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-07-23 14:31:47,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2022-07-23 14:31:47,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:31:47,813 INFO L369 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-07-23 14:31:47,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2022-07-23 14:31:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-07-23 14:31:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 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:31:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-23 14:31:47,814 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-23 14:31:47,815 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-23 14:31:47,815 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-23 14:31:47,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2022-07-23 14:31:47,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:31:47,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:31:47,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:31:47,816 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:31:47,816 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:31:47,816 INFO L752 eck$LassoCheckResult]: Stem: 703#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 704#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 707#L367 assume !(main_~length~0#1 < 1); 705#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 706#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 708#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 699#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 700#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 701#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 702#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 713#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 712#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 711#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 709#L375-4 main_~j~0#1 := 1; 710#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 698#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 694#L380-2 [2022-07-23 14:31:47,816 INFO L754 eck$LassoCheckResult]: Loop: 694#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 695#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 694#L380-2 [2022-07-23 14:31:47,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:31:47,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2020585215, now seen corresponding path program 2 times [2022-07-23 14:31:47,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:31:47,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904251238] [2022-07-23 14:31:47,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:31:47,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:31:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:31:47,952 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:31:47,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:31:47,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904251238] [2022-07-23 14:31:47,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904251238] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:31:47,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239681810] [2022-07-23 14:31:47,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 14:31:47,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:31:47,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:31:47,956 INFO L229 MonitoredProcess]: Starting monitored process 28 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:31:47,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-23 14:31:47,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 14:31:47,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:31:48,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-23 14:31:48,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:31:48,019 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 15 treesize of output 11 [2022-07-23 14:31:48,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:31:48,046 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 25 treesize of output 24 [2022-07-23 14:31:48,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:31:48,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:31:48,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:31:48,124 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 14:31:48,124 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 1 case distinctions, treesize of input 33 treesize of output 35 [2022-07-23 14:31:48,172 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 14:31:48,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:31:48,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:31:48,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 14:31:48,177 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 14:31:48,177 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 6 case distinctions, treesize of input 34 treesize of output 18 [2022-07-23 14:31:48,186 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:31:48,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:31:48,713 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_94 Int)) (or (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_94)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (not (< 0 |v_ULTIMATE.start_main_~j~0#1_66|)) (not (<= |v_ULTIMATE.start_main_~j~0#1_66| 1)))) is different from false [2022-07-23 14:32:00,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_47| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_47|)) (forall ((|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_94 Int)) (or (not (< 0 |v_ULTIMATE.start_main_~j~0#1_66|)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4)) v_ArrVal_94)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_66| 1)))))) is different from false [2022-07-23 14:32:01,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_94 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_47|)) (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_92) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4)) v_ArrVal_94)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (not (<= |c_ULTIMATE.start_main_~value~0#1| v_ArrVal_92)) (not (< 0 |v_ULTIMATE.start_main_~j~0#1_66|)) (not (<= |v_ULTIMATE.start_main_~j~0#1_66| 1)))) is different from false [2022-07-23 14:32:02,458 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_94 Int)) (or (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4) v_ArrVal_92) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4)) v_ArrVal_94)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_47|)) (not (<= |c_ULTIMATE.start_main_~value~0#1| v_ArrVal_92)) (not (< 0 |v_ULTIMATE.start_main_~j~0#1_66|)) (not (<= |v_ULTIMATE.start_main_~j~0#1_66| 1)))) is different from false [2022-07-23 14:32:02,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-07-23 14:32:02,496 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-23 14:32:02,497 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 47976 treesize of output 44648 [2022-07-23 14:34:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-23 14:34:01,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239681810] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:34:01,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:34:01,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 20 [2022-07-23 14:34:01,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217699389] [2022-07-23 14:34:01,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:34:01,844 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:34:01,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:01,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 6 times [2022-07-23 14:34:01,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:01,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092414428] [2022-07-23 14:34:01,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:01,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:01,848 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:01,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:01,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:34:01,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-23 14:34:01,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=217, Unknown=4, NotChecked=132, Total=420 [2022-07-23 14:34:01,898 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. cyclomatic complexity: 7 Second operand has 21 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:34:02,503 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_94 Int)) (or (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4) v_ArrVal_92) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4)) v_ArrVal_94)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_47|)) (not (<= |c_ULTIMATE.start_main_~value~0#1| v_ArrVal_92)) (not (< 0 |v_ULTIMATE.start_main_~j~0#1_66|)) (not (<= |v_ULTIMATE.start_main_~j~0#1_66| 1)))) (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) 1) |c_ULTIMATE.start_main_~value~0#1|) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2022-07-23 14:34:03,179 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_94 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_47|)) (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_92) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4)) v_ArrVal_94)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (not (<= |c_ULTIMATE.start_main_~value~0#1| v_ArrVal_92)) (not (< 0 |v_ULTIMATE.start_main_~j~0#1_66|)) (not (<= |v_ULTIMATE.start_main_~j~0#1_66| 1)))) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~arr~0#1.offset|) 4) 1) |c_ULTIMATE.start_main_~i~0#1|) (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) 0) 1) |c_ULTIMATE.start_main_~value~0#1|) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2022-07-23 14:34:15,182 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_47| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_47|)) (forall ((|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_94 Int)) (or (not (< 0 |v_ULTIMATE.start_main_~j~0#1_66|)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4)) v_ArrVal_94)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| 4))) (<= (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_66| 1)))))) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~arr~0#1.offset|) 4) 1) |c_ULTIMATE.start_main_~i~0#1|) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|))) (<= (+ (select .cse2 0) 1) (select .cse2 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))))) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2022-07-23 14:34:15,699 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~i~0#1_45| Int)) (and (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|))) (<= (+ (select .cse0 0) 1) (select .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_45| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~arr~0#1.offset|) 4) 1) |v_ULTIMATE.start_main_~i~0#1_45|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_45| 1) |c_ULTIMATE.start_main_~i~0#1|) (<= |v_ULTIMATE.start_main_~i~0#1_45| 1))) (forall ((|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_94 Int)) (or (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_94)) (.cse2 (* |v_ULTIMATE.start_main_~j~0#1_66| 4))) (<= (+ (select .cse1 (+ .cse2 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) 1) (select .cse1 (+ .cse2 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (not (< 0 |v_ULTIMATE.start_main_~j~0#1_66|)) (not (<= |v_ULTIMATE.start_main_~j~0#1_66| 1)))) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2022-07-23 14:34:15,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:34:15,733 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-07-23 14:34:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 14:34:15,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2022-07-23 14:34:15,734 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-23 14:34:15,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 37 transitions. [2022-07-23 14:34:15,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-23 14:34:15,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-23 14:34:15,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2022-07-23 14:34:15,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:34:15,735 INFO L369 hiAutomatonCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-07-23 14:34:15,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2022-07-23 14:34:15,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-07-23 14:34:15,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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:34:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-07-23 14:34:15,736 INFO L392 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-07-23 14:34:15,736 INFO L374 stractBuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-07-23 14:34:15,736 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-23 14:34:15,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2022-07-23 14:34:15,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:34:15,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:15,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:15,737 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:34:15,737 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:34:15,737 INFO L752 eck$LassoCheckResult]: Stem: 878#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 879#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 883#L367 assume !(main_~length~0#1 < 1); 880#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 881#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 882#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 874#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 875#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 876#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 877#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 888#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 889#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 892#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 891#L375-4 main_~j~0#1 := 1; 890#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 872#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 871#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 873#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 869#L380-2 [2022-07-23 14:34:15,737 INFO L754 eck$LassoCheckResult]: Loop: 869#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 870#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 869#L380-2 [2022-07-23 14:34:15,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:15,737 INFO L85 PathProgramCache]: Analyzing trace with hash -457174268, now seen corresponding path program 2 times [2022-07-23 14:34:15,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:15,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667863484] [2022-07-23 14:34:15,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:15,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:15,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:15,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667863484] [2022-07-23 14:34:15,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667863484] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:34:15,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127210038] [2022-07-23 14:34:15,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 14:34:15,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:34:15,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:15,842 INFO L229 MonitoredProcess]: Starting monitored process 29 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:34:15,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-23 14:34:15,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 14:34:15,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:34:15,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 14:34:15,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:34:15,910 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 15 treesize of output 11 [2022-07-23 14:34:15,943 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-23 14:34:15,943 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 27 treesize of output 26 [2022-07-23 14:34:16,012 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 14:34:16,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 12 [2022-07-23 14:34:16,015 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:16,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:34:16,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2022-07-23 14:34:16,178 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 14:34:16,178 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 1348 treesize of output 1220 [2022-07-23 14:34:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:16,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127210038] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:34:16,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:34:16,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2022-07-23 14:34:16,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119869997] [2022-07-23 14:34:16,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:34:16,463 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:34:16,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:16,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 7 times [2022-07-23 14:34:16,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:16,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303343647] [2022-07-23 14:34:16,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:16,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:16,466 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:16,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:16,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:34:16,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-23 14:34:16,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-07-23 14:34:16,514 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 8 Second operand has 17 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 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:34:16,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:34:16,601 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-07-23 14:34:16,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 14:34:16,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2022-07-23 14:34:16,602 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-23 14:34:16,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 41 states and 51 transitions. [2022-07-23 14:34:16,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-07-23 14:34:16,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-23 14:34:16,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2022-07-23 14:34:16,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:34:16,604 INFO L369 hiAutomatonCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-07-23 14:34:16,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2022-07-23 14:34:16,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2022-07-23 14:34:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 34 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:34:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-07-23 14:34:16,606 INFO L392 hiAutomatonCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-07-23 14:34:16,606 INFO L374 stractBuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-07-23 14:34:16,606 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-23 14:34:16,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 43 transitions. [2022-07-23 14:34:16,606 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-23 14:34:16,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:16,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:16,606 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:34:16,607 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:34:16,607 INFO L752 eck$LassoCheckResult]: Stem: 1069#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1070#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1075#L367 assume !(main_~length~0#1 < 1); 1071#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1072#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 1076#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 1065#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1066#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1079#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1082#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1067#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1068#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1090#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1091#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1095#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 1094#L375-4 main_~j~0#1 := 1; 1093#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1092#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1089#L380-2 [2022-07-23 14:34:16,607 INFO L754 eck$LassoCheckResult]: Loop: 1089#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1088#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1089#L380-2 [2022-07-23 14:34:16,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:16,607 INFO L85 PathProgramCache]: Analyzing trace with hash -404128029, now seen corresponding path program 3 times [2022-07-23 14:34:16,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:16,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55129612] [2022-07-23 14:34:16,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:16,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:16,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:16,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55129612] [2022-07-23 14:34:16,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55129612] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:34:16,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492960745] [2022-07-23 14:34:16,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 14:34:16,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:34:16,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:16,798 INFO L229 MonitoredProcess]: Starting monitored process 30 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:34:16,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-23 14:34:16,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-23 14:34:16,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:34:16,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-23 14:34:16,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:34:16,883 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 15 treesize of output 11 [2022-07-23 14:34:16,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:34:16,925 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 25 treesize of output 24 [2022-07-23 14:34:16,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:34:16,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:34:16,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:34:16,971 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 14:34:16,971 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 1 case distinctions, treesize of input 31 treesize of output 33 [2022-07-23 14:34:17,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:34:17,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:34:17,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:34:17,005 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 14:34:17,005 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 1 case distinctions, treesize of input 31 treesize of output 33 [2022-07-23 14:34:17,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:34:17,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 14:34:17,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 14:34:17,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 14:34:17,052 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 14:34:17,052 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 6 case distinctions, treesize of input 39 treesize of output 18 [2022-07-23 14:34:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:17,060 INFO L328 TraceCheckSpWp]: Computing backward predicates...