./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4e7fbc69 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_ca52d6a2-82c9-415f-8749-23c6e80721ed/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca52d6a2-82c9-415f-8749-23c6e80721ed/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca52d6a2-82c9-415f-8749-23c6e80721ed/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca52d6a2-82c9-415f-8749-23c6e80721ed/bin/uautomizer-QkZJyEgLgS/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca52d6a2-82c9-415f-8749-23c6e80721ed/bin/uautomizer-QkZJyEgLgS/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca52d6a2-82c9-415f-8749-23c6e80721ed/bin/uautomizer-QkZJyEgLgS --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 9a8265a1502e23b0364b9cd16198377a0ca498fc346156a58eeb954c0e23f901 --- 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-4e7fbc6 [2022-11-23 03:29:42,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:29:42,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:29:42,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:29:42,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:29:42,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:29:42,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:29:42,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:29:42,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:29:42,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:29:42,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:29:42,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:29:42,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:29:42,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:29:42,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:29:42,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:29:42,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:29:42,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:29:42,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:29:42,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:29:42,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:29:42,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:29:42,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:29:42,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:29:42,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:29:42,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:29:42,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:29:42,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:29:42,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:29:42,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:29:42,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:29:42,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:29:42,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:29:42,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:29:42,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:29:42,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:29:42,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:29:42,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:29:42,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:29:42,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:29:42,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:29:42,550 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca52d6a2-82c9-415f-8749-23c6e80721ed/bin/uautomizer-QkZJyEgLgS/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-23 03:29:42,592 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:29:42,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:29:42,593 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:29:42,593 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:29:42,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:29:42,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:29:42,594 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:29:42,595 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-23 03:29:42,595 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-23 03:29:42,595 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-23 03:29:42,596 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-23 03:29:42,596 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-23 03:29:42,596 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-23 03:29:42,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:29:42,597 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:29:42,597 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 03:29:42,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:29:42,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:29:42,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:29:42,598 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-23 03:29:42,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-23 03:29:42,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-23 03:29:42,598 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:29:42,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 03:29:42,599 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-23 03:29:42,599 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:29:42,599 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-23 03:29:42,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:29:42,599 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:29:42,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:29:42,600 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:29:42,601 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-23 03:29:42,601 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_ca52d6a2-82c9-415f-8749-23c6e80721ed/bin/uautomizer-QkZJyEgLgS/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_ca52d6a2-82c9-415f-8749-23c6e80721ed/bin/uautomizer-QkZJyEgLgS 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 -> 9a8265a1502e23b0364b9cd16198377a0ca498fc346156a58eeb954c0e23f901 [2022-11-23 03:29:42,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:29:42,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:29:42,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:29:42,933 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:29:42,934 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:29:42,935 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca52d6a2-82c9-415f-8749-23c6e80721ed/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c [2022-11-23 03:29:45,847 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:29:46,074 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:29:46,074 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca52d6a2-82c9-415f-8749-23c6e80721ed/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c [2022-11-23 03:29:46,086 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca52d6a2-82c9-415f-8749-23c6e80721ed/bin/uautomizer-QkZJyEgLgS/data/efe3eb0a1/ef82469c2ab640d897a63af428b66d60/FLAGf9931cbe0 [2022-11-23 03:29:46,131 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca52d6a2-82c9-415f-8749-23c6e80721ed/bin/uautomizer-QkZJyEgLgS/data/efe3eb0a1/ef82469c2ab640d897a63af428b66d60 [2022-11-23 03:29:46,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:29:46,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:29:46,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:29:46,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:29:46,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:29:46,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:29:46" (1/1) ... [2022-11-23 03:29:46,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@558fda48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:46, skipping insertion in model container [2022-11-23 03:29:46,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:29:46" (1/1) ... [2022-11-23 03:29:46,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:29:46,210 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:29:46,385 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_ca52d6a2-82c9-415f-8749-23c6e80721ed/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c[8209,8222] [2022-11-23 03:29:46,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:29:46,399 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:29:46,464 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_ca52d6a2-82c9-415f-8749-23c6e80721ed/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c[8209,8222] [2022-11-23 03:29:46,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:29:46,485 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:29:46,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:46 WrapperNode [2022-11-23 03:29:46,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:29:46,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:29:46,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:29:46,487 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:29:46,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:46" (1/1) ... [2022-11-23 03:29:46,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:46" (1/1) ... [2022-11-23 03:29:46,531 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 243 [2022-11-23 03:29:46,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:29:46,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:29:46,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:29:46,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:29:46,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:46" (1/1) ... [2022-11-23 03:29:46,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:46" (1/1) ... [2022-11-23 03:29:46,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:46" (1/1) ... [2022-11-23 03:29:46,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:46" (1/1) ... [2022-11-23 03:29:46,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:46" (1/1) ... [2022-11-23 03:29:46,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:46" (1/1) ... [2022-11-23 03:29:46,558 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:46" (1/1) ... [2022-11-23 03:29:46,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:46" (1/1) ... [2022-11-23 03:29:46,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:29:46,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:29:46,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:29:46,564 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:29:46,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:46" (1/1) ... [2022-11-23 03:29:46,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:29:46,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca52d6a2-82c9-415f-8749-23c6e80721ed/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:29:46,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca52d6a2-82c9-415f-8749-23c6e80721ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:29:46,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca52d6a2-82c9-415f-8749-23c6e80721ed/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-23 03:29:46,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:29:46,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:29:46,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:29:46,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:29:46,793 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:29:46,795 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:29:47,224 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:29:47,232 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:29:47,232 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 03:29:47,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:29:47 BoogieIcfgContainer [2022-11-23 03:29:47,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:29:47,235 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-23 03:29:47,235 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-23 03:29:47,240 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-23 03:29:47,241 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 03:29:47,241 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:29:46" (1/3) ... [2022-11-23 03:29:47,242 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@637b0dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:29:47, skipping insertion in model container [2022-11-23 03:29:47,242 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 03:29:47,242 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:46" (2/3) ... [2022-11-23 03:29:47,243 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@637b0dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:29:47, skipping insertion in model container [2022-11-23 03:29:47,243 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 03:29:47,243 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:29:47" (3/3) ... [2022-11-23 03:29:47,245 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c [2022-11-23 03:29:47,300 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-23 03:29:47,301 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-23 03:29:47,301 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-23 03:29:47,301 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-23 03:29:47,301 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-23 03:29:47,302 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-23 03:29:47,302 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-23 03:29:47,302 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-23 03:29:47,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 68 states, 67 states have (on average 1.7164179104477613) internal successors, (115), 67 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:29:47,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-11-23 03:29:47,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 03:29:47,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 03:29:47,348 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:29:47,349 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:29:47,349 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-23 03:29:47,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 68 states, 67 states have (on average 1.7164179104477613) internal successors, (115), 67 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:29:47,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-11-23 03:29:47,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 03:29:47,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 03:29:47,368 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:29:47,368 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:29:47,377 INFO L748 eck$LassoCheckResult]: Stem: 47#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 37#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~nondet20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~post23#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;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 15#L161true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 9#L161-1true init_#res#1 := init_~tmp~0#1; 51#L254true main_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1; 11#L310true assume !(0 == main_~i2~0#1); 4#L310-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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 16#L320-2true [2022-11-23 03:29:47,387 INFO L750 eck$LassoCheckResult]: Loop: 16#L320-2true assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 6#L61true assume !(0 != ~mode1~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);~mode1~0 := 1; 44#L61-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; 55#L87true assume !(0 != ~mode2~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);~mode2~0 := 1; 8#L87-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; 50#L112true assume !(0 != ~mode3~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);~mode3~0 := 1; 60#L112-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 66#L137true assume !(0 != ~mode4~0 % 256);~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256);~mode4~0 := 1; 45#L137-2true assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 61#L262true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 25#L262-1true check_#res#1 := check_~tmp~1#1; 5#L282true main_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret22#1;havoc main_#t~ret22#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; 43#L347true assume !(0 == assert_~arg#1 % 256); 34#L342true assume { :end_inline_assert } true;main_#t~post23#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post23#1;havoc main_#t~post23#1; 16#L320-2true [2022-11-23 03:29:47,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:29:47,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1932780748, now seen corresponding path program 1 times [2022-11-23 03:29:47,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:29:47,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900264562] [2022-11-23 03:29:47,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:29:47,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:29:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:29:47,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:29:47,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:29:47,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900264562] [2022-11-23 03:29:47,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900264562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:29:47,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:29:47,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:29:47,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639441930] [2022-11-23 03:29:47,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:29:47,669 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-23 03:29:47,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:29:47,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1387092733, now seen corresponding path program 1 times [2022-11-23 03:29:47,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:29:47,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231548214] [2022-11-23 03:29:47,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:29:47,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:29:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:29:48,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:29:48,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:29:48,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231548214] [2022-11-23 03:29:48,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231548214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:29:48,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:29:48,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:29:48,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100920366] [2022-11-23 03:29:48,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:29:48,168 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-23 03:29:48,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:29:48,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:29:48,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:29:48,232 INFO L87 Difference]: Start difference. First operand has 68 states, 67 states have (on average 1.7164179104477613) internal successors, (115), 67 states have internal predecessors, (115), 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 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-11-23 03:29:48,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:29:48,379 INFO L93 Difference]: Finished difference Result 106 states and 170 transitions. [2022-11-23 03:29:48,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 170 transitions. [2022-11-23 03:29:48,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2022-11-23 03:29:48,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 97 states and 139 transitions. [2022-11-23 03:29:48,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2022-11-23 03:29:48,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2022-11-23 03:29:48,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 139 transitions. [2022-11-23 03:29:48,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:29:48,391 INFO L218 hiAutomatonCegarLoop]: Abstraction has 97 states and 139 transitions. [2022-11-23 03:29:48,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 139 transitions. [2022-11-23 03:29:48,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 63. [2022-11-23 03:29:48,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 62 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:29:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2022-11-23 03:29:48,422 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 84 transitions. [2022-11-23 03:29:48,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:29:48,427 INFO L428 stractBuchiCegarLoop]: Abstraction has 63 states and 84 transitions. [2022-11-23 03:29:48,428 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-23 03:29:48,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 84 transitions. [2022-11-23 03:29:48,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2022-11-23 03:29:48,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 03:29:48,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 03:29:48,431 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, 1, 1, 1, 1, 1, 1] [2022-11-23 03:29:48,431 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:29:48,431 INFO L748 eck$LassoCheckResult]: Stem: 246#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 237#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~nondet20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~post23#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;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 217#L161 assume 0 == ~r1~0; 218#L162 assume ~id1~0 >= 0; 234#L163 assume 0 == ~st1~0; 221#L164 assume ~send1~0 == ~id1~0; 212#L165 assume 0 == ~mode1~0 % 256; 213#L166 assume ~id2~0 >= 0; 222#L167 assume 0 == ~st2~0; 205#L168 assume ~send2~0 == ~id2~0; 206#L169 assume 0 == ~mode2~0 % 256; 254#L170 assume ~id3~0 >= 0; 240#L171 assume 0 == ~st3~0; 238#L172 assume ~send3~0 == ~id3~0; 239#L173 assume 0 == ~mode3~0 % 256; 250#L174 assume ~id4~0 >= 0; 198#L175 assume 0 == ~st4~0; 199#L176 assume ~send4~0 == ~id4~0; 241#L177 assume 0 == ~mode4~0 % 256; 232#L178 assume ~id1~0 != ~id2~0; 233#L179 assume ~id1~0 != ~id3~0; 192#L180 assume ~id1~0 != ~id4~0; 193#L181 assume ~id2~0 != ~id3~0; 227#L182 assume ~id2~0 != ~id4~0; 228#L183 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 207#L161-1 init_#res#1 := init_~tmp~0#1; 208#L254 main_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1; 209#L310 assume !(0 == main_~i2~0#1); 194#L310-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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 195#L320-2 [2022-11-23 03:29:48,432 INFO L750 eck$LassoCheckResult]: Loop: 195#L320-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 200#L61 assume !(0 != ~mode1~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);~mode1~0 := 1; 202#L61-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; 244#L87 assume !(0 != ~mode2~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);~mode2~0 := 1; 203#L87-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; 204#L112 assume !(0 != ~mode3~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);~mode3~0 := 1; 248#L112-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 252#L137 assume !(0 != ~mode4~0 % 256);~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256);~mode4~0 := 1; 242#L137-2 assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 245#L262 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 215#L262-1 check_#res#1 := check_~tmp~1#1; 196#L282 main_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret22#1;havoc main_#t~ret22#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; 197#L347 assume !(0 == assert_~arg#1 % 256); 235#L342 assume { :end_inline_assert } true;main_#t~post23#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post23#1;havoc main_#t~post23#1; 195#L320-2 [2022-11-23 03:29:48,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:29:48,432 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 1 times [2022-11-23 03:29:48,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:29:48,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273346376] [2022-11-23 03:29:48,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:29:48,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:29:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:29:48,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:29:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:29:48,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:29:48,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:29:48,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1387092733, now seen corresponding path program 2 times [2022-11-23 03:29:48,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:29:48,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007818538] [2022-11-23 03:29:48,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:29:48,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:29:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:29:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:29:48,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:29:48,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007818538] [2022-11-23 03:29:48,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007818538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:29:48,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:29:48,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:29:48,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355201324] [2022-11-23 03:29:48,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:29:48,792 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-23 03:29:48,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:29:48,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:29:48,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:29:48,794 INFO L87 Difference]: Start difference. First operand 63 states and 84 transitions. cyclomatic complexity: 22 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:29:48,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:29:48,861 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2022-11-23 03:29:48,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 86 transitions. [2022-11-23 03:29:48,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2022-11-23 03:29:48,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 63 states and 81 transitions. [2022-11-23 03:29:48,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2022-11-23 03:29:48,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2022-11-23 03:29:48,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 81 transitions. [2022-11-23 03:29:48,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:29:48,874 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 81 transitions. [2022-11-23 03:29:48,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 81 transitions. [2022-11-23 03:29:48,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-23 03:29:48,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 62 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:29:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2022-11-23 03:29:48,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 81 transitions. [2022-11-23 03:29:48,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:29:48,887 INFO L428 stractBuchiCegarLoop]: Abstraction has 63 states and 81 transitions. [2022-11-23 03:29:48,888 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-23 03:29:48,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 81 transitions. [2022-11-23 03:29:48,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2022-11-23 03:29:48,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 03:29:48,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 03:29:48,896 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, 1, 1, 1, 1, 1, 1] [2022-11-23 03:29:48,897 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:29:48,898 INFO L748 eck$LassoCheckResult]: Stem: 387#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 378#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~nondet20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~post23#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;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 357#L161 assume 0 == ~r1~0; 358#L162 assume ~id1~0 >= 0; 375#L163 assume 0 == ~st1~0; 361#L164 assume ~send1~0 == ~id1~0; 353#L165 assume 0 == ~mode1~0 % 256; 354#L166 assume ~id2~0 >= 0; 362#L167 assume 0 == ~st2~0; 346#L168 assume ~send2~0 == ~id2~0; 347#L169 assume 0 == ~mode2~0 % 256; 395#L170 assume ~id3~0 >= 0; 381#L171 assume 0 == ~st3~0; 379#L172 assume ~send3~0 == ~id3~0; 380#L173 assume 0 == ~mode3~0 % 256; 391#L174 assume ~id4~0 >= 0; 339#L175 assume 0 == ~st4~0; 340#L176 assume ~send4~0 == ~id4~0; 382#L177 assume 0 == ~mode4~0 % 256; 373#L178 assume ~id1~0 != ~id2~0; 374#L179 assume ~id1~0 != ~id3~0; 333#L180 assume ~id1~0 != ~id4~0; 334#L181 assume ~id2~0 != ~id3~0; 368#L182 assume ~id2~0 != ~id4~0; 369#L183 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 348#L161-1 init_#res#1 := init_~tmp~0#1; 349#L254 main_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1; 350#L310 assume !(0 == main_~i2~0#1); 335#L310-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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 336#L320-2 [2022-11-23 03:29:48,898 INFO L750 eck$LassoCheckResult]: Loop: 336#L320-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 341#L61 assume !(0 != ~mode1~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);~mode1~0 := 1; 343#L61-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; 385#L87 assume !(0 != ~mode2~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);~mode2~0 := 1; 344#L87-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; 345#L112 assume !(0 != ~mode3~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);~mode3~0 := 1; 389#L112-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 393#L137 assume !(0 != ~mode4~0 % 256);~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256);~mode4~0 := 1; 383#L137-2 assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 386#L262 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 394#L263 assume ~r1~0 >= 4; 356#L267 assume ~r1~0 < 4;check_~tmp~1#1 := 1; 366#L262-1 check_#res#1 := check_~tmp~1#1; 337#L282 main_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret22#1;havoc main_#t~ret22#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#L347 assume !(0 == assert_~arg#1 % 256); 376#L342 assume { :end_inline_assert } true;main_#t~post23#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post23#1;havoc main_#t~post23#1; 336#L320-2 [2022-11-23 03:29:48,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:29:48,900 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 2 times [2022-11-23 03:29:48,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:29:48,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681805561] [2022-11-23 03:29:48,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:29:48,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:29:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:29:48,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:29:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:29:48,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:29:48,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:29:48,968 INFO L85 PathProgramCache]: Analyzing trace with hash 140432525, now seen corresponding path program 1 times [2022-11-23 03:29:48,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:29:48,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443051229] [2022-11-23 03:29:48,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:29:48,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:29:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:29:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:29:49,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:29:49,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443051229] [2022-11-23 03:29:49,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443051229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:29:49,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:29:49,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:29:49,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766042926] [2022-11-23 03:29:49,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:29:49,019 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-23 03:29:49,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:29:49,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:29:49,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:29:49,021 INFO L87 Difference]: Start difference. First operand 63 states and 81 transitions. cyclomatic complexity: 19 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:29:49,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:29:49,046 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2022-11-23 03:29:49,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 122 transitions. [2022-11-23 03:29:49,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2022-11-23 03:29:49,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 122 transitions. [2022-11-23 03:29:49,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2022-11-23 03:29:49,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2022-11-23 03:29:49,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 122 transitions. [2022-11-23 03:29:49,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:29:49,056 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 122 transitions. [2022-11-23 03:29:49,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 122 transitions. [2022-11-23 03:29:49,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-23 03:29:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 90 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:29:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2022-11-23 03:29:49,077 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 122 transitions. [2022-11-23 03:29:49,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:29:49,078 INFO L428 stractBuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2022-11-23 03:29:49,079 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-23 03:29:49,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 122 transitions. [2022-11-23 03:29:49,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2022-11-23 03:29:49,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 03:29:49,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 03:29:49,082 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, 1, 1, 1, 1, 1, 1] [2022-11-23 03:29:49,083 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:29:49,083 INFO L748 eck$LassoCheckResult]: Stem: 549#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 540#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~nondet20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~post23#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;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 517#L161 assume 0 == ~r1~0; 518#L162 assume ~id1~0 >= 0; 537#L163 assume 0 == ~st1~0; 522#L164 assume ~send1~0 == ~id1~0; 513#L165 assume 0 == ~mode1~0 % 256; 514#L166 assume ~id2~0 >= 0; 523#L167 assume 0 == ~st2~0; 506#L168 assume ~send2~0 == ~id2~0; 507#L169 assume 0 == ~mode2~0 % 256; 558#L170 assume ~id3~0 >= 0; 543#L171 assume 0 == ~st3~0; 541#L172 assume ~send3~0 == ~id3~0; 542#L173 assume 0 == ~mode3~0 % 256; 554#L174 assume ~id4~0 >= 0; 499#L175 assume 0 == ~st4~0; 500#L176 assume ~send4~0 == ~id4~0; 544#L177 assume 0 == ~mode4~0 % 256; 535#L178 assume ~id1~0 != ~id2~0; 536#L179 assume ~id1~0 != ~id3~0; 493#L180 assume ~id1~0 != ~id4~0; 494#L181 assume ~id2~0 != ~id3~0; 530#L182 assume ~id2~0 != ~id4~0; 531#L183 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 508#L161-1 init_#res#1 := init_~tmp~0#1; 509#L254 main_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1; 510#L310 assume !(0 == main_~i2~0#1); 495#L310-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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 496#L320-2 [2022-11-23 03:29:49,084 INFO L750 eck$LassoCheckResult]: Loop: 496#L320-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 579#L61 assume !(0 != ~mode1~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);~mode1~0 := 1; 552#L61-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; 574#L87 assume !(0 != ~mode2~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);~mode2~0 := 1; 571#L87-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; 569#L112 assume !(0 != ~mode3~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);~mode3~0 := 1; 567#L112-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 563#L137 assume !(0 != ~mode4~0 % 256);~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256);~mode4~0 := 1; 561#L137-2 assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 560#L262 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 559#L263 assume !(~r1~0 >= 4); 515#L266 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 516#L267 assume ~r1~0 < 4;check_~tmp~1#1 := 1; 583#L262-1 check_#res#1 := check_~tmp~1#1; 582#L282 main_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret22#1;havoc main_#t~ret22#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; 581#L347 assume !(0 == assert_~arg#1 % 256); 580#L342 assume { :end_inline_assert } true;main_#t~post23#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post23#1;havoc main_#t~post23#1; 496#L320-2 [2022-11-23 03:29:49,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:29:49,084 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 3 times [2022-11-23 03:29:49,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:29:49,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226629740] [2022-11-23 03:29:49,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:29:49,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:29:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:29:49,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:29:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:29:49,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:29:49,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:29:49,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1705012855, now seen corresponding path program 1 times [2022-11-23 03:29:49,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:29:49,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380804259] [2022-11-23 03:29:49,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:29:49,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:29:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:29:49,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:29:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:29:49,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:29:49,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:29:49,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1742065361, now seen corresponding path program 1 times [2022-11-23 03:29:49,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:29:49,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941354235] [2022-11-23 03:29:49,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:29:49,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:29:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:29:49,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:29:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:29:49,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:29:52,911 INFO L210 LassoAnalysis]: Preferences: [2022-11-23 03:29:52,911 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-23 03:29:52,911 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-23 03:29:52,912 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-23 03:29:52,912 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-23 03:29:52,912 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:29:52,912 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-23 03:29:52,912 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-23 03:29:52,913 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.ufo.BOUNDED-8.pals.c_Iteration4_Loop [2022-11-23 03:29:52,913 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-23 03:29:52,913 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-23 03:29:52,953 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:29:52,965 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:29:52,972 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:29:52,976 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:29:52,979 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:29:52,981 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:29:52,986 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:29:52,992 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:29:54,577 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:29:54,590 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:29:54,598 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:29:54,603 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:29:56,137 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 22