./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c0daee-102f-4869-8927-6c3b66fd6fb8/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c0daee-102f-4869-8927-6c3b66fd6fb8/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c0daee-102f-4869-8927-6c3b66fd6fb8/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c0daee-102f-4869-8927-6c3b66fd6fb8/bin/uautomizer-tPACEb0tL8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c0daee-102f-4869-8927-6c3b66fd6fb8/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c0daee-102f-4869-8927-6c3b66fd6fb8/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:43:47,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:43:47,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:43:47,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:43:47,270 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:43:47,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:43:47,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:43:47,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:43:47,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:43:47,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:43:47,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:43:47,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:43:47,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:43:47,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:43:47,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:43:47,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:43:47,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:43:47,287 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:43:47,289 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:43:47,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:43:47,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:43:47,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:43:47,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:43:47,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:43:47,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:43:47,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:43:47,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:43:47,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:43:47,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:43:47,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:43:47,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:43:47,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:43:47,328 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:43:47,329 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:43:47,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:43:47,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:43:47,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:43:47,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:43:47,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:43:47,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:43:47,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:43:47,335 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c0daee-102f-4869-8927-6c3b66fd6fb8/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-16 11:43:47,363 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:43:47,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:43:47,364 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:43:47,364 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:43:47,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:43:47,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:43:47,366 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:43:47,367 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-16 11:43:47,367 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-16 11:43:47,367 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-16 11:43:47,368 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-16 11:43:47,368 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-16 11:43:47,368 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-16 11:43:47,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:43:47,369 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:43:47,369 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:43:47,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:43:47,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:43:47,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:43:47,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-16 11:43:47,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-16 11:43:47,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-16 11:43:47,372 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:43:47,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:43:47,372 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-16 11:43:47,373 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:43:47,373 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-16 11:43:47,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:43:47,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:43:47,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:43:47,374 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:43:47,376 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-16 11:43:47,376 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_59c0daee-102f-4869-8927-6c3b66fd6fb8/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c0daee-102f-4869-8927-6c3b66fd6fb8/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 [2022-11-16 11:43:47,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:43:47,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:43:47,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:43:47,774 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:43:47,775 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:43:47,777 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c0daee-102f-4869-8927-6c3b66fd6fb8/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2022-11-16 11:43:47,868 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c0daee-102f-4869-8927-6c3b66fd6fb8/bin/uautomizer-tPACEb0tL8/data/4d644a235/a5137b81fbe44fee9a38b021cd9aab19/FLAG547349728 [2022-11-16 11:43:48,410 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:43:48,410 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c0daee-102f-4869-8927-6c3b66fd6fb8/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2022-11-16 11:43:48,421 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c0daee-102f-4869-8927-6c3b66fd6fb8/bin/uautomizer-tPACEb0tL8/data/4d644a235/a5137b81fbe44fee9a38b021cd9aab19/FLAG547349728 [2022-11-16 11:43:48,705 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c0daee-102f-4869-8927-6c3b66fd6fb8/bin/uautomizer-tPACEb0tL8/data/4d644a235/a5137b81fbe44fee9a38b021cd9aab19 [2022-11-16 11:43:48,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:43:48,709 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:43:48,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:43:48,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:43:48,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:43:48,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:43:48" (1/1) ... [2022-11-16 11:43:48,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a4daba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:48, skipping insertion in model container [2022-11-16 11:43:48,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:43:48" (1/1) ... [2022-11-16 11:43:48,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:43:48,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:43:49,047 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c0daee-102f-4869-8927-6c3b66fd6fb8/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c[5984,5997] [2022-11-16 11:43:49,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:43:49,060 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:43:49,147 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c0daee-102f-4869-8927-6c3b66fd6fb8/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c[5984,5997] [2022-11-16 11:43:49,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:43:49,168 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:43:49,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:49 WrapperNode [2022-11-16 11:43:49,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:43:49,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:43:49,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:43:49,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:43:49,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:49" (1/1) ... [2022-11-16 11:43:49,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:49" (1/1) ... [2022-11-16 11:43:49,221 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2022-11-16 11:43:49,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:43:49,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:43:49,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:43:49,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:43:49,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:49" (1/1) ... [2022-11-16 11:43:49,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:49" (1/1) ... [2022-11-16 11:43:49,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:49" (1/1) ... [2022-11-16 11:43:49,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:49" (1/1) ... [2022-11-16 11:43:49,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:49" (1/1) ... [2022-11-16 11:43:49,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:49" (1/1) ... [2022-11-16 11:43:49,250 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:49" (1/1) ... [2022-11-16 11:43:49,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:49" (1/1) ... [2022-11-16 11:43:49,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:43:49,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:43:49,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:43:49,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:43:49,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:49" (1/1) ... [2022-11-16 11:43:49,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:43:49,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c0daee-102f-4869-8927-6c3b66fd6fb8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:43:49,295 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c0daee-102f-4869-8927-6c3b66fd6fb8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:43:49,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59c0daee-102f-4869-8927-6c3b66fd6fb8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-16 11:43:49,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:43:49,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:43:49,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:43:49,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:43:49,405 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:43:49,408 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:43:49,726 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:43:49,733 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:43:49,734 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 11:43:49,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:43:49 BoogieIcfgContainer [2022-11-16 11:43:49,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:43:49,737 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-16 11:43:49,737 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-16 11:43:49,743 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-16 11:43:49,744 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:43:49,744 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 11:43:48" (1/3) ... [2022-11-16 11:43:49,745 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@661fa616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 11:43:49, skipping insertion in model container [2022-11-16 11:43:49,745 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:43:49,745 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:49" (2/3) ... [2022-11-16 11:43:49,746 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@661fa616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 11:43:49, skipping insertion in model container [2022-11-16 11:43:49,746 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:43:49,746 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:43:49" (3/3) ... [2022-11-16 11:43:49,748 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2022-11-16 11:43:49,832 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-16 11:43:49,832 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-16 11:43:49,832 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-16 11:43:49,833 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-16 11:43:49,833 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-16 11:43:49,833 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-16 11:43:49,833 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-16 11:43:49,833 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-16 11:43:49,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 54 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:49,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2022-11-16 11:43:49,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:43:49,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:43:49,877 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:49,877 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:49,877 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-16 11:43:49,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 54 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:49,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2022-11-16 11:43:49,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:43:49,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:43:49,883 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:49,883 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:49,891 INFO L748 eck$LassoCheckResult]: Stem: 38#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(34, 2);call #Ultimate.allocInit(12, 3);~p1~0 := 0;~nomsg~0 := -1;~p2~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p2_old~0 := 0;~send1~0 := 0;~send2~0 := 0;~p2_new~0 := 0;~send3~0 := 0;~st2~0 := 0;~st1~0 := 0;~p3_old~0 := 0;~st3~0 := 0;~id2~0 := 0;~p1_old~0 := 0;~id1~0 := 0;~id3~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 31#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~ret17#1, main_#t~ret18#1, main_#t~post19#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;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 36#L131true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 21#L131-1true init_#res#1 := init_~tmp~0#1; 53#L196true main_#t~ret17#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret17#1;havoc main_#t~ret17#1; 54#L248true assume !(0 == main_~i2~0#1); 25#L248-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; 11#L256-2true [2022-11-16 11:43:49,892 INFO L750 eck$LassoCheckResult]: Loop: 11#L256-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; 3#L54true 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; 12#L54-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; 18#L82true 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; 49#L82-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; 44#L107true 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; 55#L107-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; 32#L204true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 43#L204-1true check_#res#1 := check_~tmp~1#1; 13#L224true main_#t~ret18#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret18#1;havoc main_#t~ret18#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; 20#L280true assume !(0 == assert_~arg#1 % 256); 34#L275true assume { :end_inline_assert } true;main_#t~post19#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 11#L256-2true [2022-11-16 11:43:49,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:49,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2022-11-16 11:43:49,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:49,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651315396] [2022-11-16 11:43:49,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:49,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:50,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:43:50,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:50,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651315396] [2022-11-16 11:43:50,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651315396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:50,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:50,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:43:50,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226948793] [2022-11-16 11:43:50,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:50,168 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:43:50,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:50,170 INFO L85 PathProgramCache]: Analyzing trace with hash 317704902, now seen corresponding path program 1 times [2022-11-16 11:43:50,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:50,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491578437] [2022-11-16 11:43:50,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:50,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:50,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:43:50,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:50,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491578437] [2022-11-16 11:43:50,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491578437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:50,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:50,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:43:50,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825993694] [2022-11-16 11:43:50,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:50,680 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:43:50,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:50,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:43:50,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:43:50,729 INFO L87 Difference]: Start difference. First operand has 55 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 54 states have internal predecessors, (91), 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-16 11:43:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:50,872 INFO L93 Difference]: Finished difference Result 87 states and 136 transitions. [2022-11-16 11:43:50,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 136 transitions. [2022-11-16 11:43:50,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-11-16 11:43:50,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 78 states and 112 transitions. [2022-11-16 11:43:50,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2022-11-16 11:43:50,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2022-11-16 11:43:50,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 112 transitions. [2022-11-16 11:43:50,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:43:50,906 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 112 transitions. [2022-11-16 11:43:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 112 transitions. [2022-11-16 11:43:50,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2022-11-16 11:43:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.34) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-11-16 11:43:50,948 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-11-16 11:43:50,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:43:50,955 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-11-16 11:43:50,955 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-16 11:43:50,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 67 transitions. [2022-11-16 11:43:50,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-11-16 11:43:50,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:43:50,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:43:50,959 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] [2022-11-16 11:43:50,959 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:50,960 INFO L748 eck$LassoCheckResult]: Stem: 206#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(34, 2);call #Ultimate.allocInit(12, 3);~p1~0 := 0;~nomsg~0 := -1;~p2~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p2_old~0 := 0;~send1~0 := 0;~send2~0 := 0;~p2_new~0 := 0;~send3~0 := 0;~st2~0 := 0;~st1~0 := 0;~p3_old~0 := 0;~st3~0 := 0;~id2~0 := 0;~p1_old~0 := 0;~id1~0 := 0;~id3~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 198#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~ret17#1, main_#t~ret18#1, main_#t~post19#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;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 199#L131 assume 0 == ~r1~0; 204#L132 assume ~id1~0 >= 0; 202#L133 assume 0 == ~st1~0; 203#L134 assume ~send1~0 == ~id1~0; 196#L135 assume 0 == ~mode1~0 % 256; 179#L136 assume ~id2~0 >= 0; 180#L137 assume 0 == ~st2~0; 208#L138 assume ~send2~0 == ~id2~0; 189#L139 assume 0 == ~mode2~0 % 256; 190#L140 assume ~id3~0 >= 0; 205#L141 assume 0 == ~st3~0; 192#L142 assume ~send3~0 == ~id3~0; 191#L143 assume 0 == ~mode3~0 % 256; 169#L144 assume ~id1~0 != ~id2~0; 170#L145 assume ~id1~0 != ~id3~0; 182#L146 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 183#L131-1 init_#res#1 := init_~tmp~0#1; 188#L196 main_#t~ret17#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret17#1;havoc main_#t~ret17#1; 209#L248 assume !(0 == main_~i2~0#1); 193#L248-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; 176#L256-2 [2022-11-16 11:43:50,960 INFO L750 eck$LassoCheckResult]: Loop: 176#L256-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; 160#L54 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; 162#L54-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; 175#L82 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; 186#L82-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; 207#L107 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; 181#L107-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; 200#L204 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 197#L204-1 check_#res#1 := check_~tmp~1#1; 177#L224 main_#t~ret18#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret18#1;havoc main_#t~ret18#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; 178#L280 assume !(0 == assert_~arg#1 % 256); 187#L275 assume { :end_inline_assert } true;main_#t~post19#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 176#L256-2 [2022-11-16 11:43:50,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:50,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2022-11-16 11:43:50,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:50,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436300204] [2022-11-16 11:43:50,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:50,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:43:50,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:43:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:43:51,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:43:51,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:51,032 INFO L85 PathProgramCache]: Analyzing trace with hash 317704902, now seen corresponding path program 2 times [2022-11-16 11:43:51,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:51,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140173749] [2022-11-16 11:43:51,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:51,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:43:51,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:51,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140173749] [2022-11-16 11:43:51,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140173749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:51,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:51,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:43:51,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018397276] [2022-11-16 11:43:51,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:51,244 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:43:51,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:51,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:43:51,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:43:51,246 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. cyclomatic complexity: 18 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:51,305 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2022-11-16 11:43:51,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 69 transitions. [2022-11-16 11:43:51,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-11-16 11:43:51,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 50 states and 64 transitions. [2022-11-16 11:43:51,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2022-11-16 11:43:51,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2022-11-16 11:43:51,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 64 transitions. [2022-11-16 11:43:51,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:43:51,309 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-11-16 11:43:51,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 64 transitions. [2022-11-16 11:43:51,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-16 11:43:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.28) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-11-16 11:43:51,314 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-11-16 11:43:51,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:43:51,316 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-11-16 11:43:51,316 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-16 11:43:51,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 64 transitions. [2022-11-16 11:43:51,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-11-16 11:43:51,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:43:51,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:43:51,318 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] [2022-11-16 11:43:51,318 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:51,325 INFO L748 eck$LassoCheckResult]: Stem: 321#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(34, 2);call #Ultimate.allocInit(12, 3);~p1~0 := 0;~nomsg~0 := -1;~p2~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p2_old~0 := 0;~send1~0 := 0;~send2~0 := 0;~p2_new~0 := 0;~send3~0 := 0;~st2~0 := 0;~st1~0 := 0;~p3_old~0 := 0;~st3~0 := 0;~id2~0 := 0;~p1_old~0 := 0;~id1~0 := 0;~id3~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 312#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~ret17#1, main_#t~ret18#1, main_#t~post19#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;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 313#L131 assume 0 == ~r1~0; 319#L132 assume ~id1~0 >= 0; 317#L133 assume 0 == ~st1~0; 318#L134 assume ~send1~0 == ~id1~0; 311#L135 assume 0 == ~mode1~0 % 256; 294#L136 assume ~id2~0 >= 0; 295#L137 assume 0 == ~st2~0; 323#L138 assume ~send2~0 == ~id2~0; 304#L139 assume 0 == ~mode2~0 % 256; 305#L140 assume ~id3~0 >= 0; 320#L141 assume 0 == ~st3~0; 307#L142 assume ~send3~0 == ~id3~0; 306#L143 assume 0 == ~mode3~0 % 256; 284#L144 assume ~id1~0 != ~id2~0; 285#L145 assume ~id1~0 != ~id3~0; 297#L146 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 298#L131-1 init_#res#1 := init_~tmp~0#1; 303#L196 main_#t~ret17#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret17#1;havoc main_#t~ret17#1; 324#L248 assume !(0 == main_~i2~0#1); 308#L248-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; 290#L256-2 [2022-11-16 11:43:51,326 INFO L750 eck$LassoCheckResult]: Loop: 290#L256-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; 275#L54 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; 277#L54-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; 291#L82 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; 301#L82-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; 322#L107 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; 296#L107-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; 314#L204 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 286#L205 assume ~r1~0 >= 3; 287#L209 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 315#L204-1 check_#res#1 := check_~tmp~1#1; 292#L224 main_#t~ret18#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret18#1;havoc main_#t~ret18#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; 293#L280 assume !(0 == assert_~arg#1 % 256); 302#L275 assume { :end_inline_assert } true;main_#t~post19#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 290#L256-2 [2022-11-16 11:43:51,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:51,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2022-11-16 11:43:51,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:51,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504582332] [2022-11-16 11:43:51,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:51,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:43:51,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:43:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:43:51,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:43:51,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:51,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1044091498, now seen corresponding path program 1 times [2022-11-16 11:43:51,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:51,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220399800] [2022-11-16 11:43:51,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:51,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:51,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:43:51,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:51,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220399800] [2022-11-16 11:43:51,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220399800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:51,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:51,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:43:51,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341047925] [2022-11-16 11:43:51,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:51,453 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:43:51,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:51,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:43:51,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:43:51,456 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-16 11:43:51,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:51,513 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2022-11-16 11:43:51,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 95 transitions. [2022-11-16 11:43:51,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-11-16 11:43:51,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 95 transitions. [2022-11-16 11:43:51,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2022-11-16 11:43:51,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2022-11-16 11:43:51,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 95 transitions. [2022-11-16 11:43:51,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:43:51,518 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-11-16 11:43:51,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 95 transitions. [2022-11-16 11:43:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-16 11:43:51,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 71 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2022-11-16 11:43:51,524 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-11-16 11:43:51,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:51,526 INFO L428 stractBuchiCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-11-16 11:43:51,526 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-16 11:43:51,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 95 transitions. [2022-11-16 11:43:51,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-11-16 11:43:51,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:43:51,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:43:51,552 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] [2022-11-16 11:43:51,553 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:51,553 INFO L748 eck$LassoCheckResult]: Stem: 451#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(34, 2);call #Ultimate.allocInit(12, 3);~p1~0 := 0;~nomsg~0 := -1;~p2~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p2_old~0 := 0;~send1~0 := 0;~send2~0 := 0;~p2_new~0 := 0;~send3~0 := 0;~st2~0 := 0;~st1~0 := 0;~p3_old~0 := 0;~st3~0 := 0;~id2~0 := 0;~p1_old~0 := 0;~id1~0 := 0;~id3~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 441#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~ret17#1, main_#t~ret18#1, main_#t~post19#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;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 442#L131 assume 0 == ~r1~0; 449#L132 assume ~id1~0 >= 0; 447#L133 assume 0 == ~st1~0; 448#L134 assume ~send1~0 == ~id1~0; 438#L135 assume 0 == ~mode1~0 % 256; 421#L136 assume ~id2~0 >= 0; 422#L137 assume 0 == ~st2~0; 456#L138 assume ~send2~0 == ~id2~0; 431#L139 assume 0 == ~mode2~0 % 256; 432#L140 assume ~id3~0 >= 0; 450#L141 assume 0 == ~st3~0; 434#L142 assume ~send3~0 == ~id3~0; 433#L143 assume 0 == ~mode3~0 % 256; 412#L144 assume ~id1~0 != ~id2~0; 413#L145 assume ~id1~0 != ~id3~0; 424#L146 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 425#L131-1 init_#res#1 := init_~tmp~0#1; 430#L196 main_#t~ret17#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret17#1;havoc main_#t~ret17#1; 457#L248 assume !(0 == main_~i2~0#1); 435#L248-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; 417#L256-2 [2022-11-16 11:43:51,554 INFO L750 eck$LassoCheckResult]: Loop: 417#L256-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; 403#L54 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; 405#L54-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; 418#L82 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; 428#L82-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; 454#L107 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; 423#L107-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; 444#L204 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 445#L205 assume !(~r1~0 >= 3); 439#L208 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 440#L209 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 452#L204-1 check_#res#1 := check_~tmp~1#1; 453#L224 main_#t~ret18#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret18#1;havoc main_#t~ret18#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; 474#L280 assume !(0 == assert_~arg#1 % 256); 473#L275 assume { :end_inline_assert } true;main_#t~post19#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 417#L256-2 [2022-11-16 11:43:51,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:51,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2022-11-16 11:43:51,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:51,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98579006] [2022-11-16 11:43:51,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:51,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:43:51,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:43:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:43:51,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:43:51,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:51,602 INFO L85 PathProgramCache]: Analyzing trace with hash -655493558, now seen corresponding path program 1 times [2022-11-16 11:43:51,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:51,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007970846] [2022-11-16 11:43:51,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:51,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:43:51,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:43:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:43:51,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:43:51,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:51,688 INFO L85 PathProgramCache]: Analyzing trace with hash 214545420, now seen corresponding path program 1 times [2022-11-16 11:43:51,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:51,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793196259] [2022-11-16 11:43:51,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:51,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:43:51,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:43:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:43:51,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:43:54,268 INFO L210 LassoAnalysis]: Preferences: [2022-11-16 11:43:54,269 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-16 11:43:54,269 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-16 11:43:54,270 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-16 11:43:54,270 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-16 11:43:54,270 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:43:54,270 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-16 11:43:54,270 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-16 11:43:54,270 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-11-16 11:43:54,271 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-16 11:43:54,271 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-16 11:43:54,307 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:43:54,323 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:43:54,332 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:43:54,336 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:43:54,340 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:43:54,347 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:43:54,358 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:43:54,361 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:43:54,386 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:43:55,498 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:43:55,511 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:43:56,953 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 17 [2022-11-16 11:44:17,393 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 403326 conjuctions. This might take some time...