./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_monotonic.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 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/array-industry-pattern/array_monotonic.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 17:50:29,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 17:50:29,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 17:50:29,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 17:50:29,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 17:50:29,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 17:50:29,133 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 17:50:29,135 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 17:50:29,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 17:50:29,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 17:50:29,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 17:50:29,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 17:50:29,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 17:50:29,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 17:50:29,148 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 17:50:29,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 17:50:29,155 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 17:50:29,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 17:50:29,157 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 17:50:29,164 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 17:50:29,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 17:50:29,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 17:50:29,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 17:50:29,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 17:50:29,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 17:50:29,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 17:50:29,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 17:50:29,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 17:50:29,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 17:50:29,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 17:50:29,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 17:50:29,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 17:50:29,186 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 17:50:29,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 17:50:29,188 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 17:50:29,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 17:50:29,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 17:50:29,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 17:50:29,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 17:50:29,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 17:50:29,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 17:50:29,192 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-19 17:50:29,229 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 17:50:29,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 17:50:29,230 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 17:50:29,230 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 17:50:29,232 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 17:50:29,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 17:50:29,233 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 17:50:29,239 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-19 17:50:29,239 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-19 17:50:29,240 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-19 17:50:29,240 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-19 17:50:29,241 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-19 17:50:29,241 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-19 17:50:29,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 17:50:29,241 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 17:50:29,241 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 17:50:29,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 17:50:29,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 17:50:29,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 17:50:29,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-19 17:50:29,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-19 17:50:29,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-19 17:50:29,243 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 17:50:29,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-19 17:50:29,244 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-19 17:50:29,244 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 17:50:29,244 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-19 17:50:29,245 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 17:50:29,245 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 17:50:29,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 17:50:29,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 17:50:29,245 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 17:50:29,246 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-19 17:50:29,247 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 [2021-12-19 17:50:29,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 17:50:29,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 17:50:29,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 17:50:29,505 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 17:50:29,506 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 17:50:29,507 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2021-12-19 17:50:29,568 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33499f3b7/61fb5f318ea84b0692a2dd587fcff0e2/FLAGa8e542c0b [2021-12-19 17:50:30,043 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 17:50:30,044 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2021-12-19 17:50:30,053 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33499f3b7/61fb5f318ea84b0692a2dd587fcff0e2/FLAGa8e542c0b [2021-12-19 17:50:30,071 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33499f3b7/61fb5f318ea84b0692a2dd587fcff0e2 [2021-12-19 17:50:30,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 17:50:30,076 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 17:50:30,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 17:50:30,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 17:50:30,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 17:50:30,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:50:30" (1/1) ... [2021-12-19 17:50:30,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1ddcb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:50:30, skipping insertion in model container [2021-12-19 17:50:30,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:50:30" (1/1) ... [2021-12-19 17:50:30,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 17:50:30,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 17:50:30,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i[808,821] [2021-12-19 17:50:30,255 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 17:50:30,263 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 17:50:30,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i[808,821] [2021-12-19 17:50:30,285 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 17:50:30,301 INFO L208 MainTranslator]: Completed translation [2021-12-19 17:50:30,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:50:30 WrapperNode [2021-12-19 17:50:30,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 17:50:30,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 17:50:30,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 17:50:30,303 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 17:50:30,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:50:30" (1/1) ... [2021-12-19 17:50:30,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:50:30" (1/1) ... [2021-12-19 17:50:30,336 INFO L137 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2021-12-19 17:50:30,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 17:50:30,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 17:50:30,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 17:50:30,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 17:50:30,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:50:30" (1/1) ... [2021-12-19 17:50:30,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:50:30" (1/1) ... [2021-12-19 17:50:30,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:50:30" (1/1) ... [2021-12-19 17:50:30,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:50:30" (1/1) ... [2021-12-19 17:50:30,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:50:30" (1/1) ... [2021-12-19 17:50:30,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:50:30" (1/1) ... [2021-12-19 17:50:30,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:50:30" (1/1) ... [2021-12-19 17:50:30,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 17:50:30,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 17:50:30,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 17:50:30,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 17:50:30,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:50:30" (1/1) ... [2021-12-19 17:50:30,378 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:30,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:30,400 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) [2021-12-19 17:50:30,403 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 [2021-12-19 17:50:30,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-19 17:50:30,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-19 17:50:30,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-19 17:50:30,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-19 17:50:30,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 17:50:30,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 17:50:30,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-19 17:50:30,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-19 17:50:30,482 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 17:50:30,484 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 17:50:30,646 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 17:50:30,651 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 17:50:30,651 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-19 17:50:30,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:50:30 BoogieIcfgContainer [2021-12-19 17:50:30,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 17:50:30,654 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-19 17:50:30,654 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-19 17:50:30,667 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-19 17:50:30,668 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:50:30,683 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.12 05:50:30" (1/3) ... [2021-12-19 17:50:30,684 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54b1a74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 05:50:30, skipping insertion in model container [2021-12-19 17:50:30,685 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:50:30,685 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:50:30" (2/3) ... [2021-12-19 17:50:30,685 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54b1a74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 05:50:30, skipping insertion in model container [2021-12-19 17:50:30,685 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:50:30,685 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:50:30" (3/3) ... [2021-12-19 17:50:30,687 INFO L388 chiAutomizerObserver]: Analyzing ICFG array_monotonic.i [2021-12-19 17:50:30,755 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-19 17:50:30,756 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-19 17:50:30,756 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-19 17:50:30,756 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-19 17:50:30,756 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-19 17:50:30,756 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-19 17:50:30,756 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-19 17:50:30,756 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-19 17:50:30,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) [2021-12-19 17:50:30,797 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-19 17:50:30,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:50:30,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:50:30,824 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:50:30,824 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:50:30,825 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-19 17:50:30,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) [2021-12-19 17:50:30,827 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-19 17:50:30,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:50:30,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:50:30,829 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:50:30,829 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:50:30,836 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 13#L20-3true [2021-12-19 17:50:30,837 INFO L793 eck$LassoCheckResult]: Loop: 13#L20-3true assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 16#L23true assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 14#L20-2true main_~i~0#1 := 2 + main_~i~0#1; 13#L20-3true [2021-12-19 17:50:30,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:30,846 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-19 17:50:30,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:30,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248809014] [2021-12-19 17:50:30,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:30,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:30,968 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:50:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:31,011 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:50:31,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:31,015 INFO L85 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2021-12-19 17:50:31,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:31,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956349096] [2021-12-19 17:50:31,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:31,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:31,037 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:50:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:31,058 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:50:31,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:31,061 INFO L85 PathProgramCache]: Analyzing trace with hash 28698763, now seen corresponding path program 1 times [2021-12-19 17:50:31,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:31,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146782682] [2021-12-19 17:50:31,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:31,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:31,106 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:50:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:31,147 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:50:31,640 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:50:31,641 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:50:31,642 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:50:31,642 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:50:31,642 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:50:31,642 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:31,642 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:50:31,643 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:50:31,643 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration1_Lasso [2021-12-19 17:50:31,643 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:50:31,644 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:50:31,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:31,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:31,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:31,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:31,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:31,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:31,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:32,181 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:50:32,185 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:50:32,186 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:32,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:32,192 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) [2021-12-19 17:50:32,195 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 [2021-12-19 17:50:32,196 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 [2021-12-19 17:50:32,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:32,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:50:32,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:32,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:32,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:32,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:50:32,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:50:32,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:32,249 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 [2021-12-19 17:50:32,249 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:32,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:32,250 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) [2021-12-19 17:50:32,260 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 [2021-12-19 17:50:32,268 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 [2021-12-19 17:50:32,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:32,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:32,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:32,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:32,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:50:32,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:50:32,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:32,316 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 [2021-12-19 17:50:32,317 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:32,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:32,319 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) [2021-12-19 17:50:32,327 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 [2021-12-19 17:50:32,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:32,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:32,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:32,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:32,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:50:32,338 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:50:32,342 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 [2021-12-19 17:50:32,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:32,381 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 [2021-12-19 17:50:32,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:32,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:32,383 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) [2021-12-19 17:50:32,390 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 [2021-12-19 17:50:32,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:32,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:50:32,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:32,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:32,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:32,399 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 [2021-12-19 17:50:32,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:50:32,403 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:50:32,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:32,445 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 [2021-12-19 17:50:32,446 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:32,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:32,447 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) [2021-12-19 17:50:32,449 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 [2021-12-19 17:50:32,450 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 [2021-12-19 17:50:32,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:32,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:50:32,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:32,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:32,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:32,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:50:32,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:50:32,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:32,500 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 [2021-12-19 17:50:32,500 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:32,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:32,501 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) [2021-12-19 17:50:32,502 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 [2021-12-19 17:50:32,503 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 [2021-12-19 17:50:32,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:32,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:32,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:32,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:32,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:50:32,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:50:32,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:32,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-19 17:50:32,559 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:32,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:32,561 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) [2021-12-19 17:50:32,567 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 [2021-12-19 17:50:32,568 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 [2021-12-19 17:50:32,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:32,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:32,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:32,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:32,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:50:32,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:50:32,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:32,620 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 [2021-12-19 17:50:32,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:32,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:32,622 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) [2021-12-19 17:50:32,625 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 [2021-12-19 17:50:32,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 [2021-12-19 17:50:32,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:32,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:50:32,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:32,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:32,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:32,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:50:32,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:50:32,648 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:32,669 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 [2021-12-19 17:50:32,669 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:32,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:32,670 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) [2021-12-19 17:50:32,671 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 [2021-12-19 17:50:32,673 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 [2021-12-19 17:50:32,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:32,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:32,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:32,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:32,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:50:32,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:50:32,686 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:32,701 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 [2021-12-19 17:50:32,702 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:32,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:32,703 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) [2021-12-19 17:50:32,704 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 [2021-12-19 17:50:32,705 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 [2021-12-19 17:50:32,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:32,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:32,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:32,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:32,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:50:32,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:50:32,743 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:50:32,781 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2021-12-19 17:50:32,781 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-12-19 17:50:32,782 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:32,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:32,788 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) [2021-12-19 17:50:32,790 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 [2021-12-19 17:50:32,840 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:50:32,857 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 17:50:32,858 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:50:32,858 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#b~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 25000*v_rep(select #length ULTIMATE.start_main_~#b~0#1.base)_1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2021-12-19 17:50:32,906 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 [2021-12-19 17:50:32,928 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-12-19 17:50:32,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:50:32,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 17:50:32,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:50:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:50:33,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 17:50:33,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:50:33,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:33,105 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-12-19 17:50:33,107 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2021-12-19 17:50:33,166 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 [2021-12-19 17:50:33,168 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 37 states and 55 transitions. Complement of second has 10 states. [2021-12-19 17:50:33,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-19 17:50:33,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2021-12-19 17:50:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2021-12-19 17:50:33,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 2 letters. Loop has 3 letters. [2021-12-19 17:50:33,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:50:33,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 5 letters. Loop has 3 letters. [2021-12-19 17:50:33,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:50:33,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 2 letters. Loop has 6 letters. [2021-12-19 17:50:33,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:50:33,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 55 transitions. [2021-12-19 17:50:33,189 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-19 17:50:33,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 20 states and 28 transitions. [2021-12-19 17:50:33,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-12-19 17:50:33,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-12-19 17:50:33,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2021-12-19 17:50:33,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:50:33,196 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2021-12-19 17:50:33,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2021-12-19 17:50:33,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-12-19 17:50:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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) [2021-12-19 17:50:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2021-12-19 17:50:33,223 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2021-12-19 17:50:33,224 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2021-12-19 17:50:33,224 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-19 17:50:33,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2021-12-19 17:50:33,226 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-19 17:50:33,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:50:33,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:50:33,226 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-19 17:50:33,227 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:50:33,227 INFO L791 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 148#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 160#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 153#L23 [2021-12-19 17:50:33,227 INFO L793 eck$LassoCheckResult]: Loop: 153#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 156#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 151#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 153#L23 [2021-12-19 17:50:33,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:33,229 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2021-12-19 17:50:33,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:33,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382669618] [2021-12-19 17:50:33,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:33,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:33,259 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:50:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:33,272 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:50:33,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:33,273 INFO L85 PathProgramCache]: Analyzing trace with hash 44743, now seen corresponding path program 1 times [2021-12-19 17:50:33,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:33,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313052053] [2021-12-19 17:50:33,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:33,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:33,293 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:50:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:33,298 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:50:33,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:33,298 INFO L85 PathProgramCache]: Analyzing trace with hash 889663585, now seen corresponding path program 1 times [2021-12-19 17:50:33,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:33,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842288947] [2021-12-19 17:50:33,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:33,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:33,309 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:50:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:33,319 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:50:33,644 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:50:33,644 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:50:33,644 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:50:33,644 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:50:33,644 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:50:33,644 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:33,644 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:50:33,644 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:50:33,645 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration2_Lasso [2021-12-19 17:50:33,645 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:50:33,645 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:50:33,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:33,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:33,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:33,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:33,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:33,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:33,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:50:34,059 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:50:34,060 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:50:34,060 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:34,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:34,063 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) [2021-12-19 17:50:34,075 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 [2021-12-19 17:50:34,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:34,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:34,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:34,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:34,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:50:34,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:50:34,089 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 [2021-12-19 17:50:34,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:34,124 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 [2021-12-19 17:50:34,125 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:34,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:34,126 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) [2021-12-19 17:50:34,128 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 [2021-12-19 17:50:34,129 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 [2021-12-19 17:50:34,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:34,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:34,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:34,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:34,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:50:34,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:50:34,153 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:34,176 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 [2021-12-19 17:50:34,177 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:34,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:34,178 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) [2021-12-19 17:50:34,184 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 [2021-12-19 17:50:34,185 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 [2021-12-19 17:50:34,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:34,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:34,192 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-19 17:50:34,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:34,204 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2021-12-19 17:50:34,204 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-12-19 17:50:34,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:34,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-19 17:50:34,244 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:34,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:34,246 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) [2021-12-19 17:50:34,247 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 [2021-12-19 17:50:34,248 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 [2021-12-19 17:50:34,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:34,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:34,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:34,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:34,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:50:34,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:50:34,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:34,298 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 [2021-12-19 17:50:34,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:34,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:34,300 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) [2021-12-19 17:50:34,306 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 [2021-12-19 17:50:34,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:34,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:34,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:34,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:34,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:50:34,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:50:34,318 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 [2021-12-19 17:50:34,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:34,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-19 17:50:34,361 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:34,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:34,362 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:50:34,370 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 [2021-12-19 17:50:34,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:34,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:34,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:34,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:34,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:50:34,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:50:34,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-19 17:50:34,395 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:50:34,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-19 17:50:34,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:34,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:34,422 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) [2021-12-19 17:50:34,425 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 [2021-12-19 17:50:34,427 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 [2021-12-19 17:50:34,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:50:34,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:50:34,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:50:34,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:50:34,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:50:34,437 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:50:34,455 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:50:34,480 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-12-19 17:50:34,481 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-12-19 17:50:34,481 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:50:34,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:34,484 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) [2021-12-19 17:50:34,498 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:50:34,506 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 [2021-12-19 17:50:34,528 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 17:50:34,528 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:50:34,528 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_2, ULTIMATE.start_main_~i~0#1) = 49999*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_2 - 2*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2021-12-19 17:50:34,555 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 [2021-12-19 17:50:34,568 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2021-12-19 17:50:34,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:50:34,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 17:50:34,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:50:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:50:34,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 17:50:34,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:50:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:34,629 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 [2021-12-19 17:50:34,630 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:50:34,661 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 54 transitions. Complement of second has 8 states. [2021-12-19 17:50:34,662 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 [2021-12-19 17:50:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:50:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2021-12-19 17:50:34,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 3 letters. Loop has 3 letters. [2021-12-19 17:50:34,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:50:34,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 6 letters. Loop has 3 letters. [2021-12-19 17:50:34,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:50:34,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 3 letters. Loop has 6 letters. [2021-12-19 17:50:34,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:50:34,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 54 transitions. [2021-12-19 17:50:34,669 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-19 17:50:34,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 29 states and 39 transitions. [2021-12-19 17:50:34,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-12-19 17:50:34,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-12-19 17:50:34,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. [2021-12-19 17:50:34,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:50:34,674 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2021-12-19 17:50:34,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. [2021-12-19 17:50:34,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-12-19 17:50:34,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 states have internal predecessors, (37), 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) [2021-12-19 17:50:34,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2021-12-19 17:50:34,678 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2021-12-19 17:50:34,678 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2021-12-19 17:50:34,678 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-19 17:50:34,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 37 transitions. [2021-12-19 17:50:34,680 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-19 17:50:34,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:50:34,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:50:34,681 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 17:50:34,681 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:50:34,681 INFO L791 eck$LassoCheckResult]: Stem: 282#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 283#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 295#L20-3 assume !(main_~i~0#1 < 100000); 296#L20-4 main_~i~0#1 := 0; 304#L26-3 [2021-12-19 17:50:34,681 INFO L793 eck$LassoCheckResult]: Loop: 304#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 301#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 302#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 304#L26-3 [2021-12-19 17:50:34,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:34,682 INFO L85 PathProgramCache]: Analyzing trace with hash 925712, now seen corresponding path program 1 times [2021-12-19 17:50:34,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:34,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445403790] [2021-12-19 17:50:34,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:34,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:50:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:34,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:50:34,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445403790] [2021-12-19 17:50:34,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445403790] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:50:34,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:50:34,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 17:50:34,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662185500] [2021-12-19 17:50:34,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:50:34,739 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:50:34,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:34,741 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 1 times [2021-12-19 17:50:34,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:34,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653091463] [2021-12-19 17:50:34,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:34,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:34,751 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:50:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:34,755 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:50:34,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:50:34,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 17:50:34,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 17:50:34,797 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:50:34,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:50:34,818 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2021-12-19 17:50:34,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 17:50:34,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 44 transitions. [2021-12-19 17:50:34,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-19 17:50:34,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 42 transitions. [2021-12-19 17:50:34,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-19 17:50:34,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-19 17:50:34,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2021-12-19 17:50:34,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:50:34,824 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2021-12-19 17:50:34,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2021-12-19 17:50:34,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2021-12-19 17:50:34,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:50:34,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2021-12-19 17:50:34,829 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2021-12-19 17:50:34,829 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2021-12-19 17:50:34,829 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-19 17:50:34,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2021-12-19 17:50:34,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-19 17:50:34,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:50:34,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:50:34,830 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:50:34,831 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:50:34,831 INFO L791 eck$LassoCheckResult]: Stem: 346#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 347#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 350#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 352#L23 assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 355#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 356#L20-3 assume !(main_~i~0#1 < 100000); 361#L20-4 main_~i~0#1 := 0; 349#L26-3 [2021-12-19 17:50:34,831 INFO L793 eck$LassoCheckResult]: Loop: 349#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 359#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 348#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 349#L26-3 [2021-12-19 17:50:34,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:34,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1809707736, now seen corresponding path program 1 times [2021-12-19 17:50:34,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:34,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505276303] [2021-12-19 17:50:34,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:34,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:50:34,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:34,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:50:34,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505276303] [2021-12-19 17:50:34,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505276303] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:50:34,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343634163] [2021-12-19 17:50:34,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:34,876 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:50:34,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:34,880 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:50:34,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-19 17:50:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:50:34,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 17:50:34,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:50:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:34,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:50:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:34,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343634163] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:50:34,963 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:50:34,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-19 17:50:34,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016527371] [2021-12-19 17:50:34,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:50:34,964 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:50:34,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:34,964 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 2 times [2021-12-19 17:50:34,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:34,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927092923] [2021-12-19 17:50:34,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:34,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:34,968 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:50:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:34,971 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:50:35,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:50:35,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-19 17:50:35,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-19 17:50:35,003 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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) [2021-12-19 17:50:35,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:50:35,049 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2021-12-19 17:50:35,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 17:50:35,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 89 transitions. [2021-12-19 17:50:35,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-19 17:50:35,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 62 states and 78 transitions. [2021-12-19 17:50:35,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2021-12-19 17:50:35,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2021-12-19 17:50:35,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 78 transitions. [2021-12-19 17:50:35,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:50:35,053 INFO L681 BuchiCegarLoop]: Abstraction has 62 states and 78 transitions. [2021-12-19 17:50:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 78 transitions. [2021-12-19 17:50:35,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 40. [2021-12-19 17:50:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.3) internal successors, (52), 39 states have internal predecessors, (52), 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) [2021-12-19 17:50:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2021-12-19 17:50:35,056 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2021-12-19 17:50:35,057 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2021-12-19 17:50:35,057 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-19 17:50:35,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. [2021-12-19 17:50:35,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-19 17:50:35,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:50:35,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:50:35,058 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1] [2021-12-19 17:50:35,058 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:50:35,058 INFO L791 eck$LassoCheckResult]: Stem: 478#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 479#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 484#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 485#L23 assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 517#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 515#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 513#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 510#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 508#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 506#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 500#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 502#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 501#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 489#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 490#L20-3 assume !(main_~i~0#1 < 100000); 497#L20-4 main_~i~0#1 := 0; 483#L26-3 [2021-12-19 17:50:35,059 INFO L793 eck$LassoCheckResult]: Loop: 483#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 493#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 482#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 483#L26-3 [2021-12-19 17:50:35,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:35,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1239058546, now seen corresponding path program 1 times [2021-12-19 17:50:35,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:35,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994616294] [2021-12-19 17:50:35,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:35,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:50:35,107 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:35,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:50:35,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994616294] [2021-12-19 17:50:35,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994616294] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:50:35,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431950558] [2021-12-19 17:50:35,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:35,108 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:50:35,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:35,110 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:50:35,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-19 17:50:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:50:35,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 17:50:35,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:50:35,200 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:35,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:50:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:35,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431950558] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:50:35,265 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:50:35,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-12-19 17:50:35,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657867631] [2021-12-19 17:50:35,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:50:35,266 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:50:35,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:35,267 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 3 times [2021-12-19 17:50:35,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:35,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129998734] [2021-12-19 17:50:35,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:35,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:35,289 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:50:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:35,291 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:50:35,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:50:35,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-19 17:50:35,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-19 17:50:35,338 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. cyclomatic complexity: 15 Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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) [2021-12-19 17:50:35,348 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 [2021-12-19 17:50:35,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:50:35,448 INFO L93 Difference]: Finished difference Result 158 states and 204 transitions. [2021-12-19 17:50:35,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-19 17:50:35,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 204 transitions. [2021-12-19 17:50:35,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-19 17:50:35,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 146 states and 180 transitions. [2021-12-19 17:50:35,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2021-12-19 17:50:35,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2021-12-19 17:50:35,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 180 transitions. [2021-12-19 17:50:35,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:50:35,458 INFO L681 BuchiCegarLoop]: Abstraction has 146 states and 180 transitions. [2021-12-19 17:50:35,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 180 transitions. [2021-12-19 17:50:35,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 94. [2021-12-19 17:50:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 93 states have internal predecessors, (118), 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) [2021-12-19 17:50:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2021-12-19 17:50:35,464 INFO L704 BuchiCegarLoop]: Abstraction has 94 states and 118 transitions. [2021-12-19 17:50:35,464 INFO L587 BuchiCegarLoop]: Abstraction has 94 states and 118 transitions. [2021-12-19 17:50:35,464 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-19 17:50:35,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 118 transitions. [2021-12-19 17:50:35,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-19 17:50:35,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:50:35,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:50:35,466 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 1, 1, 1, 1, 1] [2021-12-19 17:50:35,467 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:50:35,467 INFO L791 eck$LassoCheckResult]: Stem: 784#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 785#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 788#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 789#L23 assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 867#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 875#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 874#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 797#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 873#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 870#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 869#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 868#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 862#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 859#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 856#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 849#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 847#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 844#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 832#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 830#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 828#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 826#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 822#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 819#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 815#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 813#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 810#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 808#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 803#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 805#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 804#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 793#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 794#L20-3 assume !(main_~i~0#1 < 100000); 798#L20-4 main_~i~0#1 := 0; 787#L26-3 [2021-12-19 17:50:35,467 INFO L793 eck$LassoCheckResult]: Loop: 787#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 796#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 786#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 787#L26-3 [2021-12-19 17:50:35,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:35,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1906777394, now seen corresponding path program 2 times [2021-12-19 17:50:35,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:35,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290570482] [2021-12-19 17:50:35,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:35,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:50:35,583 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:35,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:50:35,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290570482] [2021-12-19 17:50:35,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290570482] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:50:35,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233626602] [2021-12-19 17:50:35,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 17:50:35,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:50:35,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:35,584 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:50:35,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-19 17:50:35,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 17:50:35,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:50:35,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-19 17:50:35,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:50:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:35,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:50:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:36,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233626602] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:50:36,000 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:50:36,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2021-12-19 17:50:36,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483375237] [2021-12-19 17:50:36,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:50:36,001 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:50:36,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:36,001 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 4 times [2021-12-19 17:50:36,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:36,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055763651] [2021-12-19 17:50:36,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:36,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:36,006 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:50:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:36,012 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:50:36,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:50:36,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-19 17:50:36,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2021-12-19 17:50:36,046 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. cyclomatic complexity: 27 Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 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) [2021-12-19 17:50:36,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:50:36,281 INFO L93 Difference]: Finished difference Result 338 states and 432 transitions. [2021-12-19 17:50:36,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-19 17:50:36,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 432 transitions. [2021-12-19 17:50:36,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-19 17:50:36,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 314 states and 384 transitions. [2021-12-19 17:50:36,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2021-12-19 17:50:36,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2021-12-19 17:50:36,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 314 states and 384 transitions. [2021-12-19 17:50:36,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:50:36,287 INFO L681 BuchiCegarLoop]: Abstraction has 314 states and 384 transitions. [2021-12-19 17:50:36,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states and 384 transitions. [2021-12-19 17:50:36,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 202. [2021-12-19 17:50:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 202 states have (on average 1.2376237623762376) internal successors, (250), 201 states have internal predecessors, (250), 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) [2021-12-19 17:50:36,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 250 transitions. [2021-12-19 17:50:36,296 INFO L704 BuchiCegarLoop]: Abstraction has 202 states and 250 transitions. [2021-12-19 17:50:36,296 INFO L587 BuchiCegarLoop]: Abstraction has 202 states and 250 transitions. [2021-12-19 17:50:36,296 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-19 17:50:36,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 202 states and 250 transitions. [2021-12-19 17:50:36,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-19 17:50:36,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:50:36,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:50:36,299 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [22, 22, 21, 1, 1, 1, 1, 1] [2021-12-19 17:50:36,299 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:50:36,300 INFO L791 eck$LassoCheckResult]: Stem: 1440#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 1441#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 1446#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1447#L23 assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1453#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1454#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1639#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1636#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1634#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1632#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1631#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1630#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1621#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1618#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1616#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1614#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1613#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1612#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1603#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1600#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1598#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1595#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1593#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1590#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1588#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1586#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1585#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1576#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1573#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1571#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1569#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1568#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1567#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1558#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1555#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1553#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1551#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1550#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1549#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1540#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1537#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1535#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1533#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1532#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1531#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1522#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1519#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1517#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1515#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1514#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1513#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1504#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1501#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1499#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1497#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1496#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1495#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1484#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1482#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1480#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1478#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1474#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1472#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1470#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1463#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1467#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1462#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1451#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1452#L20-3 assume !(main_~i~0#1 < 100000); 1458#L20-4 main_~i~0#1 := 0; 1445#L26-3 [2021-12-19 17:50:36,300 INFO L793 eck$LassoCheckResult]: Loop: 1445#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1455#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 1444#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 1445#L26-3 [2021-12-19 17:50:36,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:36,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1957770930, now seen corresponding path program 3 times [2021-12-19 17:50:36,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:36,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354002522] [2021-12-19 17:50:36,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:36,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:50:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:36,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:50:36,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354002522] [2021-12-19 17:50:36,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354002522] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:50:36,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285640048] [2021-12-19 17:50:36,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 17:50:36,668 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:50:36,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:36,670 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:50:36,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-19 17:50:37,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2021-12-19 17:50:37,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:50:37,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-19 17:50:37,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:50:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:37,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:50:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:38,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285640048] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:50:38,069 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:50:38,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2021-12-19 17:50:38,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063082712] [2021-12-19 17:50:38,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:50:38,070 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:50:38,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:38,071 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 5 times [2021-12-19 17:50:38,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:38,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009280180] [2021-12-19 17:50:38,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:38,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:38,075 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:50:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:38,079 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:50:38,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:50:38,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-19 17:50:38,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2021-12-19 17:50:38,110 INFO L87 Difference]: Start difference. First operand 202 states and 250 transitions. cyclomatic complexity: 51 Second operand has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 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) [2021-12-19 17:50:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:50:38,660 INFO L93 Difference]: Finished difference Result 698 states and 888 transitions. [2021-12-19 17:50:38,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-12-19 17:50:38,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 698 states and 888 transitions. [2021-12-19 17:50:38,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-19 17:50:38,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 698 states to 650 states and 792 transitions. [2021-12-19 17:50:38,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 283 [2021-12-19 17:50:38,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2021-12-19 17:50:38,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 650 states and 792 transitions. [2021-12-19 17:50:38,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:50:38,672 INFO L681 BuchiCegarLoop]: Abstraction has 650 states and 792 transitions. [2021-12-19 17:50:38,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states and 792 transitions. [2021-12-19 17:50:38,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 418. [2021-12-19 17:50:38,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 418 states have (on average 1.229665071770335) internal successors, (514), 417 states have internal predecessors, (514), 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) [2021-12-19 17:50:38,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 514 transitions. [2021-12-19 17:50:38,687 INFO L704 BuchiCegarLoop]: Abstraction has 418 states and 514 transitions. [2021-12-19 17:50:38,687 INFO L587 BuchiCegarLoop]: Abstraction has 418 states and 514 transitions. [2021-12-19 17:50:38,687 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-19 17:50:38,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 418 states and 514 transitions. [2021-12-19 17:50:38,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-19 17:50:38,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:50:38,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:50:38,693 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [46, 46, 44, 2, 1, 1, 1, 1] [2021-12-19 17:50:38,693 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:50:38,693 INFO L791 eck$LassoCheckResult]: Stem: 2806#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 2807#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 2812#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2813#L23 assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2824#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3222#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3220#L23 assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 3218#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3216#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3214#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3210#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3208#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3206#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3205#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3204#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3195#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3192#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3190#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3188#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3187#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3186#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3177#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3174#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3172#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3170#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3169#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3168#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3157#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3155#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3153#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3151#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3147#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3145#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3143#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3142#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3141#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3132#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3129#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3127#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3125#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3124#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3123#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3114#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3111#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3109#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3107#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3106#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3105#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3096#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3093#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3091#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3089#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3088#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3087#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3078#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3075#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3073#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3071#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3070#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3069#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3060#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3057#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3055#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3053#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3052#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3051#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3042#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3039#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3037#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3035#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3034#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3033#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3024#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3021#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3019#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3017#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3016#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3015#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3006#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3003#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3001#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2999#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2998#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2997#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2988#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2985#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2983#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2981#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2980#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2979#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2968#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2966#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2964#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2962#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2958#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2956#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2954#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2953#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2952#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2941#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2939#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2937#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2935#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2931#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2929#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2927#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2926#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2925#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2916#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2913#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2911#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2909#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2908#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2907#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2898#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2895#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2893#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2891#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2890#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2889#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2880#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2877#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2875#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2873#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2872#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2871#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2862#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2859#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2857#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2855#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2854#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2853#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2844#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2841#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2839#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2837#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2830#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2834#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2829#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2817#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2818#L20-3 assume !(main_~i~0#1 < 100000); 2825#L20-4 main_~i~0#1 := 0; 2811#L26-3 [2021-12-19 17:50:38,693 INFO L793 eck$LassoCheckResult]: Loop: 2811#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2821#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 2810#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 2811#L26-3 [2021-12-19 17:50:38,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:38,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1136763760, now seen corresponding path program 4 times [2021-12-19 17:50:38,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:38,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015803304] [2021-12-19 17:50:38,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:38,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:50:39,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:39,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:50:39,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015803304] [2021-12-19 17:50:39,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015803304] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:50:39,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928117792] [2021-12-19 17:50:39,777 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-19 17:50:39,777 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:50:39,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:39,779 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:50:39,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-12-19 17:50:39,962 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-19 17:50:39,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:50:39,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-19 17:50:39,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:50:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:40,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:50:42,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:42,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928117792] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:50:42,682 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:50:42,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2021-12-19 17:50:42,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800457957] [2021-12-19 17:50:42,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:50:42,683 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:50:42,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:42,683 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 6 times [2021-12-19 17:50:42,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:42,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378866467] [2021-12-19 17:50:42,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:42,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:42,688 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:50:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:50:42,691 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:50:42,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:50:42,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2021-12-19 17:50:42,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2021-12-19 17:50:42,727 INFO L87 Difference]: Start difference. First operand 418 states and 514 transitions. cyclomatic complexity: 99 Second operand has 97 states, 97 states have (on average 2.948453608247423) internal successors, (286), 97 states have internal predecessors, (286), 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) [2021-12-19 17:50:44,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:50:44,924 INFO L93 Difference]: Finished difference Result 1418 states and 1800 transitions. [2021-12-19 17:50:44,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-12-19 17:50:44,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1418 states and 1800 transitions. [2021-12-19 17:50:44,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-19 17:50:44,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1418 states to 1322 states and 1608 transitions. [2021-12-19 17:50:44,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 571 [2021-12-19 17:50:44,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 571 [2021-12-19 17:50:44,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1322 states and 1608 transitions. [2021-12-19 17:50:44,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:50:44,940 INFO L681 BuchiCegarLoop]: Abstraction has 1322 states and 1608 transitions. [2021-12-19 17:50:44,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states and 1608 transitions. [2021-12-19 17:50:44,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 850. [2021-12-19 17:50:44,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 850 states have (on average 1.2258823529411764) internal successors, (1042), 849 states have internal predecessors, (1042), 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) [2021-12-19 17:50:44,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1042 transitions. [2021-12-19 17:50:44,960 INFO L704 BuchiCegarLoop]: Abstraction has 850 states and 1042 transitions. [2021-12-19 17:50:44,960 INFO L587 BuchiCegarLoop]: Abstraction has 850 states and 1042 transitions. [2021-12-19 17:50:44,960 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-19 17:50:44,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 850 states and 1042 transitions. [2021-12-19 17:50:44,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-19 17:50:44,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:50:44,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:50:44,970 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [94, 94, 92, 2, 1, 1, 1, 1] [2021-12-19 17:50:44,970 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:50:44,970 INFO L791 eck$LassoCheckResult]: Stem: 5588#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 5589#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 5594#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5595#L23 assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5606#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6436#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6434#L23 assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 6432#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6430#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6428#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6424#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6422#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6420#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6419#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6418#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6409#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6406#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6404#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6402#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6401#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6400#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6391#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6388#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6386#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6384#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6383#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6382#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6373#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6370#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6368#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6366#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6365#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6364#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6353#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6351#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6349#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6347#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6343#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6341#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6339#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6338#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6337#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6328#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6325#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6323#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6321#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6320#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6319#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6310#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6307#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6305#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6303#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6302#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6301#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6292#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6289#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6287#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6285#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6284#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6283#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6274#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6271#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6269#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6267#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6266#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6265#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6256#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6253#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6251#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6249#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6248#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6247#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6238#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6235#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6233#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6231#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6230#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6229#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6220#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6217#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6215#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6212#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6210#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6207#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6205#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6203#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6202#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6193#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6190#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6188#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6186#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6185#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6184#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6175#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6172#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6170#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6168#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6167#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6166#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6157#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6154#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6152#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6150#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6149#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6148#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6139#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6136#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6134#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6132#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6131#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6130#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6121#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6118#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6116#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6114#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6113#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6112#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6103#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6100#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6098#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6096#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6095#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6094#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6085#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6082#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6080#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6078#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6077#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6076#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6065#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6063#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6061#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6059#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6055#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6053#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6051#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6050#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6049#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6040#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6037#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6035#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6033#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6032#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6031#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6022#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6019#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6017#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6015#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6014#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6013#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6004#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6001#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5999#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5997#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5996#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5995#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5984#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5982#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5980#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5978#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5974#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5972#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5970#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5969#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5968#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5957#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5955#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5953#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5951#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5947#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5945#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5943#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5942#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5941#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5932#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5929#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5927#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5925#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5924#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5923#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5914#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5911#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5909#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5907#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5906#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5905#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5896#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5893#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5891#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5889#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5888#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5887#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5878#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5875#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5873#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5871#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5870#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5869#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5860#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5857#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5855#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5853#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5852#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5851#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5840#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5838#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5836#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5834#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5830#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5828#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5826#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5825#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5824#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5813#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5811#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5809#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5807#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5803#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5801#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5799#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5798#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5797#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5788#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5785#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5783#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5781#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5780#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5779#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5770#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5767#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5765#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5763#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5762#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5761#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5752#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5749#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5747#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5745#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5744#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5743#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5734#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5731#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5729#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5727#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5726#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5725#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5716#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5713#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5711#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5709#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5708#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5707#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5696#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5694#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5692#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5690#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5686#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5684#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5682#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5681#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5680#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5669#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5667#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5665#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5663#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5659#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5657#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5655#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5654#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5653#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5644#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5641#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5639#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5637#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5636#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5635#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5626#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5623#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5621#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5619#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5612#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5616#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5611#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5599#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5600#L20-3 assume !(main_~i~0#1 < 100000); 5607#L20-4 main_~i~0#1 := 0; 5593#L26-3 [2021-12-19 17:50:44,970 INFO L793 eck$LassoCheckResult]: Loop: 5593#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5603#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 5592#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 5593#L26-3 [2021-12-19 17:50:44,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:50:44,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1178112656, now seen corresponding path program 5 times [2021-12-19 17:50:44,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:50:44,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205017599] [2021-12-19 17:50:44,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:50:44,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:50:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:50:48,177 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:50:48,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:50:48,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205017599] [2021-12-19 17:50:48,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205017599] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:50:48,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003346733] [2021-12-19 17:50:48,178 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 17:50:48,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:50:48,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:50:48,179 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) [2021-12-19 17:50:48,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process Killed by 15