./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2329fc70 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_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76982ccfa15d5420010caf48ff31900a394710bc42d46403e291e5b0b2cbfb5b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 12:01:21,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:01:21,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:01:21,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:01:21,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:01:21,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:01:21,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:01:21,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:01:21,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:01:21,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:01:21,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:01:21,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:01:21,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:01:21,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:01:21,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:01:21,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:01:21,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:01:21,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:01:21,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:01:21,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:01:21,939 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:01:21,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:01:21,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:01:21,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:01:21,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:01:21,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:01:21,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:01:21,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:01:21,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:01:21,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:01:21,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:01:21,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:01:21,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:01:21,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:01:21,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:01:21,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:01:21,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:01:21,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:01:21,955 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:01:21,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:01:21,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:01:21,957 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-12-13 12:01:21,978 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:01:21,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:01:21,978 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:01:21,979 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:01:21,980 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:01:21,980 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:01:21,980 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:01:21,980 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 12:01:21,981 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 12:01:21,981 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 12:01:21,981 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 12:01:21,981 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 12:01:21,981 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 12:01:21,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:01:21,982 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:01:21,982 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 12:01:21,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:01:21,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:01:21,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:01:21,983 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 12:01:21,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 12:01:21,983 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 12:01:21,983 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:01:21,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:01:21,984 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 12:01:21,984 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:01:21,984 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 12:01:21,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:01:21,984 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:01:21,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:01:21,985 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:01:21,986 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 12:01:21,986 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_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76982ccfa15d5420010caf48ff31900a394710bc42d46403e291e5b0b2cbfb5b [2022-12-13 12:01:22,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:01:22,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:01:22,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:01:22,204 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:01:22,204 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:01:22,205 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2022-12-13 12:01:24,852 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:01:25,051 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:01:25,051 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2022-12-13 12:01:25,057 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/data/7ba12732f/0d10b8d6e4fd4b5cb980971fd991290c/FLAG1be006641 [2022-12-13 12:01:25,069 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/data/7ba12732f/0d10b8d6e4fd4b5cb980971fd991290c [2022-12-13 12:01:25,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:01:25,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:01:25,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:01:25,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:01:25,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:01:25,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:01:25" (1/1) ... [2022-12-13 12:01:25,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb4efca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:25, skipping insertion in model container [2022-12-13 12:01:25,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:01:25" (1/1) ... [2022-12-13 12:01:25,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:01:25,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:01:25,276 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c[6803,6816] [2022-12-13 12:01:25,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:01:25,290 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:01:25,326 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c[6803,6816] [2022-12-13 12:01:25,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:01:25,340 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:01:25,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:25 WrapperNode [2022-12-13 12:01:25,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:01:25,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:01:25,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:01:25,342 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:01:25,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:25" (1/1) ... [2022-12-13 12:01:25,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:25" (1/1) ... [2022-12-13 12:01:25,380 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2022-12-13 12:01:25,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:01:25,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:01:25,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:01:25,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:01:25,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:25" (1/1) ... [2022-12-13 12:01:25,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:25" (1/1) ... [2022-12-13 12:01:25,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:25" (1/1) ... [2022-12-13 12:01:25,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:25" (1/1) ... [2022-12-13 12:01:25,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:25" (1/1) ... [2022-12-13 12:01:25,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:25" (1/1) ... [2022-12-13 12:01:25,407 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:25" (1/1) ... [2022-12-13 12:01:25,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:25" (1/1) ... [2022-12-13 12:01:25,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:01:25,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:01:25,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:01:25,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:01:25,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:25" (1/1) ... [2022-12-13 12:01:25,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:01:25,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:01:25,450 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:01:25,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 12:01:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:01:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:01:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:01:25,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:01:25,554 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:01:25,555 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:01:25,744 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:01:25,749 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:01:25,749 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 12:01:25,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:01:25 BoogieIcfgContainer [2022-12-13 12:01:25,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:01:25,751 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 12:01:25,751 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 12:01:25,754 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 12:01:25,755 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 12:01:25,755 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 12:01:25" (1/3) ... [2022-12-13 12:01:25,755 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b8d3e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 12:01:25, skipping insertion in model container [2022-12-13 12:01:25,755 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 12:01:25,756 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:25" (2/3) ... [2022-12-13 12:01:25,756 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b8d3e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 12:01:25, skipping insertion in model container [2022-12-13 12:01:25,756 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 12:01:25,756 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:01:25" (3/3) ... [2022-12-13 12:01:25,757 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2022-12-13 12:01:25,798 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 12:01:25,798 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 12:01:25,799 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 12:01:25,799 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 12:01:25,799 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 12:01:25,799 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 12:01:25,799 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 12:01:25,799 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 12:01:25,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 66 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 65 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:25,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2022-12-13 12:01:25,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:01:25,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:01:25,828 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:25,828 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:25,828 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 12:01:25,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 66 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 65 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:25,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2022-12-13 12:01:25,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:01:25,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:01:25,834 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:25,834 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:25,840 INFO L748 eck$LassoCheckResult]: Stem: 27#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(47, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 34#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~post22#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 9#L159true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 33#L159-1true init_#res#1 := init_~tmp~0#1; 23#init_returnLabel#1true main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; 36#L275true assume 0 == main_~i2~0#1;assume false; 47#L275-2true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 13#L283-2true [2022-12-13 12:01:25,841 INFO L750 eck$LassoCheckResult]: Loop: 13#L283-2true assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 65#L57true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 4#L61true assume !(node1_~m1~0#1 != ~nomsg~0); 40#L61-1true ~mode1~0 := 0; 51#L57-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 41#L92true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 20#L95true assume !(node2_~m2~0#1 != ~nomsg~0); 29#L95-1true ~mode2~0 := 0; 62#L92-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 3#L126true assume !(0 != ~mode3~0 % 256); 28#L143true assume 0 != ~alive3~0 % 256;~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256); 46#L146-2true ~mode3~0 := 1; 63#L126-2true assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 60#L236true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 64#L236-1true check_#res#1 := check_~tmp~1#1; 16#check_returnLabel#1true main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 10#L307true assume !(0 == assert_~arg#1 % 256); 14#L302true assume { :end_inline_assert } true;main_#t~post22#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 13#L283-2true [2022-12-13 12:01:25,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:25,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1898425706, now seen corresponding path program 1 times [2022-12-13 12:01:25,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:25,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336556568] [2022-12-13 12:01:25,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:25,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:25,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:25,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:25,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336556568] [2022-12-13 12:01:25,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336556568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:25,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:25,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:01:25,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605381581] [2022-12-13 12:01:25,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:25,980 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 12:01:25,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:25,981 INFO L85 PathProgramCache]: Analyzing trace with hash 538791429, now seen corresponding path program 1 times [2022-12-13 12:01:25,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:25,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224288764] [2022-12-13 12:01:25,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:25,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:26,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:26,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224288764] [2022-12-13 12:01:26,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224288764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:26,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:26,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:01:26,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148492430] [2022-12-13 12:01:26,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:26,208 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 12:01:26,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:26,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:01:26,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:01:26,235 INFO L87 Difference]: Start difference. First operand has 66 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 65 states have internal predecessors, (110), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:26,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:01:26,243 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2022-12-13 12:01:26,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 107 transitions. [2022-12-13 12:01:26,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2022-12-13 12:01:26,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 61 states and 102 transitions. [2022-12-13 12:01:26,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2022-12-13 12:01:26,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2022-12-13 12:01:26,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 102 transitions. [2022-12-13 12:01:26,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:01:26,250 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 102 transitions. [2022-12-13 12:01:26,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 102 transitions. [2022-12-13 12:01:26,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-12-13 12:01:26,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 60 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:26,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 102 transitions. [2022-12-13 12:01:26,271 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 102 transitions. [2022-12-13 12:01:26,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:01:26,274 INFO L428 stractBuchiCegarLoop]: Abstraction has 61 states and 102 transitions. [2022-12-13 12:01:26,274 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 12:01:26,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 102 transitions. [2022-12-13 12:01:26,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2022-12-13 12:01:26,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:01:26,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:01:26,275 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:26,275 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:26,276 INFO L748 eck$LassoCheckResult]: Stem: 181#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(47, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 182#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~post22#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 158#L159 assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 152#L159-1 init_#res#1 := init_~tmp~0#1; 177#init_returnLabel#1 main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; 178#L275 assume !(0 == main_~i2~0#1); 188#L275-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 166#L283-2 [2022-12-13 12:01:26,276 INFO L750 eck$LassoCheckResult]: Loop: 166#L283-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 167#L57 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 146#L61 assume !(node1_~m1~0#1 != ~nomsg~0); 148#L61-1 ~mode1~0 := 0; 197#L57-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 198#L92 assume !(0 != ~mode2~0 % 256); 192#L109 assume 0 != ~alive2~0 % 256;~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256); 193#L112-2 ~mode2~0 := 1; 183#L92-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 143#L126 assume !(0 != ~mode3~0 % 256); 144#L143 assume 0 != ~alive3~0 % 256;~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256); 171#L146-2 ~mode3~0 := 1; 191#L126-2 assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 202#L236 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 180#L236-1 check_#res#1 := check_~tmp~1#1; 168#check_returnLabel#1 main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 160#L307 assume !(0 == assert_~arg#1 % 256); 161#L302 assume { :end_inline_assert } true;main_#t~post22#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 166#L283-2 [2022-12-13 12:01:26,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:26,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1898425768, now seen corresponding path program 1 times [2022-12-13 12:01:26,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:26,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948303218] [2022-12-13 12:01:26,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:26,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:26,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:26,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:26,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948303218] [2022-12-13 12:01:26,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948303218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:26,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:26,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:01:26,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485324048] [2022-12-13 12:01:26,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:26,314 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 12:01:26,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:26,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1278655674, now seen corresponding path program 1 times [2022-12-13 12:01:26,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:26,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108968020] [2022-12-13 12:01:26,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:26,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:26,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:26,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:26,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108968020] [2022-12-13 12:01:26,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108968020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:26,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:26,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:01:26,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43945794] [2022-12-13 12:01:26,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:26,447 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 12:01:26,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:26,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:01:26,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:01:26,448 INFO L87 Difference]: Start difference. First operand 61 states and 102 transitions. cyclomatic complexity: 42 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:26,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:01:26,510 INFO L93 Difference]: Finished difference Result 102 states and 166 transitions. [2022-12-13 12:01:26,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 166 transitions. [2022-12-13 12:01:26,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2022-12-13 12:01:26,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 99 states and 147 transitions. [2022-12-13 12:01:26,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2022-12-13 12:01:26,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2022-12-13 12:01:26,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 147 transitions. [2022-12-13 12:01:26,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:01:26,514 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 147 transitions. [2022-12-13 12:01:26,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 147 transitions. [2022-12-13 12:01:26,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 61. [2022-12-13 12:01:26,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 60 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:26,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 85 transitions. [2022-12-13 12:01:26,517 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 85 transitions. [2022-12-13 12:01:26,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:01:26,518 INFO L428 stractBuchiCegarLoop]: Abstraction has 61 states and 85 transitions. [2022-12-13 12:01:26,518 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 12:01:26,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 85 transitions. [2022-12-13 12:01:26,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2022-12-13 12:01:26,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:01:26,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:01:26,519 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:26,519 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:26,519 INFO L748 eck$LassoCheckResult]: Stem: 359#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(47, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 360#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~post22#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 336#L159 assume 0 == ~r1~0; 337#L160 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 342#L161 assume ~id1~0 >= 0; 343#L162 assume 0 == ~st1~0; 362#L163 assume ~send1~0 == ~id1~0; 347#L164 assume 0 == ~mode1~0 % 256; 340#L165 assume ~id2~0 >= 0; 341#L166 assume 0 == ~st2~0; 350#L167 assume ~send2~0 == ~id2~0; 331#L168 assume 0 == ~mode2~0 % 256; 332#L169 assume ~id3~0 >= 0; 379#L170 assume 0 == ~st3~0; 367#L171 assume ~send3~0 == ~id3~0; 364#L172 assume 0 == ~mode3~0 % 256; 365#L173 assume ~id1~0 != ~id2~0; 378#L174 assume ~id1~0 != ~id3~0; 329#L175 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 330#L159-1 init_#res#1 := init_~tmp~0#1; 355#init_returnLabel#1 main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; 356#L275 assume !(0 == main_~i2~0#1); 366#L275-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 344#L283-2 [2022-12-13 12:01:26,519 INFO L750 eck$LassoCheckResult]: Loop: 344#L283-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 345#L57 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 324#L61 assume !(node1_~m1~0#1 != ~nomsg~0); 326#L61-1 ~mode1~0 := 0; 375#L57-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 376#L92 assume !(0 != ~mode2~0 % 256); 370#L109 assume 0 != ~alive2~0 % 256;~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256); 371#L112-2 ~mode2~0 := 1; 361#L92-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 321#L126 assume !(0 != ~mode3~0 % 256); 322#L143 assume 0 != ~alive3~0 % 256;~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256); 349#L146-2 ~mode3~0 := 1; 369#L126-2 assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 380#L236 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 358#L236-1 check_#res#1 := check_~tmp~1#1; 346#check_returnLabel#1 main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 338#L307 assume !(0 == assert_~arg#1 % 256); 339#L302 assume { :end_inline_assert } true;main_#t~post22#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 344#L283-2 [2022-12-13 12:01:26,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:26,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 1 times [2022-12-13 12:01:26,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:26,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688323469] [2022-12-13 12:01:26,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:26,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:01:26,529 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:01:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:01:26,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:01:26,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:26,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1278655674, now seen corresponding path program 2 times [2022-12-13 12:01:26,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:26,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482504410] [2022-12-13 12:01:26,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:26,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:26,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:26,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482504410] [2022-12-13 12:01:26,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482504410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:26,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:26,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:01:26,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512218365] [2022-12-13 12:01:26,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:26,649 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 12:01:26,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:26,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:01:26,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:01:26,650 INFO L87 Difference]: Start difference. First operand 61 states and 85 transitions. cyclomatic complexity: 25 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:26,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:01:26,690 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2022-12-13 12:01:26,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 87 transitions. [2022-12-13 12:01:26,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2022-12-13 12:01:26,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 61 states and 83 transitions. [2022-12-13 12:01:26,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2022-12-13 12:01:26,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2022-12-13 12:01:26,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 83 transitions. [2022-12-13 12:01:26,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:01:26,693 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 83 transitions. [2022-12-13 12:01:26,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 83 transitions. [2022-12-13 12:01:26,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-12-13 12:01:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.360655737704918) internal successors, (83), 60 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2022-12-13 12:01:26,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 83 transitions. [2022-12-13 12:01:26,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:01:26,696 INFO L428 stractBuchiCegarLoop]: Abstraction has 61 states and 83 transitions. [2022-12-13 12:01:26,696 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 12:01:26,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 83 transitions. [2022-12-13 12:01:26,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2022-12-13 12:01:26,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:01:26,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:01:26,698 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:26,698 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:26,698 INFO L748 eck$LassoCheckResult]: Stem: 496#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(47, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 497#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~post22#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 473#L159 assume 0 == ~r1~0; 474#L160 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 479#L161 assume ~id1~0 >= 0; 480#L162 assume 0 == ~st1~0; 499#L163 assume ~send1~0 == ~id1~0; 484#L164 assume 0 == ~mode1~0 % 256; 477#L165 assume ~id2~0 >= 0; 478#L166 assume 0 == ~st2~0; 485#L167 assume ~send2~0 == ~id2~0; 468#L168 assume 0 == ~mode2~0 % 256; 469#L169 assume ~id3~0 >= 0; 516#L170 assume 0 == ~st3~0; 504#L171 assume ~send3~0 == ~id3~0; 501#L172 assume 0 == ~mode3~0 % 256; 502#L173 assume ~id1~0 != ~id2~0; 515#L174 assume ~id1~0 != ~id3~0; 461#L175 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 462#L159-1 init_#res#1 := init_~tmp~0#1; 492#init_returnLabel#1 main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; 493#L275 assume !(0 == main_~i2~0#1); 503#L275-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 481#L283-2 [2022-12-13 12:01:26,698 INFO L750 eck$LassoCheckResult]: Loop: 481#L283-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 482#L57 assume !(0 != ~mode1~0 % 256); 517#L75 assume 0 != ~alive1~0 % 256;~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256); 491#L78-2 ~mode1~0 := 1; 510#L57-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 511#L92 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 488#L95 assume !(node2_~m2~0#1 != ~nomsg~0); 471#L95-1 ~mode2~0 := 0; 498#L92-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 458#L126 assume !(0 != ~mode3~0 % 256); 459#L143 assume 0 != ~alive3~0 % 256;~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256); 487#L146-2 ~mode3~0 := 1; 506#L126-2 assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 518#L236 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 500#L237 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 495#L236-1 check_#res#1 := check_~tmp~1#1; 483#check_returnLabel#1 main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 475#L307 assume !(0 == assert_~arg#1 % 256); 476#L302 assume { :end_inline_assert } true;main_#t~post22#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 481#L283-2 [2022-12-13 12:01:26,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:26,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 2 times [2022-12-13 12:01:26,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:26,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770861191] [2022-12-13 12:01:26,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:26,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:01:26,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:01:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:01:26,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:01:26,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:26,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1310949812, now seen corresponding path program 1 times [2022-12-13 12:01:26,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:26,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703394248] [2022-12-13 12:01:26,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:26,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:01:26,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:01:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:01:26,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:01:26,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:26,737 INFO L85 PathProgramCache]: Analyzing trace with hash -23925705, now seen corresponding path program 1 times [2022-12-13 12:01:26,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:26,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829044393] [2022-12-13 12:01:26,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:26,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:26,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:26,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:26,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829044393] [2022-12-13 12:01:26,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829044393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:26,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:26,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:01:26,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439822421] [2022-12-13 12:01:26,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:27,681 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 12:01:27,681 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 12:01:27,682 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 12:01:27,682 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 12:01:27,682 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-12-13 12:01:27,682 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:01:27,682 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 12:01:27,682 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 12:01:27,682 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-12-13 12:01:27,682 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 12:01:27,682 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 12:01:27,715 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:27,726 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:27,730 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:27,733 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:27,735 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:27,739 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:27,743 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:27,745 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:27,746 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:27,750 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:27,752 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:28,278 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:28,280 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:28,754 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2022-12-13 12:01:28,862 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 6767 conjuctions. This might take some time... [2022-12-13 12:01:29,596 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 437 conjuctions. [2022-12-13 12:01:39,480 WARN L233 SmtUtils]: Spent 9.84s on a formula simplification. DAG size of input: 358 DAG size of output: 139 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2022-12-13 12:01:39,503 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 12:01:39,504 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-12-13 12:01:39,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:01:39,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:01:39,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:01:39,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-12-13 12:01:39,509 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-12-13 12:01:39,509 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-12-13 12:01:39,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-12-13 12:01:39,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:01:39,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:01:39,526 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:01:39,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-12-13 12:01:39,528 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-12-13 12:01:39,529 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-12-13 12:01:39,613 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-12-13 12:01:39,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-12-13 12:01:39,617 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 12:01:39,617 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 12:01:39,617 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 12:01:39,617 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 12:01:39,617 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 12:01:39,617 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:01:39,617 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 12:01:39,617 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 12:01:39,617 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-12-13 12:01:39,617 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 12:01:39,617 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 12:01:39,624 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:39,629 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:39,632 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:40,005 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:40,008 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:40,009 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:40,012 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:40,013 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:40,014 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:40,017 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:40,019 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:40,020 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:40,021 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:01:40,577 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2022-12-13 12:01:40,677 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 8366 conjuctions. This might take some time... [2022-12-13 12:01:41,707 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 437 conjuctions. [2022-12-13 12:01:52,897 WARN L233 SmtUtils]: Spent 11.17s on a formula simplification. DAG size of input: 358 DAG size of output: 139 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2022-12-13 12:01:52,937 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 12:01:52,941 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 12:01:52,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:01:52,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:01:52,944 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:01:52,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-12-13 12:01:52,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 12:01:52,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:01:52,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:01:52,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:01:52,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:01:52,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:01:52,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:01:52,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:01:52,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:01:52,965 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-12-13 12:01:52,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:01:52,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:01:52,966 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:01:52,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-12-13 12:01:52,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 12:01:52,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:01:52,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:01:52,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:01:52,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:01:52,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:01:52,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:01:52,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:01:52,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:01:52,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-12-13 12:01:52,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:01:52,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:01:52,986 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:01:52,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-12-13 12:01:52,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 12:01:53,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:01:53,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:01:53,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:01:53,001 INFO L204 nArgumentSynthesizer]: 36 loop disjuncts [2022-12-13 12:01:53,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:01:53,150 INFO L401 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2022-12-13 12:01:53,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:01:53,362 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:01:53,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-12-13 12:01:53,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:01:53,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:01:53,369 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:01:53,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-12-13 12:01:53,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 12:01:53,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:01:53,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:01:53,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:01:53,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:01:53,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:01:53,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:01:53,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:01:53,384 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 12:01:53,389 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-12-13 12:01:53,389 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-12-13 12:01:53,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:01:53,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:01:53,417 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:01:53,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-12-13 12:01:53,419 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 12:01:53,419 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-12-13 12:01:53,419 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 12:01:53,419 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 11 Supporting invariants [] [2022-12-13 12:01:53,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-12-13 12:01:53,423 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-12-13 12:01:53,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:53,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 12:01:53,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:01:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:53,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 12:01:53,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:01:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:53,571 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-12-13 12:01:53,572 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 83 transitions. cyclomatic complexity: 23 Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:53,613 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 83 transitions. cyclomatic complexity: 23. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 99 states and 144 transitions. Complement of second has 4 states. [2022-12-13 12:01:53,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-12-13 12:01:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:53,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-12-13 12:01:53,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 83 transitions. Stem has 23 letters. Loop has 19 letters. [2022-12-13 12:01:53,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:01:53,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 83 transitions. Stem has 42 letters. Loop has 19 letters. [2022-12-13 12:01:53,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:01:53,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 83 transitions. Stem has 23 letters. Loop has 38 letters. [2022-12-13 12:01:53,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:01:53,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 144 transitions. [2022-12-13 12:01:53,622 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-12-13 12:01:53,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 0 states and 0 transitions. [2022-12-13 12:01:53,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-12-13 12:01:53,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-12-13 12:01:53,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-12-13 12:01:53,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:01:53,623 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 12:01:53,623 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 12:01:53,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:53,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:01:53,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:01:53,624 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:53,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:01:53,624 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-12-13 12:01:53,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-12-13 12:01:53,624 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-12-13 12:01:53,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 12:01:53,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-12-13 12:01:53,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-12-13 12:01:53,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-12-13 12:01:53,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:01:53,625 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 12:01:53,625 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 12:01:53,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:01:53,626 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 12:01:53,626 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-12-13 12:01:53,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-12-13 12:01:53,626 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-12-13 12:01:53,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-12-13 12:01:53,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.12 12:01:53 BoogieIcfgContainer [2022-12-13 12:01:53,633 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-12-13 12:01:53,634 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:01:53,634 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:01:53,634 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:01:53,635 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:01:25" (3/4) ... [2022-12-13 12:01:53,638 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 12:01:53,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:01:53,639 INFO L158 Benchmark]: Toolchain (without parser) took 28566.40ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 108.4MB in the beginning and 34.4MB in the end (delta: 74.0MB). Peak memory consumption was 106.1MB. Max. memory is 16.1GB. [2022-12-13 12:01:53,639 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 115.3MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:01:53,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.53ms. Allocated memory is still 144.7MB. Free memory was 108.0MB in the beginning and 95.0MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 12:01:53,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.55ms. Allocated memory is still 144.7MB. Free memory was 94.6MB in the beginning and 92.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:01:53,640 INFO L158 Benchmark]: Boogie Preprocessor took 30.88ms. Allocated memory is still 144.7MB. Free memory was 92.5MB in the beginning and 90.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:01:53,641 INFO L158 Benchmark]: RCFGBuilder took 337.87ms. Allocated memory is still 144.7MB. Free memory was 90.8MB in the beginning and 73.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 12:01:53,642 INFO L158 Benchmark]: BuchiAutomizer took 27882.29ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 72.8MB in the beginning and 34.4MB in the end (delta: 38.4MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. [2022-12-13 12:01:53,642 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 174.1MB. Free memory is still 34.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:01:53,645 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.10ms. Allocated memory is still 115.3MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.53ms. Allocated memory is still 144.7MB. Free memory was 108.0MB in the beginning and 95.0MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.55ms. Allocated memory is still 144.7MB. Free memory was 94.6MB in the beginning and 92.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.88ms. Allocated memory is still 144.7MB. Free memory was 92.5MB in the beginning and 90.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 337.87ms. Allocated memory is still 144.7MB. Free memory was 90.8MB in the beginning and 73.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 27882.29ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 72.8MB in the beginning and 34.4MB in the end (delta: 38.4MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 174.1MB. Free memory is still 34.4MB. 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 27.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 27.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 38 StatesRemovedByMinimization, 1 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, 207 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 206 mSDsluCounter, 942 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 573 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 369 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital295 mio100 ax100 hnf100 lsp528 ukn16 mio100 lsp100 div136 bol100 ite100 ukn100 eq164 hnf97 smp75 dnf10301 smp13 tf100 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 376ms VariablesStem: 0 VariablesLoop: 24 DisjunctsStem: 1 DisjunctsLoop: 36 SupportingInvariants: 0 MotzkinApplications: 72 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-12-13 12:01:53,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-12-13 12:01:53,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26dd2755-c2b1-4e75-a976-51e136e75b52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE