./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/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_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/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_24c2d164-4126-41db-a2f3-94e6f65bc8ec/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 fb960067570884de0638f14e8f74b0912d9ff4ed83f9c3c33e6cd3e420d05661 --- 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 21:11:36,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:11:36,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:11:36,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:11:36,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:11:36,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:11:36,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:11:36,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:11:36,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:11:36,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:11:36,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:11:36,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:11:36,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:11:36,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:11:36,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:11:36,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:11:36,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:11:36,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:11:36,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:11:36,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:11:36,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:11:36,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:11:36,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:11:36,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:11:36,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:11:36,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:11:36,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:11:36,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:11:36,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:11:36,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:11:36,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:11:36,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:11:36,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:11:36,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:11:36,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:11:36,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:11:36,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:11:36,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:11:36,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:11:36,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:11:36,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:11:36,906 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-02 21:11:36,947 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:11:36,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:11:36,948 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:11:36,948 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:11:36,949 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:11:36,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:11:36,950 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:11:36,950 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-02 21:11:36,950 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-02 21:11:36,951 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-02 21:11:36,952 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-02 21:11:36,952 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-02 21:11:36,952 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-02 21:11:36,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:11:36,953 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:11:36,953 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 21:11:36,953 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:11:36,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:11:36,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:11:36,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-02 21:11:36,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-02 21:11:36,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-02 21:11:36,954 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:11:36,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:11:36,955 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-02 21:11:36,955 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:11:36,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-02 21:11:36,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:11:36,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:11:36,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:11:36,956 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:11:36,958 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-02 21:11:36,958 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_24c2d164-4126-41db-a2f3-94e6f65bc8ec/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_24c2d164-4126-41db-a2f3-94e6f65bc8ec/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 -> fb960067570884de0638f14e8f74b0912d9ff4ed83f9c3c33e6cd3e420d05661 [2022-11-02 21:11:37,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:11:37,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:11:37,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:11:37,319 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:11:37,320 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:11:37,322 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2022-11-02 21:11:37,391 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/data/632272a05/e7b4f4f845fc4d079641c472508a06b7/FLAG1f778d125 [2022-11-02 21:11:37,947 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:11:37,948 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2022-11-02 21:11:37,955 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/data/632272a05/e7b4f4f845fc4d079641c472508a06b7/FLAG1f778d125 [2022-11-02 21:11:38,309 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/data/632272a05/e7b4f4f845fc4d079641c472508a06b7 [2022-11-02 21:11:38,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:11:38,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:11:38,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:11:38,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:11:38,319 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:11:38,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:11:38" (1/1) ... [2022-11-02 21:11:38,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@255ff936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:38, skipping insertion in model container [2022-11-02 21:11:38,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:11:38" (1/1) ... [2022-11-02 21:11:38,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:11:38,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:11:38,542 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_24c2d164-4126-41db-a2f3-94e6f65bc8ec/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i[814,827] [2022-11-02 21:11:38,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:11:38,565 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:11:38,582 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_24c2d164-4126-41db-a2f3-94e6f65bc8ec/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i[814,827] [2022-11-02 21:11:38,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:11:38,607 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:11:38,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:38 WrapperNode [2022-11-02 21:11:38,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:11:38,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:11:38,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:11:38,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:11:38,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:38" (1/1) ... [2022-11-02 21:11:38,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:38" (1/1) ... [2022-11-02 21:11:38,644 INFO L138 Inliner]: procedures = 15, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 44 [2022-11-02 21:11:38,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:11:38,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:11:38,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:11:38,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:11:38,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:38" (1/1) ... [2022-11-02 21:11:38,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:38" (1/1) ... [2022-11-02 21:11:38,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:38" (1/1) ... [2022-11-02 21:11:38,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:38" (1/1) ... [2022-11-02 21:11:38,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:38" (1/1) ... [2022-11-02 21:11:38,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:38" (1/1) ... [2022-11-02 21:11:38,678 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:38" (1/1) ... [2022-11-02 21:11:38,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:38" (1/1) ... [2022-11-02 21:11:38,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:11:38,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:11:38,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:11:38,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:11:38,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:38" (1/1) ... [2022-11-02 21:11:38,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:11:38,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:38,716 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:11:38,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-02 21:11:38,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:11:38,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:11:38,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:11:38,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:11:38,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:11:38,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:11:38,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:11:38,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:11:38,848 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:11:38,850 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:11:38,968 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:11:38,973 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:11:38,974 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 21:11:38,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:11:38 BoogieIcfgContainer [2022-11-02 21:11:38,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:11:38,977 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-02 21:11:38,977 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-02 21:11:38,982 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-02 21:11:38,982 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 21:11:38,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.11 09:11:38" (1/3) ... [2022-11-02 21:11:38,984 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61db548a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 09:11:38, skipping insertion in model container [2022-11-02 21:11:38,984 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 21:11:38,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:38" (2/3) ... [2022-11-02 21:11:38,984 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61db548a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 09:11:38, skipping insertion in model container [2022-11-02 21:11:38,984 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 21:11:38,985 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:11:38" (3/3) ... [2022-11-02 21:11:38,986 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep.i [2022-11-02 21:11:39,064 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-02 21:11:39,072 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-02 21:11:39,072 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-02 21:11:39,073 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-02 21:11:39,073 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-02 21:11:39,073 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-02 21:11:39,073 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-02 21:11:39,073 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-02 21:11:39,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 21:11:39,095 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-11-02 21:11:39,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:11:39,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:11:39,101 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 21:11:39,101 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-02 21:11:39,101 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-02 21:11:39,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 21:11:39,103 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-11-02 21:11:39,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:11:39,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:11:39,104 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 21:11:39,104 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-02 21:11:39,111 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(24, 2); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 12#L18-3true [2022-11-02 21:11:39,112 INFO L750 eck$LassoCheckResult]: Loop: 12#L18-3true assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 11#L18-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 12#L18-3true [2022-11-02 21:11:39,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:39,118 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-02 21:11:39,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:39,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279025366] [2022-11-02 21:11:39,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:39,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:39,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:11:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:39,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:11:39,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:39,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-11-02 21:11:39,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:39,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320884532] [2022-11-02 21:11:39,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:39,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:39,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:11:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:39,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:11:39,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:39,343 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-11-02 21:11:39,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:39,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346770194] [2022-11-02 21:11:39,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:39,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:39,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:11:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:39,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:11:39,811 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 21:11:39,812 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 21:11:39,812 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 21:11:39,812 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 21:11:39,812 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 21:11:39,813 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:11:39,813 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 21:11:39,813 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 21:11:39,813 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep.i_Iteration1_Lasso [2022-11-02 21:11:39,814 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 21:11:39,814 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 21:11:39,840 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 21:11:40,117 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 21:11:40,122 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 21:11:40,126 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 21:11:40,128 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 21:11:40,131 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 21:11:40,135 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 21:11:40,409 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 21:11:40,414 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 21:11:40,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:11:40,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:40,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:11:40,424 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 21:11:40,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-02 21:11:40,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:11:40,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:11:40,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:11:40,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:11:40,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 21:11:40,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 21:11:40,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:11:40,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:40,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:11:40,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:40,502 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:11:40,507 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 21:11:40,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:11:40,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:11:40,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:11:40,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:11:40,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-02 21:11:40,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 21:11:40,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 21:11:40,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:11:40,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:40,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:11:40,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:40,590 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:11:40,600 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 21:11:40,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:11:40,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:11:40,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:11:40,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:11:40,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-02 21:11:40,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 21:11:40,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 21:11:40,642 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:11:40,678 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:40,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:11:40,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:40,681 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:11:40,687 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 21:11:40,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-02 21:11:40,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:11:40,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:11:40,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:11:40,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:11:40,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 21:11:40,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 21:11:40,716 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:11:40,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:40,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:11:40,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:40,761 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:11:40,764 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 21:11:40,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:11:40,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:11:40,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:11:40,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:11:40,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-02 21:11:40,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 21:11:40,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 21:11:40,802 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:11:40,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:40,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:11:40,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:40,844 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:11:40,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 21:11:40,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:11:40,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:11:40,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:11:40,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:11:40,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 21:11:40,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 21:11:40,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-02 21:11:40,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:11:40,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:40,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:11:40,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:40,919 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:11:40,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-02 21:11:40,926 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 21:11:40,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:11:40,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:11:40,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:11:40,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:11:40,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 21:11:40,943 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 21:11:40,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:11:40,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:40,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:11:40,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:40,992 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:11:41,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-02 21:11:41,004 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 21:11:41,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:11:41,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:11:41,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:11:41,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:11:41,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 21:11:41,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 21:11:41,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:11:41,078 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:41,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:11:41,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:41,081 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:11:41,092 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 21:11:41,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:11:41,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:11:41,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:11:41,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:11:41,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-02 21:11:41,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 21:11:41,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 21:11:41,134 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 21:11:41,204 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-11-02 21:11:41,205 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-11-02 21:11:41,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:11:41,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:41,209 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:11:41,215 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 21:11:41,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-02 21:11:41,256 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-02 21:11:41,256 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 21:11:41,257 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) = -8*ULTIMATE.start_main_~i~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2022-11-02 21:11:41,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-11-02 21:11:41,314 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-11-02 21:11:41,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:41,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 21:11:41,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:41,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 21:11:41,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:41,504 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 21:11:41,552 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 21:11:41,554 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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.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 21:11:41,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:41,609 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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.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) Result 29 states and 41 transitions. Complement of second has 8 states. [2022-11-02 21:11:41,612 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 21:11:41,617 INFO L82 GeneralOperation]: Start removeUnreachable. 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 21:11:41,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-11-02 21:11:41,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 2 letters. [2022-11-02 21:11:41,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 21:11:41,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2022-11-02 21:11:41,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 21:11:41,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2022-11-02 21:11:41,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 21:11:41,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 41 transitions. [2022-11-02 21:11:41,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-02 21:11:41,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 12 states and 16 transitions. [2022-11-02 21:11:41,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-11-02 21:11:41,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-11-02 21:11:41,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2022-11-02 21:11:41,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:11:41,646 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-02 21:11:41,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2022-11-02 21:11:41,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-02 21:11:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:11:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-11-02 21:11:41,673 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-02 21:11:41,674 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-02 21:11:41,674 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-02 21:11:41,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-11-02 21:11:41,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-02 21:11:41,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:11:41,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:11:41,676 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-02 21:11:41,676 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-11-02 21:11:41,677 INFO L748 eck$LassoCheckResult]: Stem: 106#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(24, 2); 107#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 110#L18-3 assume !(main_~i~0#1 < 100000); 111#L18-4 main_~i~0#1 := 0; 112#L22-3 [2022-11-02 21:11:41,678 INFO L750 eck$LassoCheckResult]: Loop: 112#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 105#L13 assume !(0 == __VERIFIER_assert_~cond#1); 104#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 113#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 114#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 112#L22-3 [2022-11-02 21:11:41,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:41,682 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-11-02 21:11:41,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:41,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733035292] [2022-11-02 21:11:41,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:41,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:41,785 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 21:11:41,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:41,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733035292] [2022-11-02 21:11:41,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733035292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:41,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:41,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:11:41,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118522482] [2022-11-02 21:11:41,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:41,789 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 21:11:41,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:41,790 INFO L85 PathProgramCache]: Analyzing trace with hash 51750045, now seen corresponding path program 1 times [2022-11-02 21:11:41,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:41,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014147358] [2022-11-02 21:11:41,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:41,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:41,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:11:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:41,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:11:41,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:42,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:11:42,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:11:42,003 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 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 21:11:42,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:42,032 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-11-02 21:11:42,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2022-11-02 21:11:42,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-02 21:11:42,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 19 transitions. [2022-11-02 21:11:42,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-11-02 21:11:42,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-11-02 21:11:42,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2022-11-02 21:11:42,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:11:42,034 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-11-02 21:11:42,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2022-11-02 21:11:42,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2022-11-02 21:11:42,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:11:42,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-11-02 21:11:42,037 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-11-02 21:11:42,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:11:42,038 INFO L428 stractBuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-11-02 21:11:42,038 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-02 21:11:42,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2022-11-02 21:11:42,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-02 21:11:42,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:11:42,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:11:42,040 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:42,040 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-11-02 21:11:42,040 INFO L748 eck$LassoCheckResult]: Stem: 142#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(24, 2); 143#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 146#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 144#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 145#L18-3 assume !(main_~i~0#1 < 100000); 147#L18-4 main_~i~0#1 := 0; 148#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 154#L13 assume !(0 == __VERIFIER_assert_~cond#1); 153#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 149#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 150#L22-2 [2022-11-02 21:11:42,040 INFO L750 eck$LassoCheckResult]: Loop: 150#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 152#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 140#L13 assume !(0 == __VERIFIER_assert_~cond#1); 141#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 151#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 150#L22-2 [2022-11-02 21:11:42,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:42,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1436006135, now seen corresponding path program 1 times [2022-11-02 21:11:42,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:42,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516333375] [2022-11-02 21:11:42,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:42,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:42,162 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 21:11:42,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:42,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516333375] [2022-11-02 21:11:42,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516333375] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:42,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908909401] [2022-11-02 21:11:42,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:42,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:42,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:42,165 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:42,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 21:11:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:42,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 21:11:42,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:42,236 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 21:11:42,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:42,256 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 21:11:42,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908909401] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:11:42,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:11:42,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-02 21:11:42,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018483611] [2022-11-02 21:11:42,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:11:42,258 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 21:11:42,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:42,258 INFO L85 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 2 times [2022-11-02 21:11:42,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:42,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581747625] [2022-11-02 21:11:42,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:42,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:42,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:11:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:42,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:11:42,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:42,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:11:42,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:11:42,446 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:11:42,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:42,512 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-11-02 21:11:42,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2022-11-02 21:11:42,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-11-02 21:11:42,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 36 transitions. [2022-11-02 21:11:42,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-11-02 21:11:42,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-11-02 21:11:42,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 36 transitions. [2022-11-02 21:11:42,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:11:42,519 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-11-02 21:11:42,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 36 transitions. [2022-11-02 21:11:42,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2022-11-02 21:11:42,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 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 21:11:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-11-02 21:11:42,525 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-11-02 21:11:42,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:11:42,528 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-11-02 21:11:42,528 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-02 21:11:42,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2022-11-02 21:11:42,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-02 21:11:42,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:11:42,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:11:42,554 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-02 21:11:42,555 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-11-02 21:11:42,555 INFO L748 eck$LassoCheckResult]: Stem: 252#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(24, 2); 253#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 258#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 259#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 260#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 256#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 257#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 270#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 269#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 268#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 267#L18-3 assume !(main_~i~0#1 < 100000); 261#L18-4 main_~i~0#1 := 0; 262#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 254#L13 assume !(0 == __VERIFIER_assert_~cond#1); 255#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 265#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 274#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 275#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 277#L13 assume !(0 == __VERIFIER_assert_~cond#1); 276#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 263#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 264#L22-2 [2022-11-02 21:11:42,555 INFO L750 eck$LassoCheckResult]: Loop: 264#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 266#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 273#L13 assume !(0 == __VERIFIER_assert_~cond#1); 272#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 271#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 264#L22-2 [2022-11-02 21:11:42,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:42,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1930352971, now seen corresponding path program 1 times [2022-11-02 21:11:42,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:42,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346917124] [2022-11-02 21:11:42,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:42,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 21:11:42,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:42,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346917124] [2022-11-02 21:11:42,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346917124] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:42,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429200416] [2022-11-02 21:11:42,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:42,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:42,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:42,713 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:42,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 21:11:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:42,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 21:11:42,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 21:11:42,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 21:11:42,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429200416] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:11:42,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:11:42,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-02 21:11:42,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317389990] [2022-11-02 21:11:42,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:11:42,920 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 21:11:42,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:42,921 INFO L85 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 3 times [2022-11-02 21:11:42,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:42,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603319145] [2022-11-02 21:11:42,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:42,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:42,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:11:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:42,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:11:43,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:43,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 21:11:43,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:11:43,133 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 4 Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:11:43,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:43,299 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-11-02 21:11:43,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 81 transitions. [2022-11-02 21:11:43,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2022-11-02 21:11:43,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 81 transitions. [2022-11-02 21:11:43,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2022-11-02 21:11:43,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2022-11-02 21:11:43,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 81 transitions. [2022-11-02 21:11:43,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:11:43,313 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 81 transitions. [2022-11-02 21:11:43,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 81 transitions. [2022-11-02 21:11:43,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2022-11-02 21:11:43,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 52 states have internal predecessors, (55), 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 21:11:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-11-02 21:11:43,325 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-11-02 21:11:43,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:11:43,326 INFO L428 stractBuchiCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-11-02 21:11:43,326 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-02 21:11:43,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 55 transitions. [2022-11-02 21:11:43,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-02 21:11:43,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:11:43,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:11:43,333 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 5, 4, 1, 1, 1, 1] [2022-11-02 21:11:43,334 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-11-02 21:11:43,334 INFO L748 eck$LassoCheckResult]: Stem: 489#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(24, 2); 490#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 495#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 496#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 497#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 493#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 494#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 520#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 519#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 518#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 517#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 516#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 515#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 514#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 513#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 512#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 511#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 510#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 509#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 508#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 507#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 506#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 505#L18-3 assume !(main_~i~0#1 < 100000); 498#L18-4 main_~i~0#1 := 0; 499#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 503#L13 assume !(0 == __VERIFIER_assert_~cond#1); 541#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 540#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 524#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 525#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 491#L13 assume !(0 == __VERIFIER_assert_~cond#1); 492#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 502#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 526#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 539#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 538#L13 assume !(0 == __VERIFIER_assert_~cond#1); 537#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 536#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 535#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 534#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 533#L13 assume !(0 == __VERIFIER_assert_~cond#1); 532#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 531#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 530#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 529#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 528#L13 assume !(0 == __VERIFIER_assert_~cond#1); 527#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 500#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 501#L22-2 [2022-11-02 21:11:43,334 INFO L750 eck$LassoCheckResult]: Loop: 501#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 504#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 523#L13 assume !(0 == __VERIFIER_assert_~cond#1); 522#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 521#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 501#L22-2 [2022-11-02 21:11:43,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:43,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1653685129, now seen corresponding path program 2 times [2022-11-02 21:11:43,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:43,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872419219] [2022-11-02 21:11:43,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:43,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-02 21:11:43,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:43,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872419219] [2022-11-02 21:11:43,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872419219] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:43,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525709833] [2022-11-02 21:11:43,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:11:43,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:43,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:43,800 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:43,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 21:11:43,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:11:43,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:11:43,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 21:11:43,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-02 21:11:43,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-02 21:11:44,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525709833] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:11:44,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:11:44,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-11-02 21:11:44,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129651780] [2022-11-02 21:11:44,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:11:44,226 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 21:11:44,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:44,226 INFO L85 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 4 times [2022-11-02 21:11:44,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:44,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548426969] [2022-11-02 21:11:44,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:44,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:44,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:11:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:44,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:11:44,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:44,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 21:11:44,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-11-02 21:11:44,408 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. cyclomatic complexity: 4 Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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 21:11:44,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:44,750 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2022-11-02 21:11:44,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 171 transitions. [2022-11-02 21:11:44,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2022-11-02 21:11:44,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 171 transitions. [2022-11-02 21:11:44,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2022-11-02 21:11:44,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2022-11-02 21:11:44,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 171 transitions. [2022-11-02 21:11:44,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:11:44,754 INFO L218 hiAutomatonCegarLoop]: Abstraction has 159 states and 171 transitions. [2022-11-02 21:11:44,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 171 transitions. [2022-11-02 21:11:44,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 107. [2022-11-02 21:11:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 106 states have internal predecessors, (109), 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 21:11:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2022-11-02 21:11:44,762 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 109 transitions. [2022-11-02 21:11:44,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 21:11:44,763 INFO L428 stractBuchiCegarLoop]: Abstraction has 107 states and 109 transitions. [2022-11-02 21:11:44,763 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-02 21:11:44,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 109 transitions. [2022-11-02 21:11:44,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-02 21:11:44,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:11:44,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:11:44,767 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 11, 11, 11, 11, 10, 1, 1, 1, 1] [2022-11-02 21:11:44,767 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-11-02 21:11:44,768 INFO L748 eck$LassoCheckResult]: Stem: 1011#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(24, 2); 1012#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 1017#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1018#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1019#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1015#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1016#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1066#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1065#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1064#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1063#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1062#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1061#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1060#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1059#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1058#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1057#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1056#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1055#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1054#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1053#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1052#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1051#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1050#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1049#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1048#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1047#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1046#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1045#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1044#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1043#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1042#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1041#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1040#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1039#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1038#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1037#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1036#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1035#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1034#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1033#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1032#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1031#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1030#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1029#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1028#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1027#L18-3 assume !(main_~i~0#1 < 100000); 1020#L18-4 main_~i~0#1 := 0; 1021#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1025#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1117#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1116#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1070#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1071#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1013#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1014#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1024#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1072#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1115#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1114#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1113#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1112#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1111#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1110#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1109#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1108#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1107#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1106#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1105#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1104#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1103#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1102#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1101#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1100#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1099#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1098#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1097#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1096#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1095#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1094#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1093#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1092#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1091#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1090#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1089#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1088#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1087#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1086#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1085#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1084#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1083#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1082#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1081#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1080#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1079#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1078#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1077#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1076#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1075#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1074#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1073#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1022#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1023#L22-2 [2022-11-02 21:11:44,768 INFO L750 eck$LassoCheckResult]: Loop: 1023#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1026#L22-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);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1069#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1068#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1067#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1023#L22-2 [2022-11-02 21:11:44,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:44,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1459869857, now seen corresponding path program 3 times [2022-11-02 21:11:44,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:44,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965468401] [2022-11-02 21:11:44,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:44,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-11-02 21:11:45,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:45,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965468401] [2022-11-02 21:11:45,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965468401] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:45,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279448016] [2022-11-02 21:11:45,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 21:11:45,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:45,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:45,843 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:45,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 21:11:45,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-02 21:11:45,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:11:45,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-02 21:11:45,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:46,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-02 21:11:46,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-11-02 21:11:46,124 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2022-11-02 21:11:46,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:11:46,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279448016] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:46,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 21:11:46,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [25] total 28 [2022-11-02 21:11:46,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772935394] [2022-11-02 21:11:46,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:46,126 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 21:11:46,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:46,127 INFO L85 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 5 times [2022-11-02 21:11:46,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:46,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399705687] [2022-11-02 21:11:46,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:46,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:46,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:11:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:46,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:11:46,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:46,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:11:46,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=450, Unknown=0, NotChecked=0, Total=756 [2022-11-02 21:11:46,307 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:11:46,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:46,352 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-11-02 21:11:46,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 55 transitions. [2022-11-02 21:11:46,353 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-02 21:11:46,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2022-11-02 21:11:46,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-11-02 21:11:46,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-11-02 21:11:46,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-11-02 21:11:46,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:11:46,354 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 21:11:46,354 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 21:11:46,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:11:46,354 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 21:11:46,354 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-02 21:11:46,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-11-02 21:11:46,355 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-02 21:11:46,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-11-02 21:11:46,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.11 09:11:46 BoogieIcfgContainer [2022-11-02 21:11:46,363 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-02 21:11:46,363 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:11:46,364 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:11:46,364 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:11:46,364 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:11:38" (3/4) ... [2022-11-02 21:11:46,367 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 21:11:46,368 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:11:46,369 INFO L158 Benchmark]: Toolchain (without parser) took 8055.17ms. Allocated memory was 117.4MB in the beginning and 180.4MB in the end (delta: 62.9MB). Free memory was 82.7MB in the beginning and 81.6MB in the end (delta: 1.1MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. [2022-11-02 21:11:46,369 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 99.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:11:46,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.30ms. Allocated memory is still 117.4MB. Free memory was 82.5MB in the beginning and 93.6MB in the end (delta: -11.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 21:11:46,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.96ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 92.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:11:46,370 INFO L158 Benchmark]: Boogie Preprocessor took 34.80ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 91.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:11:46,370 INFO L158 Benchmark]: RCFGBuilder took 294.66ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 81.0MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 21:11:46,371 INFO L158 Benchmark]: BuchiAutomizer took 7386.29ms. Allocated memory was 117.4MB in the beginning and 180.4MB in the end (delta: 62.9MB). Free memory was 81.0MB in the beginning and 82.6MB in the end (delta: -1.7MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2022-11-02 21:11:46,371 INFO L158 Benchmark]: Witness Printer took 4.29ms. Allocated memory is still 180.4MB. Free memory was 82.6MB in the beginning and 81.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:11:46,373 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 99.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.30ms. Allocated memory is still 117.4MB. Free memory was 82.5MB in the beginning and 93.6MB in the end (delta: -11.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.96ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 92.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.80ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 91.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 294.66ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 81.0MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 7386.29ms. Allocated memory was 117.4MB in the beginning and 180.4MB in the end (delta: 62.9MB). Free memory was 81.0MB in the beginning and 82.6MB in the end (delta: -1.7MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. * Witness Printer took 4.29ms. Allocated memory is still 180.4MB. Free memory was 82.6MB in the beginning and 81.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (5 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 199999 * unknown-#length-unknown[a] + -8 * i and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.3s and 7 iterations. TraceHistogramMax:22. Analysis of lassos took 6.1s. Construction of modules took 0.4s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 83 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 396 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 395 mSDsluCounter, 135 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 261 IncrementalHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 39 mSDtfsCounter, 261 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital121 mio100 ax100 hnf100 lsp95 ukn80 mio100 lsp41 div100 bol100 ite100 ukn100 eq157 hnf93 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 49ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-11-02 21:11:46,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:46,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:46,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:47,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:47,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d164-4126-41db-a2f3-94e6f65bc8ec/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE