./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_monotonic.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8 --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 13:19:45,110 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:19:45,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:19:45,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:19:45,131 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:19:45,132 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:19:45,133 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:19:45,135 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:19:45,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:19:45,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:19:45,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:19:45,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:19:45,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:19:45,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:19:45,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:19:45,142 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:19:45,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:19:45,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:19:45,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:19:45,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:19:45,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:19:45,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:19:45,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:19:45,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:19:45,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:19:45,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:19:45,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:19:45,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:19:45,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:19:45,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:19:45,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:19:45,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:19:45,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:19:45,161 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:19:45,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:19:45,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:19:45,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:19:45,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:19:45,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:19:45,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:19:45,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:19:45,165 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-12-13 13:19:45,182 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:19:45,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:19:45,183 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:19:45,183 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:19:45,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:19:45,184 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:19:45,184 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:19:45,184 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 13:19:45,184 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 13:19:45,184 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 13:19:45,184 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 13:19:45,184 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 13:19:45,184 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 13:19:45,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:19:45,185 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:19:45,185 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 13:19:45,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:19:45,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:19:45,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:19:45,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 13:19:45,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 13:19:45,185 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 13:19:45,185 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:19:45,185 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:19:45,186 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 13:19:45,186 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:19:45,186 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 13:19:45,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:19:45,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:19:45,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:19:45,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:19:45,187 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 13:19:45,187 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8 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 [2022-12-13 13:19:45,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:19:45,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:19:45,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:19:45,399 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:19:45,399 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:19:45,400 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2022-12-13 13:19:48,005 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:19:48,167 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:19:48,168 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2022-12-13 13:19:48,173 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/data/6d992ebcf/a3b8ba778f7a4284adc1a20885f74d87/FLAG82e178933 [2022-12-13 13:19:48,187 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/data/6d992ebcf/a3b8ba778f7a4284adc1a20885f74d87 [2022-12-13 13:19:48,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:19:48,190 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:19:48,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:19:48,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:19:48,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:19:48,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:19:48" (1/1) ... [2022-12-13 13:19:48,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65e02efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:48, skipping insertion in model container [2022-12-13 13:19:48,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:19:48" (1/1) ... [2022-12-13 13:19:48,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:19:48,211 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:19:48,307 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/sv-benchmarks/c/array-industry-pattern/array_monotonic.i[808,821] [2022-12-13 13:19:48,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:19:48,323 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:19:48,332 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/sv-benchmarks/c/array-industry-pattern/array_monotonic.i[808,821] [2022-12-13 13:19:48,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:19:48,344 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:19:48,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:48 WrapperNode [2022-12-13 13:19:48,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:19:48,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:19:48,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:19:48,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:19:48,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:48" (1/1) ... [2022-12-13 13:19:48,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:48" (1/1) ... [2022-12-13 13:19:48,367 INFO L138 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2022-12-13 13:19:48,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:19:48,368 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:19:48,368 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:19:48,368 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:19:48,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:48" (1/1) ... [2022-12-13 13:19:48,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:48" (1/1) ... [2022-12-13 13:19:48,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:48" (1/1) ... [2022-12-13 13:19:48,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:48" (1/1) ... [2022-12-13 13:19:48,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:48" (1/1) ... [2022-12-13 13:19:48,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:48" (1/1) ... [2022-12-13 13:19:48,382 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:48" (1/1) ... [2022-12-13 13:19:48,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:48" (1/1) ... [2022-12-13 13:19:48,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:19:48,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:19:48,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:19:48,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:19:48,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:48" (1/1) ... [2022-12-13 13:19:48,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:48,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:48,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:48,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 13:19:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:19:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:19:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:19:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:19:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:19:48,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:19:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:19:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:19:48,490 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:19:48,491 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:19:48,581 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:19:48,586 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:19:48,586 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 13:19:48,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:19:48 BoogieIcfgContainer [2022-12-13 13:19:48,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:19:48,588 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 13:19:48,588 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 13:19:48,592 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 13:19:48,593 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 13:19:48,593 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 01:19:48" (1/3) ... [2022-12-13 13:19:48,594 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e249852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 01:19:48, skipping insertion in model container [2022-12-13 13:19:48,594 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 13:19:48,594 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:19:48" (2/3) ... [2022-12-13 13:19:48,594 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e249852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 01:19:48, skipping insertion in model container [2022-12-13 13:19:48,594 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 13:19:48,594 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:19:48" (3/3) ... [2022-12-13 13:19:48,596 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_monotonic.i [2022-12-13 13:19:48,645 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 13:19:48,645 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 13:19:48,645 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 13:19:48,645 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 13:19:48,645 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 13:19:48,645 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 13:19:48,645 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 13:19:48,646 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 13:19:48,649 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) [2022-12-13 13:19:48,663 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-12-13 13:19:48,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:19:48,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:19:48,668 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:19:48,668 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 13:19:48,668 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 13:19:48,669 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) [2022-12-13 13:19:48,670 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-12-13 13:19:48,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:19:48,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:19:48,670 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:19:48,670 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 13:19:48,677 INFO L748 eck$LassoCheckResult]: Stem: 14#$Ultimate##0true 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); 5#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; 11#L20-3true [2022-12-13 13:19:48,677 INFO L750 eck$LassoCheckResult]: Loop: 11#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); 15#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); 12#L20-2true main_~i~0#1 := 2 + main_~i~0#1; 11#L20-3true [2022-12-13 13:19:48,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:48,682 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-12-13 13:19:48,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:48,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250315342] [2022-12-13 13:19:48,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:48,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:48,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:19:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:48,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:19:48,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:48,792 INFO L85 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2022-12-13 13:19:48,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:48,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134999822] [2022-12-13 13:19:48,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:48,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:48,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:19:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:48,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:19:48,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:48,812 INFO L85 PathProgramCache]: Analyzing trace with hash 28698763, now seen corresponding path program 1 times [2022-12-13 13:19:48,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:48,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965278290] [2022-12-13 13:19:48,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:48,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:48,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:19:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:48,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:19:49,201 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 13:19:49,201 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 13:19:49,202 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 13:19:49,202 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 13:19:49,202 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 13:19:49,202 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:49,202 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 13:19:49,202 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 13:19:49,203 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration1_Lasso [2022-12-13 13:19:49,203 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 13:19:49,203 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 13:19:49,222 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:19:49,231 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:19:49,235 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:19:49,238 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:19:49,240 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:19:49,242 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:19:49,485 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:19:49,690 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 13:19:49,695 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 13:19:49,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:49,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:49,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:49,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-12-13 13:19:49,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:19:49,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:19:49,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:19:49,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:19:49,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:19:49,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:19:49,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:19:49,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:19:49,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:19:49,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-12-13 13:19:49,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:49,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:49,720 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:49,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-12-13 13:19:49,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:19:49,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:19:49,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:19:49,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:19:49,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:19:49,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:19:49,737 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:19:49,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:19:49,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-12-13 13:19:49,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:49,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:49,745 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:49,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-12-13 13:19:49,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:19:49,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:19:49,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:19:49,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:19:49,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:19:49,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:19:49,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:19:49,764 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:19:49,767 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-12-13 13:19:49,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:49,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:49,768 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:49,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-12-13 13:19:49,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:19:49,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:19:49,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:19:49,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:19:49,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:19:49,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:19:49,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:19:49,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:19:49,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:19:49,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-12-13 13:19:49,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:49,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:49,787 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:49,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-12-13 13:19:49,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:19:49,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:19:49,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:19:49,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:19:49,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:19:49,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:19:49,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:19:49,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:19:49,802 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:19:49,805 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-12-13 13:19:49,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:49,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:49,806 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:49,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-12-13 13:19:49,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:19:49,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:19:49,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:19:49,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:19:49,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:19:49,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:19:49,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:19:49,825 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:19:49,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-12-13 13:19:49,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:49,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:49,830 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:49,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-12-13 13:19:49,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:19:49,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:19:49,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:19:49,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:19:49,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:19:49,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:19:49,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:19:49,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:19:49,845 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:19:49,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-12-13 13:19:49,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:49,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:49,849 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:49,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-12-13 13:19:49,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:19:49,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:19:49,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:19:49,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:19:49,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:19:49,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:19:49,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:19:49,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:19:49,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:19:49,866 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-12-13 13:19:49,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:49,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:49,867 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:49,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-12-13 13:19:49,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:19:49,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:19:49,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:19:49,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:19:49,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:19:49,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:19:49,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:19:49,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:19:49,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-12-13 13:19:49,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:49,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:49,891 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:49,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-12-13 13:19:49,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:19:49,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:19:49,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:19:49,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:19:49,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:19:49,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:19:49,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:19:49,910 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:19:49,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-12-13 13:19:49,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:49,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:49,914 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:49,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-12-13 13:19:49,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:19:49,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:19:49,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:19:49,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:19:49,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:19:49,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:19:49,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:19:49,946 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 13:19:50,002 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2022-12-13 13:19:50,002 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2022-12-13 13:19:50,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:50,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:50,024 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:50,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-12-13 13:19:50,026 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 13:19:50,038 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 13:19:50,038 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 13:19:50,038 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 [] [2022-12-13 13:19:50,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-12-13 13:19:50,076 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-12-13 13:19:50,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:50,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:19:50,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:19:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:50,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:19:50,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:19:50,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:50,203 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-12-13 13:19:50,205 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) [2022-12-13 13:19:50,247 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. [2022-12-13 13:19:50,248 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 [2022-12-13 13:19:50,252 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) [2022-12-13 13:19:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-12-13 13:19:50,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 2 letters. Loop has 3 letters. [2022-12-13 13:19:50,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:19:50,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 5 letters. Loop has 3 letters. [2022-12-13 13:19:50,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:19:50,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 2 letters. Loop has 6 letters. [2022-12-13 13:19:50,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:19:50,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 55 transitions. [2022-12-13 13:19:50,256 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-12-13 13:19:50,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 20 states and 28 transitions. [2022-12-13 13:19:50,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-12-13 13:19:50,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-12-13 13:19:50,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2022-12-13 13:19:50,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:19:50,259 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-12-13 13:19:50,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2022-12-13 13:19:50,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-12-13 13:19:50,277 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) [2022-12-13 13:19:50,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2022-12-13 13:19:50,278 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-12-13 13:19:50,278 INFO L428 stractBuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-12-13 13:19:50,278 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 13:19:50,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2022-12-13 13:19:50,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-12-13 13:19:50,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:19:50,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:19:50,279 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-12-13 13:19:50,279 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 13:19:50,279 INFO L748 eck$LassoCheckResult]: Stem: 157#$Ultimate##0 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); 158#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; 159#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); 150#L23 [2022-12-13 13:19:50,279 INFO L750 eck$LassoCheckResult]: Loop: 150#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 153#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 148#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); 150#L23 [2022-12-13 13:19:50,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:50,279 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2022-12-13 13:19:50,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:50,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797834108] [2022-12-13 13:19:50,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:50,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:50,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:19:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:50,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:19:50,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:50,298 INFO L85 PathProgramCache]: Analyzing trace with hash 44743, now seen corresponding path program 1 times [2022-12-13 13:19:50,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:50,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009816595] [2022-12-13 13:19:50,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:50,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:50,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:19:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:50,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:19:50,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:50,307 INFO L85 PathProgramCache]: Analyzing trace with hash 889663585, now seen corresponding path program 1 times [2022-12-13 13:19:50,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:50,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755385113] [2022-12-13 13:19:50,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:50,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:50,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:19:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:50,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:19:50,566 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 13:19:50,566 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 13:19:50,566 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 13:19:50,566 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 13:19:50,566 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 13:19:50,567 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:50,567 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 13:19:50,567 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 13:19:50,567 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration2_Lasso [2022-12-13 13:19:50,567 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 13:19:50,567 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 13:19:50,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-12-13 13:19:50,570 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:19:50,573 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:19:50,575 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:19:50,756 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:19:50,757 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:19:50,759 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:19:50,761 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:19:50,941 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 13:19:50,941 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 13:19:50,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:50,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:50,942 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:50,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-12-13 13:19:50,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:19:50,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:19:50,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:19:50,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:19:50,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:19:50,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:19:50,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:19:50,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:19:50,962 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-12-13 13:19:50,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:50,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:50,963 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:50,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-12-13 13:19:50,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:19:50,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:19:50,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:19:50,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:19:50,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:19:50,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:19:50,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:19:50,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:19:50,978 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:19:50,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-12-13 13:19:50,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:50,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:50,983 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:50,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-12-13 13:19:50,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:19:50,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:19:50,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:19:50,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:19:50,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:19:50,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:19:50,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:19:51,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:19:51,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-12-13 13:19:51,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:51,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:51,006 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:51,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-12-13 13:19:51,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:19:51,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:19:51,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:19:51,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:19:51,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:19:51,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:19:51,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:19:51,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:19:51,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-12-13 13:19:51,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:51,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:51,027 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:51,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-12-13 13:19:51,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:19:51,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:19:51,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:19:51,043 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-12-13 13:19:51,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:19:51,050 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-12-13 13:19:51,051 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-12-13 13:19:51,068 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:19:51,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-12-13 13:19:51,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:51,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:51,073 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:51,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-12-13 13:19:51,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 [2022-12-13 13:19:51,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:19:51,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:19:51,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:19:51,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:19:51,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:19:51,088 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:19:51,092 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:19:51,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-12-13 13:19:51,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:51,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:51,096 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:51,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-12-13 13:19:51,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:19:51,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:19:51,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:19:51,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:19:51,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:19:51,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:19:51,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:19:51,114 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:19:51,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-12-13 13:19:51,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:51,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:51,119 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:51,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-12-13 13:19:51,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:19:51,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:19:51,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:19:51,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:19:51,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:19:51,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:19:51,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:19:51,138 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:19:51,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-12-13 13:19:51,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:51,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:51,143 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:51,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-12-13 13:19:51,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:19:51,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:19:51,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:19:51,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:19:51,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:19:51,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:19:51,158 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:19:51,167 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 13:19:51,184 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-12-13 13:19:51,184 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-12-13 13:19:51,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:19:51,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:51,185 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:19:51,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-12-13 13:19:51,187 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 13:19:51,198 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 13:19:51,198 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 13:19:51,198 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 [] [2022-12-13 13:19:51,201 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-12-13 13:19:51,221 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2022-12-13 13:19:51,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:51,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:19:51,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:19:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:51,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:19:51,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:19:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:51,263 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-12-13 13:19:51,263 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) [2022-12-13 13:19:51,283 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. [2022-12-13 13:19:51,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-12-13 13:19:51,284 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) [2022-12-13 13:19:51,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-12-13 13:19:51,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 3 letters. Loop has 3 letters. [2022-12-13 13:19:51,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:19:51,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 6 letters. Loop has 3 letters. [2022-12-13 13:19:51,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:19:51,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 3 letters. Loop has 6 letters. [2022-12-13 13:19:51,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:19:51,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 54 transitions. [2022-12-13 13:19:51,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-12-13 13:19:51,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 29 states and 39 transitions. [2022-12-13 13:19:51,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-12-13 13:19:51,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-12-13 13:19:51,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. [2022-12-13 13:19:51,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:19:51,288 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 39 transitions. [2022-12-13 13:19:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. [2022-12-13 13:19:51,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-12-13 13:19:51,290 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) [2022-12-13 13:19:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2022-12-13 13:19:51,291 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-12-13 13:19:51,291 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-12-13 13:19:51,291 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 13:19:51,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 37 transitions. [2022-12-13 13:19:51,292 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-12-13 13:19:51,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:19:51,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:19:51,292 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-12-13 13:19:51,292 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 13:19:51,292 INFO L748 eck$LassoCheckResult]: Stem: 290#$Ultimate##0 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); 291#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; 292#L20-3 assume !(main_~i~0#1 < 100000); 293#L20-4 main_~i~0#1 := 0; 281#L26-3 [2022-12-13 13:19:51,292 INFO L750 eck$LassoCheckResult]: Loop: 281#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); 288#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 280#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 281#L26-3 [2022-12-13 13:19:51,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:51,293 INFO L85 PathProgramCache]: Analyzing trace with hash 925712, now seen corresponding path program 1 times [2022-12-13 13:19:51,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:51,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937846913] [2022-12-13 13:19:51,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:51,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:51,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:51,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937846913] [2022-12-13 13:19:51,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937846913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:19:51,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:19:51,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:19:51,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133989806] [2022-12-13 13:19:51,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:19:51,331 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 13:19:51,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:51,331 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 1 times [2022-12-13 13:19:51,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:51,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038902887] [2022-12-13 13:19:51,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:51,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:51,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:19:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:51,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:19:51,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:51,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:19:51,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:19:51,369 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) [2022-12-13 13:19:51,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:51,386 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-12-13 13:19:51,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 44 transitions. [2022-12-13 13:19:51,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:19:51,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 42 transitions. [2022-12-13 13:19:51,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-12-13 13:19:51,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-12-13 13:19:51,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2022-12-13 13:19:51,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:19:51,388 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-12-13 13:19:51,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2022-12-13 13:19:51,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2022-12-13 13:19:51,389 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) [2022-12-13 13:19:51,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2022-12-13 13:19:51,389 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-12-13 13:19:51,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:19:51,390 INFO L428 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-12-13 13:19:51,390 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 13:19:51,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2022-12-13 13:19:51,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:19:51,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:19:51,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:19:51,391 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:19:51,391 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 13:19:51,391 INFO L748 eck$LassoCheckResult]: Stem: 356#$Ultimate##0 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); 357#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; 346#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); 347#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 350#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 351#L20-3 assume !(main_~i~0#1 < 100000); 358#L20-4 main_~i~0#1 := 0; 345#L26-3 [2022-12-13 13:19:51,391 INFO L750 eck$LassoCheckResult]: Loop: 345#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); 354#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 344#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 345#L26-3 [2022-12-13 13:19:51,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:51,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1809767318, now seen corresponding path program 1 times [2022-12-13 13:19:51,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:51,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038652953] [2022-12-13 13:19:51,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:51,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:51,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:51,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038652953] [2022-12-13 13:19:51,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038652953] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:19:51,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727440673] [2022-12-13 13:19:51,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:51,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:19:51,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:51,425 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:19:51,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 13:19:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:51,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 13:19:51,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:19:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:51,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:19:51,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:51,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727440673] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:19:51,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:19:51,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 13:19:51,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530792861] [2022-12-13 13:19:51,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:19:51,488 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 13:19:51,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:51,488 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 2 times [2022-12-13 13:19:51,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:51,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718904170] [2022-12-13 13:19:51,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:51,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:51,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:19:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:51,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:19:51,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:51,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:19:51,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:19:51,527 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) [2022-12-13 13:19:51,548 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-12-13 13:19:51,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:51,573 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2022-12-13 13:19:51,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 89 transitions. [2022-12-13 13:19:51,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:19:51,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 62 states and 78 transitions. [2022-12-13 13:19:51,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-12-13 13:19:51,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-12-13 13:19:51,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 78 transitions. [2022-12-13 13:19:51,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:19:51,577 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 78 transitions. [2022-12-13 13:19:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 78 transitions. [2022-12-13 13:19:51,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 40. [2022-12-13 13:19:51,579 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) [2022-12-13 13:19:51,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-12-13 13:19:51,579 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-12-13 13:19:51,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:19:51,580 INFO L428 stractBuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-12-13 13:19:51,580 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-12-13 13:19:51,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. [2022-12-13 13:19:51,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:19:51,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:19:51,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:19:51,582 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1, 1, 1] [2022-12-13 13:19:51,582 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 13:19:51,582 INFO L748 eck$LassoCheckResult]: Stem: 489#$Ultimate##0 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); 490#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; 480#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); 481#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 491#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 512#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); 508#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 506#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 504#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); 502#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 497#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 500#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); 496#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 485#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 486#L20-3 assume !(main_~i~0#1 < 100000); 494#L20-4 main_~i~0#1 := 0; 479#L26-3 [2022-12-13 13:19:51,582 INFO L750 eck$LassoCheckResult]: Loop: 479#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); 488#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 478#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 479#L26-3 [2022-12-13 13:19:51,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:51,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1825864560, now seen corresponding path program 2 times [2022-12-13 13:19:51,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:51,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768108647] [2022-12-13 13:19:51,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:51,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:51,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:51,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768108647] [2022-12-13 13:19:51,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768108647] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:19:51,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322277494] [2022-12-13 13:19:51,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:19:51,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:19:51,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:51,658 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:19:51,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 13:19:51,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:19:51,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:19:51,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:19:51,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:19:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:51,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:19:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:51,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322277494] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:19:51,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:19:51,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 13:19:51,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983402757] [2022-12-13 13:19:51,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:19:51,765 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 13:19:51,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:51,765 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 3 times [2022-12-13 13:19:51,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:51,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120393296] [2022-12-13 13:19:51,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:51,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:51,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:19:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:51,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:19:51,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:51,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 13:19:51,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-13 13:19:51,799 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) [2022-12-13 13:19:51,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:51,880 INFO L93 Difference]: Finished difference Result 158 states and 204 transitions. [2022-12-13 13:19:51,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 204 transitions. [2022-12-13 13:19:51,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:19:51,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 146 states and 180 transitions. [2022-12-13 13:19:51,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2022-12-13 13:19:51,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2022-12-13 13:19:51,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 180 transitions. [2022-12-13 13:19:51,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:19:51,883 INFO L218 hiAutomatonCegarLoop]: Abstraction has 146 states and 180 transitions. [2022-12-13 13:19:51,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 180 transitions. [2022-12-13 13:19:51,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 94. [2022-12-13 13:19:51,887 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) [2022-12-13 13:19:51,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2022-12-13 13:19:51,887 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 118 transitions. [2022-12-13 13:19:51,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:19:51,888 INFO L428 stractBuchiCegarLoop]: Abstraction has 94 states and 118 transitions. [2022-12-13 13:19:51,888 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-12-13 13:19:51,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 118 transitions. [2022-12-13 13:19:51,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:19:51,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:19:51,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:19:51,889 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1, 1, 1] [2022-12-13 13:19:51,890 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 13:19:51,890 INFO L748 eck$LassoCheckResult]: Stem: 794#$Ultimate##0 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); 795#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; 784#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); 785#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 796#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 787#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); 788#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 797#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 871#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); 867#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 865#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 863#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); 856#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 853#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 851#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); 841#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 839#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 837#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); 835#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 834#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 833#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); 824#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 821#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 818#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; 806#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); 802#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 789#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 790#L20-3 assume !(main_~i~0#1 < 100000); 798#L20-4 main_~i~0#1 := 0; 783#L26-3 [2022-12-13 13:19:51,890 INFO L750 eck$LassoCheckResult]: Loop: 783#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); 793#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 782#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 783#L26-3 [2022-12-13 13:19:51,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:51,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1205177520, now seen corresponding path program 3 times [2022-12-13 13:19:51,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:51,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814096386] [2022-12-13 13:19:51,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:51,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:52,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:52,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814096386] [2022-12-13 13:19:52,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814096386] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:19:52,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46767631] [2022-12-13 13:19:52,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:19:52,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:19:52,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:52,059 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:19:52,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 13:19:52,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-12-13 13:19:52,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:19:52,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 13:19:52,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:19:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:52,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:19:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:52,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46767631] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:19:52,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:19:52,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-12-13 13:19:52,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605661557] [2022-12-13 13:19:52,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:19:52,388 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 13:19:52,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:52,389 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 4 times [2022-12-13 13:19:52,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:52,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280248979] [2022-12-13 13:19:52,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:52,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:52,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:19:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:52,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:19:52,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:52,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 13:19:52,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-12-13 13:19:52,427 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) [2022-12-13 13:19:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:52,705 INFO L93 Difference]: Finished difference Result 338 states and 432 transitions. [2022-12-13 13:19:52,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 432 transitions. [2022-12-13 13:19:52,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:19:52,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 314 states and 384 transitions. [2022-12-13 13:19:52,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2022-12-13 13:19:52,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2022-12-13 13:19:52,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 314 states and 384 transitions. [2022-12-13 13:19:52,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:19:52,712 INFO L218 hiAutomatonCegarLoop]: Abstraction has 314 states and 384 transitions. [2022-12-13 13:19:52,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states and 384 transitions. [2022-12-13 13:19:52,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 202. [2022-12-13 13:19:52,723 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) [2022-12-13 13:19:52,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 250 transitions. [2022-12-13 13:19:52,724 INFO L240 hiAutomatonCegarLoop]: Abstraction has 202 states and 250 transitions. [2022-12-13 13:19:52,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 13:19:52,725 INFO L428 stractBuchiCegarLoop]: Abstraction has 202 states and 250 transitions. [2022-12-13 13:19:52,726 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-12-13 13:19:52,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 202 states and 250 transitions. [2022-12-13 13:19:52,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:19:52,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:19:52,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:19:52,728 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 22, 1, 1, 1, 1] [2022-12-13 13:19:52,728 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 13:19:52,728 INFO L748 eck$LassoCheckResult]: Stem: 1451#$Ultimate##0 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); 1452#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; 1442#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); 1443#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1449#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1445#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); 1446#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1453#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1638#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); 1636#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1635#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); 1628#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1627#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1626#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); 1623#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1622#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1621#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); 1619#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1617#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); 1613#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1610#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1608#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); 1604#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1601#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1599#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); 1596#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1592#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); 1580#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1577#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1575#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); 1565#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1562#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1560#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); 1550#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1548#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1546#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); 1537#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1535#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1533#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); 1524#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1522#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1520#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); 1513#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1510#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1508#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); 1498#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1496#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1494#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); 1492#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1491#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1490#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); 1481#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1478#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1475#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); 1471#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1469#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1466#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); 1464#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1459#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1462#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); 1458#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1447#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1448#L20-3 assume !(main_~i~0#1 < 100000); 1454#L20-4 main_~i~0#1 := 0; 1441#L26-3 [2022-12-13 13:19:52,728 INFO L750 eck$LassoCheckResult]: Loop: 1441#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); 1450#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 1440#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 1441#L26-3 [2022-12-13 13:19:52,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:52,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1121042640, now seen corresponding path program 4 times [2022-12-13 13:19:52,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:52,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103580032] [2022-12-13 13:19:52,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:52,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:53,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:53,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103580032] [2022-12-13 13:19:53,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103580032] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:19:53,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272028906] [2022-12-13 13:19:53,213 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 13:19:53,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:19:53,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:53,214 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:19:53,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 13:19:53,293 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 13:19:53,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:19:53,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 13:19:53,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:19:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:53,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:19:53,825 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:53,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272028906] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:19:53,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:19:53,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-12-13 13:19:53,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769950190] [2022-12-13 13:19:53,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:19:53,827 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 13:19:53,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:53,827 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 5 times [2022-12-13 13:19:53,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:53,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331513537] [2022-12-13 13:19:53,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:53,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:53,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:19:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:19:53,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:19:53,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:53,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-13 13:19:53,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-12-13 13:19:53,874 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) [2022-12-13 13:19:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:19:54,326 INFO L93 Difference]: Finished difference Result 698 states and 888 transitions. [2022-12-13 13:19:54,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 698 states and 888 transitions. [2022-12-13 13:19:54,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:19:54,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 698 states to 650 states and 792 transitions. [2022-12-13 13:19:54,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 283 [2022-12-13 13:19:54,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2022-12-13 13:19:54,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 650 states and 792 transitions. [2022-12-13 13:19:54,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:19:54,332 INFO L218 hiAutomatonCegarLoop]: Abstraction has 650 states and 792 transitions. [2022-12-13 13:19:54,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states and 792 transitions. [2022-12-13 13:19:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 418. [2022-12-13 13:19:54,342 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) [2022-12-13 13:19:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 514 transitions. [2022-12-13 13:19:54,344 INFO L240 hiAutomatonCegarLoop]: Abstraction has 418 states and 514 transitions. [2022-12-13 13:19:54,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-13 13:19:54,345 INFO L428 stractBuchiCegarLoop]: Abstraction has 418 states and 514 transitions. [2022-12-13 13:19:54,345 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-12-13 13:19:54,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 418 states and 514 transitions. [2022-12-13 13:19:54,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:19:54,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:19:54,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:19:54,349 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 46, 1, 1, 1, 1] [2022-12-13 13:19:54,349 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 13:19:54,349 INFO L748 eck$LassoCheckResult]: Stem: 2818#$Ultimate##0 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); 2819#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; 2808#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); 2809#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2820#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3217#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); 3213#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3210#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3207#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); 3204#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3201#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3198#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; 3189#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); 3186#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3183#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3180#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; 3171#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); 3168#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3165#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3162#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); 3159#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3156#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); 3150#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3147#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3144#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); 3141#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3138#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3136#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); 3133#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3130#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); 3124#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3120#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3117#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; 3108#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); 3105#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3102#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3099#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; 3090#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); 3087#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3084#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3081#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; 3072#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); 3069#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3066#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3063#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; 3054#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); 3051#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3048#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3045#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; 3036#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); 3033#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3030#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3028#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); 3026#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3025#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3024#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); 3023#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3020#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3017#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); 3014#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3012#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3009#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); 3005#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3003#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3000#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); 2996#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2994#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2991#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); 2987#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2985#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2982#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); 2978#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2976#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2973#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); 2969#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2967#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); 2960#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2958#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2955#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); 2951#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2949#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2946#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); 2942#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2940#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); 2933#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2931#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2928#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); 2924#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2922#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2919#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); 2915#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2913#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2910#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); 2906#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2904#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2901#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); 2897#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2895#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2892#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); 2887#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2884#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2881#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); 2879#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2875#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2872#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); 2863#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2861#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2859#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); 2857#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2856#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2855#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); 2847#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2844#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2841#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; 2835#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2833#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); 2831#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2826#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2829#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); 2825#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2813#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2814#L20-3 assume !(main_~i~0#1 < 100000); 2823#L20-4 main_~i~0#1 := 0; 2807#L26-3 [2022-12-13 13:19:54,349 INFO L750 eck$LassoCheckResult]: Loop: 2807#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); 2817#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 2806#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 2807#L26-3 [2022-12-13 13:19:54,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:19:54,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1788222416, now seen corresponding path program 5 times [2022-12-13 13:19:54,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:19:54,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967203991] [2022-12-13 13:19:54,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:19:54,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:19:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:19:55,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:19:55,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:19:55,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967203991] [2022-12-13 13:19:55,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967203991] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:19:55,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446484074] [2022-12-13 13:19:55,619 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 13:19:55,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:19:55,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:19:55,620 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:19:55,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 13:20:21,318 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-12-13 13:20:21,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:20:21,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-13 13:20:21,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:20:21,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:20:21,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:20:23,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:20:23,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446484074] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:20:23,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:20:23,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2022-12-13 13:20:23,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426434323] [2022-12-13 13:20:23,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:20:23,399 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 13:20:23,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:23,399 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 6 times [2022-12-13 13:20:23,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:23,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614949147] [2022-12-13 13:20:23,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:23,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:23,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:20:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:23,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:20:23,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:23,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-12-13 13:20:23,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-12-13 13:20:23,426 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) [2022-12-13 13:20:25,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:20:25,961 INFO L93 Difference]: Finished difference Result 1418 states and 1800 transitions. [2022-12-13 13:20:25,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1418 states and 1800 transitions. [2022-12-13 13:20:25,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:20:25,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1418 states to 1322 states and 1608 transitions. [2022-12-13 13:20:25,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 571 [2022-12-13 13:20:25,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 571 [2022-12-13 13:20:25,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1322 states and 1608 transitions. [2022-12-13 13:20:25,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:20:25,968 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1322 states and 1608 transitions. [2022-12-13 13:20:25,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states and 1608 transitions. [2022-12-13 13:20:25,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 850. [2022-12-13 13:20:25,980 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) [2022-12-13 13:20:25,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1042 transitions. [2022-12-13 13:20:25,982 INFO L240 hiAutomatonCegarLoop]: Abstraction has 850 states and 1042 transitions. [2022-12-13 13:20:25,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-12-13 13:20:25,983 INFO L428 stractBuchiCegarLoop]: Abstraction has 850 states and 1042 transitions. [2022-12-13 13:20:25,983 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-12-13 13:20:25,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 850 states and 1042 transitions. [2022-12-13 13:20:25,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:20:25,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:20:25,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:20:25,988 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 94, 1, 1, 1, 1] [2022-12-13 13:20:25,988 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 13:20:25,989 INFO L748 eck$LassoCheckResult]: Stem: 5599#$Ultimate##0 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); 5600#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; 5590#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); 5591#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5597#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5593#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); 5594#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6429#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6427#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); 6425#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6424#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6423#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); 6414#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6411#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6409#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); 6407#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6406#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6405#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); 6396#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6393#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6391#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); 6389#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6388#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6387#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); 6378#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6375#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6373#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); 6371#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6370#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6369#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); 6360#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6357#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6355#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; 6352#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6351#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); 6342#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6339#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); 6334#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6332#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6329#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); 6327#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6325#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6324#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); 6315#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6312#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6310#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); 6308#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6307#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6306#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); 6297#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6294#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6292#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); 6290#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6289#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6288#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); 6279#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6276#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6274#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); 6272#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6271#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6270#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); 6261#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6258#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6256#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); 6254#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6253#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6252#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); 6243#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6240#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6238#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); 6236#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6235#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6234#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); 6225#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6222#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6220#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); 6218#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6217#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6216#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); 6207#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6204#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); 6200#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6199#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6198#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); 6187#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6185#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6183#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); 6181#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6177#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6175#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); 6173#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6172#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6171#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); 6162#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6159#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6157#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); 6155#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6154#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6153#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); 6144#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6141#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6139#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); 6137#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6136#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6135#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); 6126#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6123#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6121#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); 6119#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6118#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6117#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); 6108#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6105#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6103#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); 6101#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6100#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6099#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); 6090#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6087#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6085#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); 6083#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6082#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6081#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); 6072#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6069#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6067#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; 6064#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6063#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); 6054#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6051#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); 6046#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6044#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6041#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); 6039#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6037#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6036#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); 6027#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6024#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6022#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); 6020#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6019#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6018#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); 6009#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6006#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6004#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); 6002#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6001#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6000#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); 5991#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5988#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5986#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; 5983#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5982#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); 5973#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5970#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); 5966#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5965#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5964#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); 5955#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5952#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5950#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); 5948#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5947#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5946#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); 5937#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5934#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5932#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); 5929#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5927#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5924#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); 5922#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5920#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5919#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); 5910#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5907#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); 5902#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5900#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5897#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); 5895#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5893#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5892#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); 5883#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5880#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5878#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); 5876#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5875#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5874#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); 5865#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5862#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5860#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); 5858#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5857#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5856#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); 5847#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5844#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5842#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; 5839#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5838#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); 5829#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5826#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); 5822#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5821#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5820#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); 5811#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5808#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5806#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); 5804#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5803#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5802#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); 5793#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5790#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5788#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); 5785#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5783#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5780#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); 5778#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5776#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5775#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); 5766#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5763#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); 5758#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5756#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5753#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); 5751#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5749#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5748#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); 5739#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5736#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5734#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); 5732#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5731#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5730#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); 5721#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5718#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5716#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); 5714#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5713#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5712#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); 5703#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5700#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5698#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; 5695#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5694#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); 5685#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5682#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); 5678#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5677#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5676#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); 5667#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5664#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5662#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); 5660#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5659#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5658#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); 5649#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5646#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5644#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); 5641#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5639#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5636#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); 5634#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5632#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5631#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); 5622#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5619#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5617#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); 5615#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5608#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5610#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); 5609#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5595#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5596#L20-3 assume !(main_~i~0#1 < 100000); 5603#L20-4 main_~i~0#1 := 0; 5589#L26-3 [2022-12-13 13:20:25,989 INFO L750 eck$LassoCheckResult]: Loop: 5589#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); 5598#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 5588#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 5589#L26-3 [2022-12-13 13:20:25,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:25,989 INFO L85 PathProgramCache]: Analyzing trace with hash 712364496, now seen corresponding path program 6 times [2022-12-13 13:20:25,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:25,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893204357] [2022-12-13 13:20:25,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:25,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:20:30,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:30,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893204357] [2022-12-13 13:20:30,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893204357] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:20:30,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860762944] [2022-12-13 13:20:30,173 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 13:20:30,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:20:30,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:20:30,174 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:20:30,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eae4930-d928-4649-8950-7b33cddef295/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process