./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 e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_monotonic.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8 --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-e04fb08 [2022-11-16 11:35:02,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:35:02,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:35:02,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:35:02,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:35:02,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:35:02,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:35:02,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:35:02,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:35:02,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:35:02,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:35:02,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:35:02,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:35:02,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:35:02,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:35:02,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:35:02,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:35:02,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:35:02,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:35:02,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:35:02,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:35:02,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:35:02,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:35:02,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:35:03,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:35:03,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:35:03,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:35:03,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:35:03,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:35:03,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:35:03,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:35:03,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:35:03,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:35:03,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:35:03,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:35:03,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:35:03,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:35:03,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:35:03,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:35:03,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:35:03,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:35:03,018 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-16 11:35:03,059 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:35:03,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:35:03,060 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:35:03,061 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:35:03,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:35:03,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:35:03,063 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:35:03,063 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-16 11:35:03,063 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-16 11:35:03,064 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-16 11:35:03,065 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-16 11:35:03,065 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-16 11:35:03,065 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-16 11:35:03,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:35:03,066 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:35:03,066 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:35:03,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:35:03,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:35:03,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:35:03,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-16 11:35:03,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-16 11:35:03,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-16 11:35:03,068 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:35:03,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:35:03,069 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-16 11:35:03,069 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:35:03,069 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-16 11:35:03,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:35:03,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:35:03,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:35:03,071 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:35:03,072 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-16 11:35:03,072 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_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/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_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8 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-11-16 11:35:03,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:35:03,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:35:03,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:35:03,412 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:35:03,413 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:35:03,414 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2022-11-16 11:35:03,501 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/data/4eae861e0/c98a66ae454e4125912a468aedb50114/FLAG33511c936 [2022-11-16 11:35:03,946 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:35:03,946 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2022-11-16 11:35:03,952 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/data/4eae861e0/c98a66ae454e4125912a468aedb50114/FLAG33511c936 [2022-11-16 11:35:04,318 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/data/4eae861e0/c98a66ae454e4125912a468aedb50114 [2022-11-16 11:35:04,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:35:04,323 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:35:04,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:35:04,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:35:04,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:35:04,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:35:04" (1/1) ... [2022-11-16 11:35:04,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69220f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:04, skipping insertion in model container [2022-11-16 11:35:04,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:35:04" (1/1) ... [2022-11-16 11:35:04,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:35:04,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:35:04,542 WARN L229 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_9df35c75-fba2-461b-90ec-727f37ec04f8/sv-benchmarks/c/array-industry-pattern/array_monotonic.i[808,821] [2022-11-16 11:35:04,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:35:04,563 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:35:04,576 WARN L229 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_9df35c75-fba2-461b-90ec-727f37ec04f8/sv-benchmarks/c/array-industry-pattern/array_monotonic.i[808,821] [2022-11-16 11:35:04,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:35:04,597 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:35:04,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:04 WrapperNode [2022-11-16 11:35:04,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:35:04,599 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:35:04,599 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:35:04,599 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:35:04,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:04" (1/1) ... [2022-11-16 11:35:04,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:04" (1/1) ... [2022-11-16 11:35:04,634 INFO L138 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2022-11-16 11:35:04,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:35:04,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:35:04,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:35:04,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:35:04,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:04" (1/1) ... [2022-11-16 11:35:04,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:04" (1/1) ... [2022-11-16 11:35:04,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:04" (1/1) ... [2022-11-16 11:35:04,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:04" (1/1) ... [2022-11-16 11:35:04,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:04" (1/1) ... [2022-11-16 11:35:04,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:04" (1/1) ... [2022-11-16 11:35:04,658 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:04" (1/1) ... [2022-11-16 11:35:04,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:04" (1/1) ... [2022-11-16 11:35:04,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:35:04,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:35:04,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:35:04,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:35:04,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:04" (1/1) ... [2022-11-16 11:35:04,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:04,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:04,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:04,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-16 11:35:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:35:04,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:35:04,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:35:04,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:35:04,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:35:04,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:35:04,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:35:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:35:04,817 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:35:04,819 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:35:04,960 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:35:04,967 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:35:04,967 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 11:35:04,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:35:04 BoogieIcfgContainer [2022-11-16 11:35:04,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:35:04,974 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-16 11:35:04,977 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-16 11:35:04,980 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-16 11:35:04,981 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:35:04,981 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 11:35:04" (1/3) ... [2022-11-16 11:35:04,982 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49bb53b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 11:35:04, skipping insertion in model container [2022-11-16 11:35:04,982 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:35:04,982 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:04" (2/3) ... [2022-11-16 11:35:04,983 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49bb53b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 11:35:04, skipping insertion in model container [2022-11-16 11:35:04,983 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:35:04,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:35:04" (3/3) ... [2022-11-16 11:35:04,985 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_monotonic.i [2022-11-16 11:35:05,048 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-16 11:35:05,048 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-16 11:35:05,049 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-16 11:35:05,049 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-16 11:35:05,049 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-16 11:35:05,049 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-16 11:35:05,049 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-16 11:35:05,050 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-16 11:35:05,054 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-11-16 11:35:05,075 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-11-16 11:35:05,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:35:05,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:35:05,082 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 11:35:05,082 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-16 11:35:05,083 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-16 11:35:05,083 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-11-16 11:35:05,085 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-11-16 11:35:05,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:35:05,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:35:05,086 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 11:35:05,086 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-16 11:35:05,095 INFO L748 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); 6#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; 12#L20-3true [2022-11-16 11:35:05,096 INFO L750 eck$LassoCheckResult]: Loop: 12#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); 13#L20-2true main_~i~0#1 := 2 + main_~i~0#1; 12#L20-3true [2022-11-16 11:35:05,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:05,103 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-16 11:35:05,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:05,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167084964] [2022-11-16 11:35:05,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:05,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:05,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:35:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:05,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:35:05,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:05,257 INFO L85 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2022-11-16 11:35:05,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:05,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760062309] [2022-11-16 11:35:05,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:05,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:05,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:35:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:05,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:35:05,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:05,290 INFO L85 PathProgramCache]: Analyzing trace with hash 28698763, now seen corresponding path program 1 times [2022-11-16 11:35:05,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:05,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47567110] [2022-11-16 11:35:05,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:05,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:05,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:35:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:05,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:35:05,939 INFO L210 LassoAnalysis]: Preferences: [2022-11-16 11:35:05,940 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-16 11:35:05,940 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-16 11:35:05,940 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-16 11:35:05,940 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-16 11:35:05,941 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:05,941 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-16 11:35:05,941 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-16 11:35:05,941 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration1_Lasso [2022-11-16 11:35:05,941 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-16 11:35:05,941 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-16 11:35:05,965 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:35:05,980 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:35:05,984 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:35:05,991 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:35:05,994 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:35:05,998 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:35:06,370 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:35:06,694 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-16 11:35:06,702 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-16 11:35:06,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:06,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:06,714 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:06,719 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-11-16 11:35:06,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-16 11:35:06,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:35:06,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:35:06,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:35:06,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:35:06,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:35:06,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:35:06,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:35:06,746 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:35:06,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-11-16 11:35:06,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:06,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:06,767 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:06,791 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-11-16 11:35:06,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-16 11:35:06,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:35:06,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:35:06,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:35:06,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:35:06,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:35:06,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:35:06,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:35:06,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-11-16 11:35:06,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:06,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:06,871 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:06,906 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-11-16 11:35:06,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-16 11:35:06,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:35:06,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:35:06,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:35:06,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:35:06,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:35:06,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:35:06,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:35:06,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:06,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:06,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:06,982 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:06,992 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-11-16 11:35:07,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-16 11:35:07,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:35:07,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:35:07,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:35:07,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:35:07,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:35:07,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:35:07,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:35:07,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:35:07,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:07,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:07,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:07,027 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:07,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-16 11:35:07,036 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-11-16 11:35:07,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:35:07,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:35:07,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:35:07,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:35:07,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:35:07,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:35:07,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:35:07,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:35:07,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:07,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:07,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:07,084 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:07,096 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-11-16 11:35:07,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-16 11:35:07,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:35:07,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:35:07,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:35:07,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:35:07,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:35:07,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:35:07,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:35:07,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:07,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:07,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:07,153 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:07,164 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-11-16 11:35:07,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-16 11:35:07,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:35:07,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:35:07,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:35:07,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:35:07,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:35:07,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:35:07,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:35:07,198 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:35:07,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:07,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:07,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:07,209 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:07,220 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-11-16 11:35:07,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-16 11:35:07,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:35:07,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:35:07,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:35:07,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:35:07,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:35:07,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:35:07,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:35:07,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:35:07,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:07,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:07,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:07,257 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:07,266 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-11-16 11:35:07,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-16 11:35:07,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:35:07,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:35:07,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:35:07,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:35:07,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:35:07,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:35:07,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:35:07,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:07,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:07,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:07,308 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:07,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-16 11:35:07,315 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-11-16 11:35:07,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:35:07,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:35:07,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:35:07,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:35:07,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:35:07,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:35:07,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:35:07,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:07,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:07,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:07,367 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:07,376 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-11-16 11:35:07,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-16 11:35:07,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:35:07,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:35:07,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:35:07,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:35:07,404 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:35:07,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:35:07,421 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-16 11:35:07,526 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2022-11-16 11:35:07,526 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2022-11-16 11:35:07,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:07,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:07,535 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:07,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-16 11:35:07,563 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-16 11:35:07,599 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-16 11:35:07,599 INFO L513 LassoAnalysis]: Proved termination. [2022-11-16 11:35:07,600 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-11-16 11:35:07,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:07,652 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-11-16 11:35:07,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:07,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:35:07,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:07,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:35:07,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:07,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-11-16 11:35:07,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:35:07,884 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-11-16 11:35:07,886 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-11-16 11:35:07,954 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-11-16 11:35:07,958 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-11-16 11:35:07,967 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-11-16 11:35:07,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-11-16 11:35:07,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 2 letters. Loop has 3 letters. [2022-11-16 11:35:07,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:35:07,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 5 letters. Loop has 3 letters. [2022-11-16 11:35:07,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:35:07,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 2 letters. Loop has 6 letters. [2022-11-16 11:35:07,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:35:07,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 55 transitions. [2022-11-16 11:35:07,979 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-11-16 11:35:07,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 20 states and 28 transitions. [2022-11-16 11:35:07,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-11-16 11:35:07,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-11-16 11:35:07,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2022-11-16 11:35:07,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:35:07,988 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-11-16 11:35:08,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2022-11-16 11:35:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-11-16 11:35:08,010 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-11-16 11:35:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2022-11-16 11:35:08,012 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-11-16 11:35:08,012 INFO L428 stractBuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-11-16 11:35:08,012 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-16 11:35:08,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2022-11-16 11:35:08,013 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-11-16 11:35:08,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:35:08,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:35:08,014 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-11-16 11:35:08,014 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-16 11:35:08,014 INFO L748 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); 147#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); 152#L23 [2022-11-16 11:35:08,015 INFO L750 eck$LassoCheckResult]: Loop: 152#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 155#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 150#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 152#L23 [2022-11-16 11:35:08,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:08,016 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2022-11-16 11:35:08,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:08,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824587124] [2022-11-16 11:35:08,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:08,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:08,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:35:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:08,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:35:08,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:08,047 INFO L85 PathProgramCache]: Analyzing trace with hash 44743, now seen corresponding path program 1 times [2022-11-16 11:35:08,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:08,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164910134] [2022-11-16 11:35:08,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:08,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:08,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:35:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:08,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:35:08,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:08,063 INFO L85 PathProgramCache]: Analyzing trace with hash 889663585, now seen corresponding path program 1 times [2022-11-16 11:35:08,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:08,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910593668] [2022-11-16 11:35:08,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:08,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:08,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:35:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:08,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:35:08,471 INFO L210 LassoAnalysis]: Preferences: [2022-11-16 11:35:08,471 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-16 11:35:08,471 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-16 11:35:08,471 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-16 11:35:08,471 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-16 11:35:08,471 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:08,471 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-16 11:35:08,471 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-16 11:35:08,471 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration2_Lasso [2022-11-16 11:35:08,471 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-16 11:35:08,471 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-16 11:35:08,474 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:35:08,480 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:35:08,482 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:35:08,799 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:35:08,803 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:35:08,808 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:35:08,811 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:35:09,133 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-16 11:35:09,134 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-16 11:35:09,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:09,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:09,140 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:09,156 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-11-16 11:35:09,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-16 11:35:09,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:35:09,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:35:09,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:35:09,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:35:09,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:35:09,173 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:35:09,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:35:09,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:09,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:09,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:09,194 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:09,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-11-16 11:35:09,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:35:09,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:35:09,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:35:09,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:35:09,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:35:09,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:35:09,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:35:09,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:35:09,229 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:35:09,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-11-16 11:35:09,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:09,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:09,236 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:09,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-16 11:35:09,247 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-11-16 11:35:09,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:35:09,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:35:09,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:35:09,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:35:09,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:35:09,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:35:09,270 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:35:09,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:09,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:09,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:09,277 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:09,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-11-16 11:35:09,280 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-11-16 11:35:09,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:35:09,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:35:09,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:35:09,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:35:09,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:35:09,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:35:09,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:35:09,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:09,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:09,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:09,306 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:09,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-16 11:35:09,308 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-11-16 11:35:09,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:35:09,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:35:09,320 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-11-16 11:35:09,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:35:09,337 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-11-16 11:35:09,337 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-11-16 11:35:09,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:35:09,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:09,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:09,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:09,380 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:09,396 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-11-16 11:35:09,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:35:09,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:35:09,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:35:09,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:35:09,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-11-16 11:35:09,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:35:09,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:35:09,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:35:09,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:09,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:09,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:09,438 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:09,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-16 11:35:09,445 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-11-16 11:35:09,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:35:09,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:35:09,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:35:09,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:35:09,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:35:09,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:35:09,468 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:35:09,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:09,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:09,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:09,480 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:09,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-16 11:35:09,489 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-11-16 11:35:09,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:35:09,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:35:09,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:35:09,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:35:09,502 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:35:09,502 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:35:09,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:35:09,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:09,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:09,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:09,520 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:09,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-16 11:35:09,523 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-11-16 11:35:09,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:35:09,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:35:09,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:35:09,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:35:09,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:35:09,538 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:35:09,573 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-16 11:35:09,601 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-11-16 11:35:09,601 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-11-16 11:35:09,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:35:09,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:09,613 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:09,619 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-16 11:35:09,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-11-16 11:35:09,650 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-16 11:35:09,650 INFO L513 LassoAnalysis]: Proved termination. [2022-11-16 11:35:09,650 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-11-16 11:35:09,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-11-16 11:35:09,687 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2022-11-16 11:35:09,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:35:09,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:35:09,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:09,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:35:09,769 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-11-16 11:35:09,769 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-11-16 11:35:09,815 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-11-16 11:35:09,815 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-11-16 11:35:09,816 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-11-16 11:35:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-11-16 11:35:09,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 3 letters. Loop has 3 letters. [2022-11-16 11:35:09,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:35:09,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 6 letters. Loop has 3 letters. [2022-11-16 11:35:09,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:35:09,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 3 letters. Loop has 6 letters. [2022-11-16 11:35:09,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:35:09,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 54 transitions. [2022-11-16 11:35:09,825 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-11-16 11:35:09,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 29 states and 39 transitions. [2022-11-16 11:35:09,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-11-16 11:35:09,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-11-16 11:35:09,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. [2022-11-16 11:35:09,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:35:09,833 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 39 transitions. [2022-11-16 11:35:09,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. [2022-11-16 11:35:09,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-16 11:35:09,836 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-11-16 11:35:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2022-11-16 11:35:09,838 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-11-16 11:35:09,838 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-11-16 11:35:09,838 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-16 11:35:09,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 37 transitions. [2022-11-16 11:35:09,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-11-16 11:35:09,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:35:09,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:35:09,840 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-16 11:35:09,840 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-16 11:35:09,841 INFO L748 eck$LassoCheckResult]: Stem: 280#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 281#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; 293#L20-3 assume !(main_~i~0#1 < 100000); 294#L20-4 main_~i~0#1 := 0; 302#L26-3 [2022-11-16 11:35:09,841 INFO L750 eck$LassoCheckResult]: Loop: 302#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); 299#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 300#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 302#L26-3 [2022-11-16 11:35:09,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:09,842 INFO L85 PathProgramCache]: Analyzing trace with hash 925712, now seen corresponding path program 1 times [2022-11-16 11:35:09,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:09,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255083272] [2022-11-16 11:35:09,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:09,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:35:09,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:09,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255083272] [2022-11-16 11:35:09,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255083272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:09,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:09,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:35:09,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135080960] [2022-11-16 11:35:09,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:09,961 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:35:09,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 1 times [2022-11-16 11:35:09,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:09,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950532958] [2022-11-16 11:35:09,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:09,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:09,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:35:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:09,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:35:10,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:10,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:35:10,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:35:10,041 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-11-16 11:35:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:10,082 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-11-16 11:35:10,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 44 transitions. [2022-11-16 11:35:10,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-16 11:35:10,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 42 transitions. [2022-11-16 11:35:10,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-11-16 11:35:10,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-11-16 11:35:10,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2022-11-16 11:35:10,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:35:10,088 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-11-16 11:35:10,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2022-11-16 11:35:10,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2022-11-16 11:35:10,092 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-11-16 11:35:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2022-11-16 11:35:10,094 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-11-16 11:35:10,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:35:10,096 INFO L428 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-11-16 11:35:10,097 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-16 11:35:10,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2022-11-16 11:35:10,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-16 11:35:10,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:35:10,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:35:10,100 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:10,100 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-16 11:35:10,101 INFO L748 eck$LassoCheckResult]: Stem: 344#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 345#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; 348#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 349#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 353#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 354#L20-3 assume !(main_~i~0#1 < 100000); 359#L20-4 main_~i~0#1 := 0; 347#L26-3 [2022-11-16 11:35:10,101 INFO L750 eck$LassoCheckResult]: Loop: 347#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); 357#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 346#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 347#L26-3 [2022-11-16 11:35:10,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:10,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1809767318, now seen corresponding path program 1 times [2022-11-16 11:35:10,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:10,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367257913] [2022-11-16 11:35:10,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:10,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:10,145 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:10,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:35:10,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:10,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367257913] [2022-11-16 11:35:10,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367257913] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:10,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192062601] [2022-11-16 11:35:10,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:10,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:10,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:10,188 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:35:10,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-16 11:35:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:10,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:35:10,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:35:10,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:35:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:35:10,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192062601] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:35:10,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:35:10,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-16 11:35:10,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949352258] [2022-11-16 11:35:10,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:35:10,280 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:35:10,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:10,281 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 2 times [2022-11-16 11:35:10,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:10,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712307858] [2022-11-16 11:35:10,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:10,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:10,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:35:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:10,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:35:10,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:10,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:35:10,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:35:10,339 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-11-16 11:35:10,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:10,451 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2022-11-16 11:35:10,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 89 transitions. [2022-11-16 11:35:10,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-16 11:35:10,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 62 states and 78 transitions. [2022-11-16 11:35:10,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-11-16 11:35:10,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-11-16 11:35:10,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 78 transitions. [2022-11-16 11:35:10,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:35:10,469 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 78 transitions. [2022-11-16 11:35:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 78 transitions. [2022-11-16 11:35:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 40. [2022-11-16 11:35:10,474 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-11-16 11:35:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-11-16 11:35:10,478 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-11-16 11:35:10,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:35:10,479 INFO L428 stractBuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-11-16 11:35:10,480 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-16 11:35:10,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. [2022-11-16 11:35:10,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-16 11:35:10,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:35:10,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:35:10,482 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1, 1, 1] [2022-11-16 11:35:10,482 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-16 11:35:10,483 INFO L748 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 477#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; 482#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 483#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 489#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 485#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 486#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 509#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 507#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 505#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 498#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 502#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 497#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 487#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 488#L20-3 assume !(main_~i~0#1 < 100000); 493#L20-4 main_~i~0#1 := 0; 481#L26-3 [2022-11-16 11:35:10,483 INFO L750 eck$LassoCheckResult]: Loop: 481#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); 490#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 480#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 481#L26-3 [2022-11-16 11:35:10,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:10,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1825864560, now seen corresponding path program 2 times [2022-11-16 11:35:10,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:10,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410353251] [2022-11-16 11:35:10,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:10,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:35:10,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:10,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410353251] [2022-11-16 11:35:10,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410353251] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:10,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118212227] [2022-11-16 11:35:10,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:35:10,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:10,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:10,623 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:35:10,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-16 11:35:10,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:35:10,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:35:10,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:35:10,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:10,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-11-16 11:35:10,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:35:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:35:10,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118212227] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:35:10,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:35:10,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-16 11:35:10,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093816968] [2022-11-16 11:35:10,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:35:10,810 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:35:10,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:10,811 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 3 times [2022-11-16 11:35:10,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:10,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690603456] [2022-11-16 11:35:10,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:10,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:10,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:35:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:10,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:35:10,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:10,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 11:35:10,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:35:10,882 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-11-16 11:35:11,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:11,056 INFO L93 Difference]: Finished difference Result 158 states and 204 transitions. [2022-11-16 11:35:11,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 204 transitions. [2022-11-16 11:35:11,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-16 11:35:11,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 146 states and 180 transitions. [2022-11-16 11:35:11,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2022-11-16 11:35:11,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2022-11-16 11:35:11,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 180 transitions. [2022-11-16 11:35:11,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:35:11,061 INFO L218 hiAutomatonCegarLoop]: Abstraction has 146 states and 180 transitions. [2022-11-16 11:35:11,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 180 transitions. [2022-11-16 11:35:11,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 94. [2022-11-16 11:35:11,067 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-11-16 11:35:11,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2022-11-16 11:35:11,068 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 118 transitions. [2022-11-16 11:35:11,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:35:11,069 INFO L428 stractBuchiCegarLoop]: Abstraction has 94 states and 118 transitions. [2022-11-16 11:35:11,070 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-16 11:35:11,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 118 transitions. [2022-11-16 11:35:11,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-16 11:35:11,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:35:11,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:35:11,072 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1, 1, 1] [2022-11-16 11:35:11,072 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-16 11:35:11,072 INFO L748 eck$LassoCheckResult]: Stem: 782#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 783#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; 786#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 787#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 793#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 789#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 790#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 867#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 865#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 863#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 862#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 861#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 852#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 849#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 847#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 845#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 844#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 843#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 834#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 831#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 829#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 827#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 826#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 825#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 816#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 813#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 811#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 809#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 802#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); 801#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 791#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 792#L20-3 assume !(main_~i~0#1 < 100000); 797#L20-4 main_~i~0#1 := 0; 785#L26-3 [2022-11-16 11:35:11,073 INFO L750 eck$LassoCheckResult]: Loop: 785#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); 794#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 784#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 785#L26-3 [2022-11-16 11:35:11,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:11,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1205177520, now seen corresponding path program 3 times [2022-11-16 11:35:11,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:11,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166493958] [2022-11-16 11:35:11,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:11,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:35:11,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:11,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166493958] [2022-11-16 11:35:11,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166493958] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:11,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263181038] [2022-11-16 11:35:11,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:35:11,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:11,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:11,376 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:35:11,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-16 11:35:11,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-11-16 11:35:11,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:35:11,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 11:35:11,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:11,662 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:35:11,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:35:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:35:11,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263181038] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:35:11,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:35:11,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-11-16 11:35:11,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236322112] [2022-11-16 11:35:11,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:35:11,933 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:35:11,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:11,934 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 4 times [2022-11-16 11:35:11,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:11,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711573745] [2022-11-16 11:35:11,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:11,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:11,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:35:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:11,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:35:11,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:11,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 11:35:11,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-11-16 11:35:11,995 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-11-16 11:35:12,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:12,351 INFO L93 Difference]: Finished difference Result 338 states and 432 transitions. [2022-11-16 11:35:12,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 432 transitions. [2022-11-16 11:35:12,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-16 11:35:12,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 314 states and 384 transitions. [2022-11-16 11:35:12,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2022-11-16 11:35:12,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2022-11-16 11:35:12,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 314 states and 384 transitions. [2022-11-16 11:35:12,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:35:12,358 INFO L218 hiAutomatonCegarLoop]: Abstraction has 314 states and 384 transitions. [2022-11-16 11:35:12,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states and 384 transitions. [2022-11-16 11:35:12,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 202. [2022-11-16 11:35:12,367 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-11-16 11:35:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 250 transitions. [2022-11-16 11:35:12,369 INFO L240 hiAutomatonCegarLoop]: Abstraction has 202 states and 250 transitions. [2022-11-16 11:35:12,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 11:35:12,370 INFO L428 stractBuchiCegarLoop]: Abstraction has 202 states and 250 transitions. [2022-11-16 11:35:12,370 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-16 11:35:12,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 202 states and 250 transitions. [2022-11-16 11:35:12,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-16 11:35:12,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:35:12,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:35:12,373 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 22, 1, 1, 1, 1] [2022-11-16 11:35:12,374 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-16 11:35:12,374 INFO L748 eck$LassoCheckResult]: Stem: 1438#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 1439#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; 1444#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1445#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1639#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1447#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1448#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1455#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1637#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1629#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1626#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1624#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1622#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1621#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1620#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1611#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1608#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1606#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#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; 1603#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1602#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1593#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1590#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1588#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1586#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1585#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1584#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1573#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1571#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1569#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1567#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1563#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1561#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1559#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1558#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1557#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1548#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1545#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1543#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1541#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1540#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1539#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1530#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1527#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1525#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1523#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1522#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1521#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1512#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1509#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1507#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1505#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1504#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1503#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1494#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1491#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1489#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1487#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1486#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1485#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1476#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1473#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1471#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1469#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1462#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); 1461#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1449#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1450#L20-3 assume !(main_~i~0#1 < 100000); 1457#L20-4 main_~i~0#1 := 0; 1443#L26-3 [2022-11-16 11:35:12,375 INFO L750 eck$LassoCheckResult]: Loop: 1443#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); 1453#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 1442#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 1443#L26-3 [2022-11-16 11:35:12,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:12,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1121042640, now seen corresponding path program 4 times [2022-11-16 11:35:12,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:12,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029884166] [2022-11-16 11:35:12,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:12,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:35:13,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:13,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029884166] [2022-11-16 11:35:13,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029884166] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:13,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824697073] [2022-11-16 11:35:13,234 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:35:13,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:13,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:13,238 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:35:13,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-16 11:35:13,375 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:35:13,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:35:13,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 11:35:13,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:35:13,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:35:14,506 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:35:14,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824697073] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:35:14,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:35:14,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-11-16 11:35:14,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635262916] [2022-11-16 11:35:14,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:35:14,508 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:35:14,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:14,508 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 5 times [2022-11-16 11:35:14,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:14,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950210667] [2022-11-16 11:35:14,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:14,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:14,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:35:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:35:14,516 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:35:14,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:14,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-16 11:35:14,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-11-16 11:35:14,565 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-11-16 11:35:15,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:15,354 INFO L93 Difference]: Finished difference Result 698 states and 888 transitions. [2022-11-16 11:35:15,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 698 states and 888 transitions. [2022-11-16 11:35:15,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-16 11:35:15,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 698 states to 650 states and 792 transitions. [2022-11-16 11:35:15,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 283 [2022-11-16 11:35:15,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2022-11-16 11:35:15,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 650 states and 792 transitions. [2022-11-16 11:35:15,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:35:15,365 INFO L218 hiAutomatonCegarLoop]: Abstraction has 650 states and 792 transitions. [2022-11-16 11:35:15,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states and 792 transitions. [2022-11-16 11:35:15,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 418. [2022-11-16 11:35:15,377 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-11-16 11:35:15,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 514 transitions. [2022-11-16 11:35:15,379 INFO L240 hiAutomatonCegarLoop]: Abstraction has 418 states and 514 transitions. [2022-11-16 11:35:15,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-16 11:35:15,380 INFO L428 stractBuchiCegarLoop]: Abstraction has 418 states and 514 transitions. [2022-11-16 11:35:15,380 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-16 11:35:15,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 418 states and 514 transitions. [2022-11-16 11:35:15,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-16 11:35:15,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:35:15,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:35:15,387 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 46, 1, 1, 1, 1] [2022-11-16 11:35:15,387 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-16 11:35:15,388 INFO L748 eck$LassoCheckResult]: Stem: 2804#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 2805#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; 2810#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2811#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2817#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2813#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2814#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3215#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3213#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3211#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3210#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3209#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3200#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3197#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3195#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3193#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3192#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3191#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3182#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3179#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3177#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3175#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3174#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3173#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3164#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3161#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3159#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3157#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3156#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3155#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3146#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3143#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3141#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3138#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3136#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3133#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3131#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3129#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3128#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3119#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3116#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3114#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3112#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3111#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3110#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3101#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3098#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3096#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3094#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3093#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3092#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3083#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3080#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3078#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3076#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3075#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3074#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3065#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3062#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3060#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3058#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3057#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3056#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3047#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3044#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3042#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3040#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3039#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3038#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3027#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3025#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3023#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3021#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3017#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3015#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3013#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3012#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3011#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3002#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2999#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2997#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2995#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2994#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2993#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2984#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2981#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2979#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2977#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2976#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2975#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2966#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2963#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2961#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2959#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2958#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2957#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2948#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2945#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2943#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2941#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2940#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2939#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2930#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2927#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2925#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2923#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2922#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2921#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2910#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2908#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2906#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2904#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2900#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2898#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2896#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2895#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2894#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2883#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2881#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2879#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2877#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2873#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2871#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2869#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2868#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2867#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2858#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2855#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2853#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2851#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2850#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2849#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2840#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2837#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2835#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2833#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2826#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2830#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#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; 2815#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2816#L20-3 assume !(main_~i~0#1 < 100000); 2821#L20-4 main_~i~0#1 := 0; 2809#L26-3 [2022-11-16 11:35:15,388 INFO L750 eck$LassoCheckResult]: Loop: 2809#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); 2818#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 2808#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 2809#L26-3 [2022-11-16 11:35:15,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:15,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1788222416, now seen corresponding path program 5 times [2022-11-16 11:35:15,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:15,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505189914] [2022-11-16 11:35:15,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:15,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:35:17,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:17,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505189914] [2022-11-16 11:35:17,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505189914] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:17,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736931949] [2022-11-16 11:35:17,973 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:35:17,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:17,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:17,977 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:35:18,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-16 11:35:56,654 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-11-16 11:35:56,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:35:56,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 11:35:56,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:35:56,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:36:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:36:00,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736931949] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:36:00,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:36:00,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2022-11-16 11:36:00,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097708867] [2022-11-16 11:36:00,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:36:00,436 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:36:00,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:00,437 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 6 times [2022-11-16 11:36:00,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:00,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943567272] [2022-11-16 11:36:00,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:00,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:36:00,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:36:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:36:00,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:36:00,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:00,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-11-16 11:36:00,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-11-16 11:36:00,491 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-11-16 11:36:03,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:03,662 INFO L93 Difference]: Finished difference Result 1418 states and 1800 transitions. [2022-11-16 11:36:03,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1418 states and 1800 transitions. [2022-11-16 11:36:03,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-16 11:36:03,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1418 states to 1322 states and 1608 transitions. [2022-11-16 11:36:03,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 571 [2022-11-16 11:36:03,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 571 [2022-11-16 11:36:03,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1322 states and 1608 transitions. [2022-11-16 11:36:03,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:36:03,681 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1322 states and 1608 transitions. [2022-11-16 11:36:03,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states and 1608 transitions. [2022-11-16 11:36:03,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 850. [2022-11-16 11:36:03,696 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-11-16 11:36:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1042 transitions. [2022-11-16 11:36:03,698 INFO L240 hiAutomatonCegarLoop]: Abstraction has 850 states and 1042 transitions. [2022-11-16 11:36:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-16 11:36:03,699 INFO L428 stractBuchiCegarLoop]: Abstraction has 850 states and 1042 transitions. [2022-11-16 11:36:03,699 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-16 11:36:03,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 850 states and 1042 transitions. [2022-11-16 11:36:03,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-16 11:36:03,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:36:03,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:36:03,711 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 94, 1, 1, 1, 1] [2022-11-16 11:36:03,711 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-16 11:36:03,712 INFO L748 eck$LassoCheckResult]: Stem: 5586#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 5587#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; 5592#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5593#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5602#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6432#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6428#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6425#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6422#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6419#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6416#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6414#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6411#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6408#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); 6402#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6398#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6395#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6392#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6389#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6386#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6383#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6380#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6377#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6374#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6371#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6368#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6365#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6362#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6359#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6356#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6353#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6350#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6347#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6344#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6341#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6338#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6335#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6333#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6330#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6327#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); 6321#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6317#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6314#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6311#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6308#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6305#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6302#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6299#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6296#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6293#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6290#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6287#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6284#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6281#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6278#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6275#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6272#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6269#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6266#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6263#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6260#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6257#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6254#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6251#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6248#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6245#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6242#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6239#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6236#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6233#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6230#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6227#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6224#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6221#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6218#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6215#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6212#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6209#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6206#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6203#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6200#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6197#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6194#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6191#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6189#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6186#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6183#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6180#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6177#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6173#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6170#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6167#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6164#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6161#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6158#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6155#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6152#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6149#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6146#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6143#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6140#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6137#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6134#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6131#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6128#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6125#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6122#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6119#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6116#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6113#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6110#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6107#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6104#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6101#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6098#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6095#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6092#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6089#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6086#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6083#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6080#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6077#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6074#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6071#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6068#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6065#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6062#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6059#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6056#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6053#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6050#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6047#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6045#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6042#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6039#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); 6033#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6029#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6026#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6023#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6020#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6017#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6014#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6011#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6008#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6005#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6002#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5999#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5996#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5993#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5990#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5987#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5984#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5981#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5978#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5975#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5972#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5969#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5966#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5963#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5960#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5957#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5954#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5951#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5948#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5945#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5942#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5939#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5936#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5933#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5930#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5928#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5925#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5922#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); 5916#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5912#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5909#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5906#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5903#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5901#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5898#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5895#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); 5889#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5885#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5882#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5879#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5877#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5876#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5874#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5873#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5872#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5870#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5869#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5868#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5866#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5865#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5864#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5862#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5861#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); 5854#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5853#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5852#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5850#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5849#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5848#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5846#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5845#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5844#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5842#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5841#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5840#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5838#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5837#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5836#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5834#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5833#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5832#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5831#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5827#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5825#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5821#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5818#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5816#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5812#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5809#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5807#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#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; 5800#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5798#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5788#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5785#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5783#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5773#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5770#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5768#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#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; 5755#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); 5743#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5740#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5738#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5728#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5725#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5723#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5713#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5711#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5709#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5700#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5698#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5696#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5687#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5685#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5683#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5674#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5672#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5670#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5663#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5660#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); 5651#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5649#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5646#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5635#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5633#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5632#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5630#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5626#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5623#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5619#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5617#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5615#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5613#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; 5597#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5598#L20-3 assume !(main_~i~0#1 < 100000); 5605#L20-4 main_~i~0#1 := 0; 5591#L26-3 [2022-11-16 11:36:03,712 INFO L750 eck$LassoCheckResult]: Loop: 5591#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); 5601#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 5590#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 5591#L26-3 [2022-11-16 11:36:03,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:03,713 INFO L85 PathProgramCache]: Analyzing trace with hash 712364496, now seen corresponding path program 6 times [2022-11-16 11:36:03,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:03,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787794499] [2022-11-16 11:36:03,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:03,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:12,150 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:36:12,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:12,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787794499] [2022-11-16 11:36:12,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787794499] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:36:12,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578666932] [2022-11-16 11:36:12,151 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 11:36:12,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:36:12,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:36:12,154 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:36:12,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9df35c75-fba2-461b-90ec-727f37ec04f8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process