./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_monotonic.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc --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-5e519f3 [2022-11-02 20:21:38,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:21:38,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:21:38,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:21:38,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:21:38,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:21:38,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:21:38,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:21:38,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:21:38,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:21:38,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:21:38,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:21:38,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:21:38,906 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:21:38,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:21:38,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:21:38,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:21:38,911 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:21:38,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:21:38,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:21:38,917 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:21:38,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:21:38,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:21:38,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:21:38,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:21:38,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:21:38,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:21:38,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:21:38,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:21:38,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:21:38,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:21:38,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:21:38,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:21:38,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:21:38,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:21:38,958 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:21:38,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:21:38,959 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:21:38,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:21:38,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:21:38,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:21:38,964 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-02 20:21:38,989 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:21:38,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:21:38,990 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:21:38,990 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:21:38,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:21:38,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:21:38,992 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:21:38,992 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-02 20:21:38,992 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-02 20:21:38,992 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-02 20:21:38,993 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-02 20:21:38,993 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-02 20:21:38,993 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-02 20:21:38,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:21:38,994 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:21:38,994 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:21:38,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:21:38,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:21:38,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:21:38,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-02 20:21:38,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-02 20:21:38,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-02 20:21:38,996 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:21:38,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:21:38,996 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-02 20:21:38,997 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:21:38,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-02 20:21:38,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:21:38,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:21:38,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:21:38,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:21:38,999 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-02 20:21:39,000 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_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/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_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc 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-02 20:21:39,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:21:39,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:21:39,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:21:39,378 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:21:39,379 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:21:39,380 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2022-11-02 20:21:39,510 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/data/f4bb85871/a8a249ead78c4d719367d5fe9c0082db/FLAGd838be1bc [2022-11-02 20:21:40,010 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:21:40,011 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2022-11-02 20:21:40,018 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/data/f4bb85871/a8a249ead78c4d719367d5fe9c0082db/FLAGd838be1bc [2022-11-02 20:21:40,378 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/data/f4bb85871/a8a249ead78c4d719367d5fe9c0082db [2022-11-02 20:21:40,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:21:40,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:21:40,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:21:40,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:21:40,399 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:21:40,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:21:40" (1/1) ... [2022-11-02 20:21:40,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ddb206b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:40, skipping insertion in model container [2022-11-02 20:21:40,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:21:40" (1/1) ... [2022-11-02 20:21:40,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:21:40,428 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:21:40,711 WARN L230 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_6a6bc551-71f7-40f6-ad4c-3064bba12e21/sv-benchmarks/c/array-industry-pattern/array_monotonic.i[808,821] [2022-11-02 20:21:40,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:21:40,749 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:21:40,766 WARN L230 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_6a6bc551-71f7-40f6-ad4c-3064bba12e21/sv-benchmarks/c/array-industry-pattern/array_monotonic.i[808,821] [2022-11-02 20:21:40,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:21:40,803 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:21:40,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:40 WrapperNode [2022-11-02 20:21:40,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:21:40,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:21:40,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:21:40,807 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:21:40,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:40" (1/1) ... [2022-11-02 20:21:40,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:40" (1/1) ... [2022-11-02 20:21:40,858 INFO L138 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2022-11-02 20:21:40,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:21:40,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:21:40,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:21:40,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:21:40,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:40" (1/1) ... [2022-11-02 20:21:40,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:40" (1/1) ... [2022-11-02 20:21:40,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:40" (1/1) ... [2022-11-02 20:21:40,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:40" (1/1) ... [2022-11-02 20:21:40,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:40" (1/1) ... [2022-11-02 20:21:40,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:40" (1/1) ... [2022-11-02 20:21:40,911 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:40" (1/1) ... [2022-11-02 20:21:40,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:40" (1/1) ... [2022-11-02 20:21:40,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:21:40,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:21:40,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:21:40,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:21:40,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:40" (1/1) ... [2022-11-02 20:21:40,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:21:40,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:40,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:21:40,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-02 20:21:41,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:21:41,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:21:41,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:21:41,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:21:41,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:21:41,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:21:41,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:21:41,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:21:41,111 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:21:41,113 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:21:41,260 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:21:41,279 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:21:41,279 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:21:41,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:21:41 BoogieIcfgContainer [2022-11-02 20:21:41,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:21:41,283 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-02 20:21:41,283 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-02 20:21:41,287 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-02 20:21:41,288 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:21:41,289 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.11 08:21:40" (1/3) ... [2022-11-02 20:21:41,290 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f8bd3aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 08:21:41, skipping insertion in model container [2022-11-02 20:21:41,290 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:21:41,290 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:40" (2/3) ... [2022-11-02 20:21:41,291 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f8bd3aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 08:21:41, skipping insertion in model container [2022-11-02 20:21:41,291 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:21:41,291 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:21:41" (3/3) ... [2022-11-02 20:21:41,293 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_monotonic.i [2022-11-02 20:21:41,368 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-02 20:21:41,368 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-02 20:21:41,368 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-02 20:21:41,368 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-02 20:21:41,369 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-02 20:21:41,369 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-02 20:21:41,369 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-02 20:21:41,369 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-02 20:21:41,375 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-02 20:21:41,398 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-11-02 20:21:41,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:21:41,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:21:41,405 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:21:41,406 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:21:41,406 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-02 20:21:41,406 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-02 20:21:41,408 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-11-02 20:21:41,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:21:41,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:21:41,409 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:21:41,409 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:21:41,420 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-02 20:21:41,420 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-02 20:21:41,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:41,442 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-02 20:21:41,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:41,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633892507] [2022-11-02 20:21:41,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:41,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:21:41,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:21:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:21:41,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:21:41,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:41,666 INFO L85 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2022-11-02 20:21:41,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:41,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254235337] [2022-11-02 20:21:41,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:41,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:21:41,723 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:21:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:21:41,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:21:41,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:41,765 INFO L85 PathProgramCache]: Analyzing trace with hash 28698763, now seen corresponding path program 1 times [2022-11-02 20:21:41,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:41,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767512161] [2022-11-02 20:21:41,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:41,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:21:41,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:21:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:21:41,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:21:42,591 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:21:42,592 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:21:42,593 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:21:42,593 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:21:42,593 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:21:42,594 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:21:42,594 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:21:42,594 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:21:42,595 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration1_Lasso [2022-11-02 20:21:42,595 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:21:42,596 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:21:42,626 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-02 20:21:42,642 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-02 20:21:42,649 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-02 20:21:42,657 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-02 20:21:42,661 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-02 20:21:42,667 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-02 20:21:43,180 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-02 20:21:43,619 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:21:43,627 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:21:43,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:21:43,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:43,634 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:21:43,653 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-02 20:21:43,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-02 20:21:43,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:21:43,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:21:43,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:21:43,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:21:43,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:21:43,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:21:43,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:21:43,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:21:43,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:43,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:21:43,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:43,723 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:21:43,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:21:43,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-02 20:21:43,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:21:43,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:21:43,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:21:43,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:21:43,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:21:43,774 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:21:43,802 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:21:43,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:43,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:21:43,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:43,857 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:21:43,863 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-02 20:21:43,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-02 20:21:43,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:21:43,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:21:43,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:21:43,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:21:43,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:21:43,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:21:43,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:21:43,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:43,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:21:43,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:43,949 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:21:43,955 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-02 20:21:43,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-02 20:21:43,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:21:43,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:21:43,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:21:43,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:21:43,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:21:43,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:21:43,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:21:43,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:21:44,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:44,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:21:44,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:44,051 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:21:44,056 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-02 20:21:44,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-02 20:21:44,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:21:44,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:21:44,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:21:44,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:21:44,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:21:44,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:21:44,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:21:44,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:21:44,129 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:44,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:21:44,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:44,131 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:21:44,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-02 20:21:44,136 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-02 20:21:44,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:21:44,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:21:44,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:21:44,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:21:44,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:21:44,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:21:44,186 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:21:44,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:44,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:21:44,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:44,235 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:21:44,243 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-02 20:21:44,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-02 20:21:44,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:21:44,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:21:44,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:21:44,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:21:44,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:21:44,285 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:21:44,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:21:44,302 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:21:44,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:44,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:21:44,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:44,352 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:21:44,360 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-02 20:21:44,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-02 20:21:44,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:21:44,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:21:44,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:21:44,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:21:44,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:21:44,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:21:44,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:21:44,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:21:44,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:44,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:21:44,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:44,423 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:21:44,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-02 20:21:44,426 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-02 20:21:44,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:21:44,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:21:44,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:21:44,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:21:44,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:21:44,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:21:44,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:21:44,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:44,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:21:44,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:44,513 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:21:44,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-02 20:21:44,519 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-02 20:21:44,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:21:44,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:21:44,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:21:44,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:21:44,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:21:44,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:21:44,562 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:21:44,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:44,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:21:44,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:44,609 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:21:44,620 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-02 20:21:44,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-02 20:21:44,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:21:44,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:21:44,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:21:44,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:21:44,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:21:44,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:21:44,698 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:21:44,783 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2022-11-02 20:21:44,783 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2022-11-02 20:21:44,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:21:44,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:44,788 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:21:44,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-02 20:21:44,815 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:21:44,851 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-02 20:21:44,852 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:21:44,852 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 + 25000*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2022-11-02 20:21:44,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:44,966 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-11-02 20:21:44,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:45,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:21:45,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:45,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:21:45,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:45,144 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-02 20:21:45,211 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-02 20:21:45,213 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 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-02 20:21:45,287 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 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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 31 states and 45 transitions. Complement of second has 8 states. [2022-11-02 20:21:45,290 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-02 20:21:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-02 20:21:45,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-11-02 20:21:45,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 3 letters. [2022-11-02 20:21:45,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:21:45,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 5 letters. Loop has 3 letters. [2022-11-02 20:21:45,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:21:45,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 6 letters. [2022-11-02 20:21:45,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:21:45,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. [2022-11-02 20:21:45,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-02 20:21:45,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 13 states and 18 transitions. [2022-11-02 20:21:45,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-11-02 20:21:45,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-11-02 20:21:45,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2022-11-02 20:21:45,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:21:45,332 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-11-02 20:21:45,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2022-11-02 20:21:45,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-11-02 20:21:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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-02 20:21:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2022-11-02 20:21:45,366 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-11-02 20:21:45,367 INFO L428 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-11-02 20:21:45,367 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-02 20:21:45,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-11-02 20:21:45,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-02 20:21:45,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:21:45,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:21:45,371 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-02 20:21:45,371 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:21:45,371 INFO L748 eck$LassoCheckResult]: Stem: 135#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); 136#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; 140#L20-3 assume !(main_~i~0#1 < 100000); 141#L20-4 main_~i~0#1 := 0; 139#L26-3 [2022-11-02 20:21:45,372 INFO L750 eck$LassoCheckResult]: Loop: 139#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); 145#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 138#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 139#L26-3 [2022-11-02 20:21:45,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:45,377 INFO L85 PathProgramCache]: Analyzing trace with hash 925712, now seen corresponding path program 1 times [2022-11-02 20:21:45,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:45,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299922357] [2022-11-02 20:21:45,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:45,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:45,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:45,493 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-02 20:21:45,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:45,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299922357] [2022-11-02 20:21:45,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299922357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:45,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:45,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:21:45,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085583137] [2022-11-02 20:21:45,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:45,499 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:21:45,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:45,502 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 1 times [2022-11-02 20:21:45,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:45,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548864893] [2022-11-02 20:21:45,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:45,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:21:45,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:21:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:21:45,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:21:45,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:45,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:21:45,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:21:45,589 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 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-02 20:21:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:45,630 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-11-02 20:21:45,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2022-11-02 20:21:45,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-02 20:21:45,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 24 transitions. [2022-11-02 20:21:45,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-11-02 20:21:45,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-11-02 20:21:45,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2022-11-02 20:21:45,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:21:45,640 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-11-02 20:21:45,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2022-11-02 20:21:45,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 12. [2022-11-02 20:21:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2022-11-02 20:21:45,647 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-11-02 20:21:45,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:21:45,648 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-11-02 20:21:45,649 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-02 20:21:45,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2022-11-02 20:21:45,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-02 20:21:45,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:21:45,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:21:45,652 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:45,652 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:21:45,652 INFO L748 eck$LassoCheckResult]: Stem: 175#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); 176#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; 181#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 182#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 179#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 180#L20-3 assume !(main_~i~0#1 < 100000); 183#L20-4 main_~i~0#1 := 0; 178#L26-3 [2022-11-02 20:21:45,653 INFO L750 eck$LassoCheckResult]: Loop: 178#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); 184#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 177#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 178#L26-3 [2022-11-02 20:21:45,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:45,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1809767318, now seen corresponding path program 1 times [2022-11-02 20:21:45,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:45,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518242760] [2022-11-02 20:21:45,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:45,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:45,812 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-02 20:21:45,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:45,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518242760] [2022-11-02 20:21:45,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518242760] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:45,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133041127] [2022-11-02 20:21:45,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:45,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:45,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:45,820 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:21:45,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 20:21:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:45,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:21:45,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:45,905 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-02 20:21:45,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:21:45,941 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-02 20:21:45,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133041127] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:21:45,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:21:45,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-02 20:21:45,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814057375] [2022-11-02 20:21:45,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:21:45,942 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:21:45,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:45,943 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 2 times [2022-11-02 20:21:45,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:45,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188202944] [2022-11-02 20:21:45,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:45,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:21:45,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:21:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:21:45,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:21:46,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:46,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:21:46,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:21:46,011 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.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-02 20:21:46,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:46,094 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-11-02 20:21:46,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2022-11-02 20:21:46,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-02 20:21:46,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 46 transitions. [2022-11-02 20:21:46,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-11-02 20:21:46,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-11-02 20:21:46,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2022-11-02 20:21:46,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:21:46,100 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-11-02 20:21:46,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2022-11-02 20:21:46,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 21. [2022-11-02 20:21:46,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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-02 20:21:46,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-11-02 20:21:46,107 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-11-02 20:21:46,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:21:46,110 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-11-02 20:21:46,110 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-02 20:21:46,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2022-11-02 20:21:46,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-02 20:21:46,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:21:46,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:21:46,115 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1, 1, 1] [2022-11-02 20:21:46,115 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:21:46,115 INFO L748 eck$LassoCheckResult]: Stem: 270#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); 271#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; 274#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 275#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 281#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 276#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 277#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 278#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 279#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 288#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 287#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 286#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 284#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 285#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 283#L20-3 assume !(main_~i~0#1 < 100000); 282#L20-4 main_~i~0#1 := 0; 273#L26-3 [2022-11-02 20:21:46,116 INFO L750 eck$LassoCheckResult]: Loop: 273#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); 280#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 272#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 273#L26-3 [2022-11-02 20:21:46,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:46,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1825864560, now seen corresponding path program 2 times [2022-11-02 20:21:46,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:46,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248495062] [2022-11-02 20:21:46,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:46,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:46,257 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-02 20:21:46,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:46,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248495062] [2022-11-02 20:21:46,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248495062] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:46,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610414784] [2022-11-02 20:21:46,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:21:46,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:46,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:46,260 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:21:46,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 20:21:46,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:21:46,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:21:46,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:21:46,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:46,396 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-02 20:21:46,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:21:46,497 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-02 20:21:46,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610414784] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:21:46,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:21:46,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-02 20:21:46,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924734224] [2022-11-02 20:21:46,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:21:46,500 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:21:46,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:46,500 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 3 times [2022-11-02 20:21:46,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:46,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379956026] [2022-11-02 20:21:46,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:46,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:21:46,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:21:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:21:46,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:21:46,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:46,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:21:46,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:21:46,595 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 8 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-02 20:21:46,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:46,821 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2022-11-02 20:21:46,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 106 transitions. [2022-11-02 20:21:46,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-02 20:21:46,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 106 transitions. [2022-11-02 20:21:46,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2022-11-02 20:21:46,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2022-11-02 20:21:46,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 106 transitions. [2022-11-02 20:21:46,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:21:46,838 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 106 transitions. [2022-11-02 20:21:46,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 106 transitions. [2022-11-02 20:21:46,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 39. [2022-11-02 20:21:46,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-11-02 20:21:46,845 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-11-02 20:21:46,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:21:46,846 INFO L428 stractBuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-11-02 20:21:46,846 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-02 20:21:46,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2022-11-02 20:21:46,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-02 20:21:46,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:21:46,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:21:46,852 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1, 1, 1] [2022-11-02 20:21:46,853 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:21:46,853 INFO L748 eck$LassoCheckResult]: Stem: 480#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); 481#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; 486#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 487#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 518#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 488#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 489#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 490#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 491#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 517#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 516#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 515#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 514#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 513#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 512#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 511#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 510#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 509#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 508#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 507#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 506#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#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; 504#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 503#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 502#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 501#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 500#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 499#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 498#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 497#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 495#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 496#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 494#L20-3 assume !(main_~i~0#1 < 100000); 493#L20-4 main_~i~0#1 := 0; 485#L26-3 [2022-11-02 20:21:46,854 INFO L750 eck$LassoCheckResult]: Loop: 485#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); 492#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 484#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 485#L26-3 [2022-11-02 20:21:46,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:46,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1205177520, now seen corresponding path program 3 times [2022-11-02 20:21:46,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:46,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103111417] [2022-11-02 20:21:46,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:46,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:47,231 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-02 20:21:47,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:47,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103111417] [2022-11-02 20:21:47,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103111417] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:47,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255224487] [2022-11-02 20:21:47,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:21:47,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:47,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:47,240 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:21:47,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 20:21:47,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-11-02 20:21:47,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:21:47,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 20:21:47,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:47,587 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-02 20:21:47,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:21:47,901 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-02 20:21:47,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255224487] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:21:47,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:21:47,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-11-02 20:21:47,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701786420] [2022-11-02 20:21:47,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:21:47,903 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:21:47,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:47,903 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 4 times [2022-11-02 20:21:47,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:47,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174091898] [2022-11-02 20:21:47,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:47,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:21:47,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:21:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:21:47,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:21:47,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:47,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 20:21:47,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-11-02 20:21:47,966 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. cyclomatic complexity: 14 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-02 20:21:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:48,372 INFO L93 Difference]: Finished difference Result 181 states and 226 transitions. [2022-11-02 20:21:48,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 226 transitions. [2022-11-02 20:21:48,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-02 20:21:48,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 181 states and 226 transitions. [2022-11-02 20:21:48,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2022-11-02 20:21:48,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2022-11-02 20:21:48,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 226 transitions. [2022-11-02 20:21:48,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:21:48,392 INFO L218 hiAutomatonCegarLoop]: Abstraction has 181 states and 226 transitions. [2022-11-02 20:21:48,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 226 transitions. [2022-11-02 20:21:48,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 75. [2022-11-02 20:21:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.32) internal successors, (99), 74 states have internal predecessors, (99), 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-02 20:21:48,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2022-11-02 20:21:48,403 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 99 transitions. [2022-11-02 20:21:48,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:21:48,404 INFO L428 stractBuchiCegarLoop]: Abstraction has 75 states and 99 transitions. [2022-11-02 20:21:48,404 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-02 20:21:48,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 99 transitions. [2022-11-02 20:21:48,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-02 20:21:48,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:21:48,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:21:48,407 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 22, 1, 1, 1, 1] [2022-11-02 20:21:48,407 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:21:48,408 INFO L748 eck$LassoCheckResult]: Stem: 928#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); 929#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; 932#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 933#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1000#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 934#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 935#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 936#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 937#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 999#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 998#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 997#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 996#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 995#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 994#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 993#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 992#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 991#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 990#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 989#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 988#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 987#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 986#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 985#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 984#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 983#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 982#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 981#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 980#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 979#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 978#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 977#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 976#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 975#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 974#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 973#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 972#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 971#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 970#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 969#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 968#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 967#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 966#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 965#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 964#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 963#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 962#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 961#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 960#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 959#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 958#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 957#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 956#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 955#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 954#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 953#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 952#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 951#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 950#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 949#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 948#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 947#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 946#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 945#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 944#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 943#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 941#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 942#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 940#L20-3 assume !(main_~i~0#1 < 100000); 939#L20-4 main_~i~0#1 := 0; 931#L26-3 [2022-11-02 20:21:48,408 INFO L750 eck$LassoCheckResult]: Loop: 931#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); 938#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 930#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 931#L26-3 [2022-11-02 20:21:48,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:48,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1121042640, now seen corresponding path program 4 times [2022-11-02 20:21:48,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:48,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352064535] [2022-11-02 20:21:48,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:48,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:49,501 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-02 20:21:49,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:49,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352064535] [2022-11-02 20:21:49,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352064535] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:49,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960528123] [2022-11-02 20:21:49,502 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:21:49,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:49,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:49,508 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:21:49,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-02 20:21:49,671 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:21:49,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:21:49,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-02 20:21:49,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:49,847 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-02 20:21:49,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:21:50,998 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-02 20:21:50,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960528123] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:21:50,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:21:50,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-11-02 20:21:50,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431763811] [2022-11-02 20:21:50,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:21:51,000 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:21:51,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:51,000 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 5 times [2022-11-02 20:21:51,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:51,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727800225] [2022-11-02 20:21:51,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:51,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:21:51,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:21:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:21:51,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:21:51,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:51,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-02 20:21:51,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-11-02 20:21:51,068 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. cyclomatic complexity: 26 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-02 20:21:52,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:52,091 INFO L93 Difference]: Finished difference Result 373 states and 466 transitions. [2022-11-02 20:21:52,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 373 states and 466 transitions. [2022-11-02 20:21:52,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-02 20:21:52,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 373 states to 373 states and 466 transitions. [2022-11-02 20:21:52,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2022-11-02 20:21:52,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 235 [2022-11-02 20:21:52,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 373 states and 466 transitions. [2022-11-02 20:21:52,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:21:52,103 INFO L218 hiAutomatonCegarLoop]: Abstraction has 373 states and 466 transitions. [2022-11-02 20:21:52,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states and 466 transitions. [2022-11-02 20:21:52,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 147. [2022-11-02 20:21:52,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 146 states have internal predecessors, (195), 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-02 20:21:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 195 transitions. [2022-11-02 20:21:52,117 INFO L240 hiAutomatonCegarLoop]: Abstraction has 147 states and 195 transitions. [2022-11-02 20:21:52,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-02 20:21:52,119 INFO L428 stractBuchiCegarLoop]: Abstraction has 147 states and 195 transitions. [2022-11-02 20:21:52,119 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-02 20:21:52,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 195 transitions. [2022-11-02 20:21:52,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-02 20:21:52,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:21:52,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:21:52,126 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 46, 1, 1, 1, 1] [2022-11-02 20:21:52,126 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:21:52,127 INFO L748 eck$LassoCheckResult]: Stem: 1842#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); 1843#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; 1848#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1849#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1846#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1847#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1850#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1852#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1986#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1985#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1984#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1983#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1982#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1981#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1980#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1979#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1978#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1977#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1976#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1975#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1974#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1973#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1972#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1971#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1970#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1969#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1968#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1967#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1966#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1965#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1964#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1963#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1962#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1961#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1960#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1959#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1958#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1957#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1956#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1955#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1954#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1953#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1952#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1951#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1950#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1949#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1948#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1947#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1946#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1945#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1944#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1943#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1942#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1941#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1940#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1939#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1938#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1937#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1936#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1935#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1934#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1933#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1932#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1931#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1930#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1929#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1928#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1927#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1926#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1925#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1924#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1923#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1922#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1921#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1920#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1919#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1918#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1917#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1916#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1915#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1914#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1913#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1912#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1911#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1910#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1909#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1908#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1907#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1906#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1905#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1904#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1903#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1902#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1901#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1900#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1899#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1898#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1897#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1896#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1895#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1894#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1893#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1892#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1891#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1890#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1889#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1888#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1887#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1886#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1885#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1884#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1883#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1882#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1881#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1880#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1879#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1878#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1877#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1876#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1875#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1874#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1873#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1872#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1871#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1870#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1869#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1868#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1867#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1866#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1865#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1864#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1863#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1862#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1861#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1860#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1859#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1858#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1857#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1855#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1856#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1854#L20-3 assume !(main_~i~0#1 < 100000); 1853#L20-4 main_~i~0#1 := 0; 1845#L26-3 [2022-11-02 20:21:52,127 INFO L750 eck$LassoCheckResult]: Loop: 1845#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); 1851#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 1844#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 1845#L26-3 [2022-11-02 20:21:52,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:52,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1788222416, now seen corresponding path program 5 times [2022-11-02 20:21:52,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:52,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361066101] [2022-11-02 20:21:52,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:52,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:55,337 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-02 20:21:55,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:55,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361066101] [2022-11-02 20:21:55,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361066101] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:55,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342470202] [2022-11-02 20:21:55,338 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 20:21:55,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:55,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:55,344 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:21:55,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-02 20:22:51,587 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-11-02 20:22:51,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:22:51,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-02 20:22:51,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:22:51,991 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-02 20:22:51,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:22:55,925 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-02 20:22:55,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342470202] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:22:55,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:22:55,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2022-11-02 20:22:55,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984326597] [2022-11-02 20:22:55,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:22:55,929 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:22:55,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:55,930 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 6 times [2022-11-02 20:22:55,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:55,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574907274] [2022-11-02 20:22:55,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:55,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:22:55,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:22:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:22:55,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:22:55,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:55,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-11-02 20:22:56,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-11-02 20:22:56,002 INFO L87 Difference]: Start difference. First operand 147 states and 195 transitions. cyclomatic complexity: 50 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-02 20:23:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:00,459 INFO L93 Difference]: Finished difference Result 757 states and 946 transitions. [2022-11-02 20:23:00,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 757 states and 946 transitions. [2022-11-02 20:23:00,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-02 20:23:00,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 757 states to 757 states and 946 transitions. [2022-11-02 20:23:00,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 475 [2022-11-02 20:23:00,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 475 [2022-11-02 20:23:00,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 757 states and 946 transitions. [2022-11-02 20:23:00,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:23:00,476 INFO L218 hiAutomatonCegarLoop]: Abstraction has 757 states and 946 transitions. [2022-11-02 20:23:00,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states and 946 transitions. [2022-11-02 20:23:00,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 291. [2022-11-02 20:23:00,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 291 states have (on average 1.3298969072164948) internal successors, (387), 290 states have internal predecessors, (387), 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-02 20:23:00,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 387 transitions. [2022-11-02 20:23:00,498 INFO L240 hiAutomatonCegarLoop]: Abstraction has 291 states and 387 transitions. [2022-11-02 20:23:00,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-02 20:23:00,499 INFO L428 stractBuchiCegarLoop]: Abstraction has 291 states and 387 transitions. [2022-11-02 20:23:00,500 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-02 20:23:00,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 291 states and 387 transitions. [2022-11-02 20:23:00,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-02 20:23:00,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:23:00,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:23:00,517 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 94, 1, 1, 1, 1] [2022-11-02 20:23:00,517 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:23:00,518 INFO L748 eck$LassoCheckResult]: Stem: 3692#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); 3693#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; 3698#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3699#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3696#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3697#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3700#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3702#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3980#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3979#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3978#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3977#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3976#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3975#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3974#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3973#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3972#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3971#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3970#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3969#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3968#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3967#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3966#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3965#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3964#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3963#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3962#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3961#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3960#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3959#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3958#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3957#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3956#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3955#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3954#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3953#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3952#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3951#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3950#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3949#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3948#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3947#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3946#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3945#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3944#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3943#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3942#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3941#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3940#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3939#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3938#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3937#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3936#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3935#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3934#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3933#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3932#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3931#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3930#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3929#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3928#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3927#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3926#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3925#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3924#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3923#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3922#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3921#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3920#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3919#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3918#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3917#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3916#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3915#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3914#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3913#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3912#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3911#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3910#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3909#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3908#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3907#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3906#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3905#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3904#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3903#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3902#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3901#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3900#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3899#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3898#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3897#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3896#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3895#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3894#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3893#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3892#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3891#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3890#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3889#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3888#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3887#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3886#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3885#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3884#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3883#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3882#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3881#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3880#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3879#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3878#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3877#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3876#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3875#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3874#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3873#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3872#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3871#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3870#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3869#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3868#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3867#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3866#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3865#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3864#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3863#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3862#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3861#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3860#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3859#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3858#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3857#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3856#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3855#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3854#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3853#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3852#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3851#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3850#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3849#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3848#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3847#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3846#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3845#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3844#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3843#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3842#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3841#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3840#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3839#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3838#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3837#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3836#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3835#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3834#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3833#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3832#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3831#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3830#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3829#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3828#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3827#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3826#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3825#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3824#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3823#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3822#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3821#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3820#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3819#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3818#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3817#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3816#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3815#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3814#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3813#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3812#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3811#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3810#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3809#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3808#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3807#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3806#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3805#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3804#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3803#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3802#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3801#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3800#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3799#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3798#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3797#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3796#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3795#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3794#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3793#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3792#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3791#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3790#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3789#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3788#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3787#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3786#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3785#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3784#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3783#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3782#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3781#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3780#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3779#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3778#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3777#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3776#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3775#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3774#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3773#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3772#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3771#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3770#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3769#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3768#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3767#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3766#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3765#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3764#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3763#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3762#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3761#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3760#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3759#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3758#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3757#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3756#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3755#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3754#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3753#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3752#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3751#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3750#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3749#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3748#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3747#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3746#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3745#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3744#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3743#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3742#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3741#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3740#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3739#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3738#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3737#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3736#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3735#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3734#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3733#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3732#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3731#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3730#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3729#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3728#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3727#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3726#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3725#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3724#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3723#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3722#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3721#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3720#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3719#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3718#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3717#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3716#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3715#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3714#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3713#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3712#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3711#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3710#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3709#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3708#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3707#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3705#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3706#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3704#L20-3 assume !(main_~i~0#1 < 100000); 3703#L20-4 main_~i~0#1 := 0; 3695#L26-3 [2022-11-02 20:23:00,518 INFO L750 eck$LassoCheckResult]: Loop: 3695#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); 3701#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 3694#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 3695#L26-3 [2022-11-02 20:23:00,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:00,519 INFO L85 PathProgramCache]: Analyzing trace with hash 712364496, now seen corresponding path program 6 times [2022-11-02 20:23:00,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:00,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635625257] [2022-11-02 20:23:00,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:00,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:10,638 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-02 20:23:10,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:10,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635625257] [2022-11-02 20:23:10,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635625257] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:23:10,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72585737] [2022-11-02 20:23:10,639 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-02 20:23:10,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:23:10,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:23:10,649 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:23:10,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6bc551-71f7-40f6-ad4c-3064bba12e21/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process