./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dc6204b-e5f6-4dd8-a497-55dc2d2f6737/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dc6204b-e5f6-4dd8-a497-55dc2d2f6737/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dc6204b-e5f6-4dd8-a497-55dc2d2f6737/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dc6204b-e5f6-4dd8-a497-55dc2d2f6737/bin/uautomizer-ZsLfNo2U6R/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dc6204b-e5f6-4dd8-a497-55dc2d2f6737/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dc6204b-e5f6-4dd8-a497-55dc2d2f6737/bin/uautomizer-ZsLfNo2U6R --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 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 --- 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-38b53e6 [2022-11-25 16:45:07,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:45:07,235 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:45:07,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:45:07,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:45:07,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:45:07,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:45:07,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:45:07,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:45:07,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:45:07,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:45:07,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:45:07,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:45:07,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:45:07,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:45:07,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:45:07,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:45:07,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:45:07,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:45:07,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:45:07,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:45:07,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:45:07,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:45:07,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:45:07,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:45:07,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:45:07,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:45:07,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:45:07,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:45:07,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:45:07,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:45:07,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:45:07,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:45:07,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:45:07,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:45:07,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:45:07,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:45:07,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:45:07,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:45:07,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:45:07,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:45:07,304 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dc6204b-e5f6-4dd8-a497-55dc2d2f6737/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-25 16:45:07,327 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:45:07,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:45:07,328 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:45:07,329 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:45:07,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:45:07,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:45:07,330 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:45:07,331 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-25 16:45:07,331 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-25 16:45:07,331 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-25 16:45:07,332 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-25 16:45:07,332 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-25 16:45:07,332 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-25 16:45:07,332 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:45:07,333 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:45:07,333 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:45:07,333 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:45:07,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:45:07,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:45:07,334 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-25 16:45:07,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-25 16:45:07,335 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-25 16:45:07,335 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:45:07,335 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:45:07,335 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-25 16:45:07,336 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:45:07,336 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-25 16:45:07,336 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:45:07,337 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:45:07,337 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:45:07,337 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:45:07,338 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-25 16:45:07,339 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_0dc6204b-e5f6-4dd8-a497-55dc2d2f6737/bin/uautomizer-ZsLfNo2U6R/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_0dc6204b-e5f6-4dd8-a497-55dc2d2f6737/bin/uautomizer-ZsLfNo2U6R 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 -> 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 [2022-11-25 16:45:07,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:45:07,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:45:07,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:45:07,693 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:45:07,694 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:45:07,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dc6204b-e5f6-4dd8-a497-55dc2d2f6737/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2022-11-25 16:45:10,800 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:45:11,005 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:45:11,005 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dc6204b-e5f6-4dd8-a497-55dc2d2f6737/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2022-11-25 16:45:11,015 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dc6204b-e5f6-4dd8-a497-55dc2d2f6737/bin/uautomizer-ZsLfNo2U6R/data/4379411ca/37ae8286072545aaaaa32ff0471b24ea/FLAG4c7964d06 [2022-11-25 16:45:11,034 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dc6204b-e5f6-4dd8-a497-55dc2d2f6737/bin/uautomizer-ZsLfNo2U6R/data/4379411ca/37ae8286072545aaaaa32ff0471b24ea [2022-11-25 16:45:11,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:45:11,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:45:11,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:45:11,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:45:11,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:45:11,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:45:11" (1/1) ... [2022-11-25 16:45:11,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7308e989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:11, skipping insertion in model container [2022-11-25 16:45:11,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:45:11" (1/1) ... [2022-11-25 16:45:11,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:45:11,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:45:11,301 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_0dc6204b-e5f6-4dd8-a497-55dc2d2f6737/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2022-11-25 16:45:11,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:45:11,324 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:45:11,359 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_0dc6204b-e5f6-4dd8-a497-55dc2d2f6737/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2022-11-25 16:45:11,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:45:11,374 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:45:11,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:11 WrapperNode [2022-11-25 16:45:11,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:45:11,376 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:45:11,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:45:11,376 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:45:11,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:11" (1/1) ... [2022-11-25 16:45:11,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:11" (1/1) ... [2022-11-25 16:45:11,415 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 197 [2022-11-25 16:45:11,416 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:45:11,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:45:11,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:45:11,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:45:11,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:11" (1/1) ... [2022-11-25 16:45:11,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:11" (1/1) ... [2022-11-25 16:45:11,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:11" (1/1) ... [2022-11-25 16:45:11,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:11" (1/1) ... [2022-11-25 16:45:11,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:11" (1/1) ... [2022-11-25 16:45:11,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:11" (1/1) ... [2022-11-25 16:45:11,438 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:11" (1/1) ... [2022-11-25 16:45:11,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:11" (1/1) ... [2022-11-25 16:45:11,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:45:11,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:45:11,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:45:11,443 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:45:11,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:11" (1/1) ... [2022-11-25 16:45:11,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:45:11,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dc6204b-e5f6-4dd8-a497-55dc2d2f6737/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:45:11,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dc6204b-e5f6-4dd8-a497-55dc2d2f6737/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:45:11,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dc6204b-e5f6-4dd8-a497-55dc2d2f6737/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-25 16:45:11,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:45:11,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:45:11,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:45:11,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:45:11,695 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:45:11,697 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:45:12,058 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:45:12,066 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:45:12,079 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 16:45:12,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:45:12 BoogieIcfgContainer [2022-11-25 16:45:12,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:45:12,082 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-25 16:45:12,083 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-25 16:45:12,087 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-25 16:45:12,088 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 16:45:12,088 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 04:45:11" (1/3) ... [2022-11-25 16:45:12,089 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7162ba0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 04:45:12, skipping insertion in model container [2022-11-25 16:45:12,089 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 16:45:12,089 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:45:11" (2/3) ... [2022-11-25 16:45:12,089 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7162ba0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 04:45:12, skipping insertion in model container [2022-11-25 16:45:12,089 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 16:45:12,089 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:45:12" (3/3) ... [2022-11-25 16:45:12,091 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2022-11-25 16:45:12,147 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-25 16:45:12,148 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-25 16:45:12,148 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-25 16:45:12,148 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-25 16:45:12,148 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-25 16:45:12,148 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-25 16:45:12,148 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-25 16:45:12,148 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-25 16:45:12,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 57 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 56 states have internal predecessors, (94), 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-25 16:45:12,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2022-11-25 16:45:12,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:45:12,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:45:12,176 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:45:12,176 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:45:12,177 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-25 16:45:12,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 57 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 56 states have internal predecessors, (94), 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-25 16:45:12,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2022-11-25 16:45:12,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:45:12,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:45:12,182 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:45:12,182 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:45:12,190 INFO L748 eck$LassoCheckResult]: Stem: 43#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);~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; 34#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~ret17#1, main_#t~ret18#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; 50#L137true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 8#L137-1true init_#res#1 := init_~tmp~0#1; 12#L202true 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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 35#L22true assume !(0 == assume_abort_if_not_~cond#1); 22#L21true assume { :end_inline_assume_abort_if_not } true;~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; 3#L262-2true [2022-11-25 16:45:12,191 INFO L750 eck$LassoCheckResult]: Loop: 3#L262-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 55#L57true 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; 45#L57-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 19#L88true 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; 10#L88-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; 37#L113true 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; 40#L113-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; 7#L210true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 23#L210-1true check_#res#1 := check_~tmp~1#1; 6#L230true 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; 41#L285true assume !(0 == assert_~arg#1 % 256); 20#L280true assume { :end_inline_assert } true; 3#L262-2true [2022-11-25 16:45:12,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:45:12,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2022-11-25 16:45:12,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:45:12,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374013279] [2022-11-25 16:45:12,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:45:12,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:45:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:12,557 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-25 16:45:12,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:45:12,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374013279] [2022-11-25 16:45:12,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374013279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:45:12,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:45:12,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:45:12,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643460542] [2022-11-25 16:45:12,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:45:12,574 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 16:45:12,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:45:12,578 INFO L85 PathProgramCache]: Analyzing trace with hash 920486509, now seen corresponding path program 1 times [2022-11-25 16:45:12,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:45:12,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94855895] [2022-11-25 16:45:12,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:45:12,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:45:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:12,869 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-25 16:45:12,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:45:12,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94855895] [2022-11-25 16:45:12,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94855895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:45:12,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:45:12,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:45:12,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769450611] [2022-11-25 16:45:12,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:45:12,876 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:45:12,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:45:12,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:45:12,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:45:12,929 INFO L87 Difference]: Start difference. First operand has 57 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 56 states have internal predecessors, (94), 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-25 16:45:13,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:45:13,050 INFO L93 Difference]: Finished difference Result 56 states and 89 transitions. [2022-11-25 16:45:13,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 89 transitions. [2022-11-25 16:45:13,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2022-11-25 16:45:13,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 52 states and 70 transitions. [2022-11-25 16:45:13,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2022-11-25 16:45:13,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2022-11-25 16:45:13,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 70 transitions. [2022-11-25 16:45:13,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:45:13,065 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 70 transitions. [2022-11-25 16:45:13,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 70 transitions. [2022-11-25 16:45:13,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-25 16:45:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 51 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:45:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2022-11-25 16:45:13,107 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 70 transitions. [2022-11-25 16:45:13,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:45:13,118 INFO L428 stractBuchiCegarLoop]: Abstraction has 52 states and 70 transitions. [2022-11-25 16:45:13,119 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-25 16:45:13,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 70 transitions. [2022-11-25 16:45:13,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2022-11-25 16:45:13,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:45:13,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:45:13,128 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-25 16:45:13,128 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:45:13,129 INFO L748 eck$LassoCheckResult]: Stem: 178#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);~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; 175#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_~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; 176#L137 assume 0 == ~r1~0 % 256; 181#L138 assume ~id1~0 >= 0; 166#L139 assume 0 == ~st1~0; 167#L140 assume ~send1~0 == ~id1~0; 177#L141 assume 0 == ~mode1~0 % 256; 171#L142 assume ~id2~0 >= 0; 170#L143 assume 0 == ~st2~0; 136#L144 assume ~send2~0 == ~id2~0; 137#L145 assume 0 == ~mode2~0 % 256; 152#L146 assume ~id3~0 >= 0; 153#L147 assume 0 == ~st3~0; 168#L148 assume ~send3~0 == ~id3~0; 160#L149 assume 0 == ~mode3~0 % 256; 161#L150 assume ~id1~0 != ~id2~0; 149#L151 assume ~id1~0 != ~id3~0; 150#L152 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 143#L137-1 init_#res#1 := init_~tmp~0#1; 144#L202 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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 151#L22 assume !(0 == assume_abort_if_not_~cond#1); 165#L21 assume { :end_inline_assume_abort_if_not } true;~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; 131#L262-2 [2022-11-25 16:45:13,130 INFO L750 eck$LassoCheckResult]: Loop: 131#L262-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 132#L57 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; 179#L57-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 162#L88 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; 147#L88-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; 148#L113 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; 169#L113-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; 140#L210 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 141#L210-1 check_#res#1 := check_~tmp~1#1; 138#L230 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; 139#L285 assume !(0 == assert_~arg#1 % 256); 163#L280 assume { :end_inline_assert } true; 131#L262-2 [2022-11-25 16:45:13,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:45:13,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2022-11-25 16:45:13,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:45:13,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111838942] [2022-11-25 16:45:13,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:45:13,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:45:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:45:13,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:45:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:45:13,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:45:13,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:45:13,258 INFO L85 PathProgramCache]: Analyzing trace with hash 920486509, now seen corresponding path program 2 times [2022-11-25 16:45:13,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:45:13,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084036563] [2022-11-25 16:45:13,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:45:13,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:45:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:13,461 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-25 16:45:13,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:45:13,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084036563] [2022-11-25 16:45:13,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084036563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:45:13,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:45:13,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:45:13,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326846538] [2022-11-25 16:45:13,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:45:13,472 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:45:13,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:45:13,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:45:13,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:45:13,473 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. cyclomatic complexity: 19 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-25 16:45:13,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:45:13,554 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2022-11-25 16:45:13,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 72 transitions. [2022-11-25 16:45:13,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2022-11-25 16:45:13,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 52 states and 67 transitions. [2022-11-25 16:45:13,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2022-11-25 16:45:13,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2022-11-25 16:45:13,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 67 transitions. [2022-11-25 16:45:13,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:45:13,563 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-11-25 16:45:13,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 67 transitions. [2022-11-25 16:45:13,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-25 16:45:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 51 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-25 16:45:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-11-25 16:45:13,570 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-11-25 16:45:13,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:45:13,572 INFO L428 stractBuchiCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-11-25 16:45:13,572 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-25 16:45:13,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 67 transitions. [2022-11-25 16:45:13,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2022-11-25 16:45:13,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:45:13,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:45:13,576 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-25 16:45:13,576 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:45:13,576 INFO L748 eck$LassoCheckResult]: Stem: 297#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);~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; 294#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_~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; 295#L137 assume 0 == ~r1~0 % 256; 300#L138 assume ~id1~0 >= 0; 285#L139 assume 0 == ~st1~0; 286#L140 assume ~send1~0 == ~id1~0; 296#L141 assume 0 == ~mode1~0 % 256; 290#L142 assume ~id2~0 >= 0; 289#L143 assume 0 == ~st2~0; 255#L144 assume ~send2~0 == ~id2~0; 256#L145 assume 0 == ~mode2~0 % 256; 270#L146 assume ~id3~0 >= 0; 271#L147 assume 0 == ~st3~0; 287#L148 assume ~send3~0 == ~id3~0; 278#L149 assume 0 == ~mode3~0 % 256; 279#L150 assume ~id1~0 != ~id2~0; 267#L151 assume ~id1~0 != ~id3~0; 268#L152 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 261#L137-1 init_#res#1 := init_~tmp~0#1; 262#L202 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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 269#L22 assume !(0 == assume_abort_if_not_~cond#1); 283#L21 assume { :end_inline_assume_abort_if_not } true;~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; 250#L262-2 [2022-11-25 16:45:13,577 INFO L750 eck$LassoCheckResult]: Loop: 250#L262-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 251#L57 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; 298#L57-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 280#L88 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; 265#L88-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; 266#L113 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; 288#L113-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; 259#L210 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 260#L211 assume ~r1~0 % 256 >= 3; 291#L215 assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; 284#L210-1 check_#res#1 := check_~tmp~1#1; 257#L230 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; 258#L285 assume !(0 == assert_~arg#1 % 256); 281#L280 assume { :end_inline_assert } true; 250#L262-2 [2022-11-25 16:45:13,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:45:13,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2022-11-25 16:45:13,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:45:13,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199300925] [2022-11-25 16:45:13,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:45:13,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:45:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:45:13,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:45:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:45:13,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:45:13,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:45:13,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1591551907, now seen corresponding path program 1 times [2022-11-25 16:45:13,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:45:13,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181002181] [2022-11-25 16:45:13,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:45:13,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:45:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:45:13,640 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-25 16:45:13,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:45:13,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181002181] [2022-11-25 16:45:13,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181002181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:45:13,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:45:13,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:45:13,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491090348] [2022-11-25 16:45:13,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:45:13,643 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:45:13,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:45:13,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:45:13,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:45:13,646 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. cyclomatic complexity: 16 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-25 16:45:13,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:45:13,692 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2022-11-25 16:45:13,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 101 transitions. [2022-11-25 16:45:13,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2022-11-25 16:45:13,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 101 transitions. [2022-11-25 16:45:13,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2022-11-25 16:45:13,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2022-11-25 16:45:13,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 101 transitions. [2022-11-25 16:45:13,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:45:13,701 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 101 transitions. [2022-11-25 16:45:13,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 101 transitions. [2022-11-25 16:45:13,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-11-25 16:45:13,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 73 states have internal predecessors, (98), 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-25 16:45:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2022-11-25 16:45:13,709 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 98 transitions. [2022-11-25 16:45:13,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:45:13,710 INFO L428 stractBuchiCegarLoop]: Abstraction has 74 states and 98 transitions. [2022-11-25 16:45:13,711 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-25 16:45:13,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 98 transitions. [2022-11-25 16:45:13,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2022-11-25 16:45:13,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:45:13,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:45:13,714 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-25 16:45:13,714 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:45:13,714 INFO L748 eck$LassoCheckResult]: Stem: 433#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);~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; 429#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_~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; 430#L137 assume 0 == ~r1~0 % 256; 439#L138 assume ~id1~0 >= 0; 420#L139 assume 0 == ~st1~0; 421#L140 assume ~send1~0 == ~id1~0; 432#L141 assume 0 == ~mode1~0 % 256; 426#L142 assume ~id2~0 >= 0; 425#L143 assume 0 == ~st2~0; 389#L144 assume ~send2~0 == ~id2~0; 390#L145 assume 0 == ~mode2~0 % 256; 404#L146 assume ~id3~0 >= 0; 405#L147 assume 0 == ~st3~0; 422#L148 assume ~send3~0 == ~id3~0; 412#L149 assume 0 == ~mode3~0 % 256; 413#L150 assume ~id1~0 != ~id2~0; 401#L151 assume ~id1~0 != ~id3~0; 402#L152 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 395#L137-1 init_#res#1 := init_~tmp~0#1; 396#L202 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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 403#L22 assume !(0 == assume_abort_if_not_~cond#1); 417#L21 assume { :end_inline_assume_abort_if_not } true;~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; 418#L262-2 [2022-11-25 16:45:13,715 INFO L750 eck$LassoCheckResult]: Loop: 418#L262-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 453#L57 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; 438#L57-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 449#L88 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; 447#L88-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; 444#L113 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; 443#L113-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; 442#L210 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 441#L211 assume !(~r1~0 % 256 >= 3); 436#L214 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 437#L215 assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; 457#L210-1 check_#res#1 := check_~tmp~1#1; 456#L230 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; 455#L285 assume !(0 == assert_~arg#1 % 256); 454#L280 assume { :end_inline_assert } true; 418#L262-2 [2022-11-25 16:45:13,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:45:13,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2022-11-25 16:45:13,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:45:13,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876749734] [2022-11-25 16:45:13,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:45:13,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:45:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:45:13,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:45:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:45:13,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:45:13,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:45:13,740 INFO L85 PathProgramCache]: Analyzing trace with hash -446897046, now seen corresponding path program 1 times [2022-11-25 16:45:13,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:45:13,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729603499] [2022-11-25 16:45:13,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:45:13,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:45:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:45:13,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:45:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:45:13,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:45:13,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:45:13,774 INFO L85 PathProgramCache]: Analyzing trace with hash 423141932, now seen corresponding path program 1 times [2022-11-25 16:45:13,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:45:13,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462374863] [2022-11-25 16:45:13,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:45:13,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:45:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:45:13,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:45:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:45:13,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:45:15,636 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:45:15,637 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:45:15,637 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:45:15,637 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:45:15,637 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-25 16:45:15,638 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:45:15,638 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:45:15,638 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:45:15,638 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.1.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-11-25 16:45:15,638 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:45:15,638 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:45:15,682 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-25 16:45:15,697 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-25 16:45:15,702 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-25 16:45:15,708 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-25 16:45:15,712 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-25 16:45:15,715 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:45:15,718 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-25 16:45:15,723 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-25 16:45:16,635 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-25 16:45:17,776 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 17 [2022-11-25 16:45:37,418 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 358992 conjuctions. This might take some time...