./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e10b9d13-4ee4-4c46-a37a-0629bf7a3a22/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e10b9d13-4ee4-4c46-a37a-0629bf7a3a22/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e10b9d13-4ee4-4c46-a37a-0629bf7a3a22/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e10b9d13-4ee4-4c46-a37a-0629bf7a3a22/bin/uautomizer-uyxdKDjOR8/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_e10b9d13-4ee4-4c46-a37a-0629bf7a3a22/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e10b9d13-4ee4-4c46-a37a-0629bf7a3a22/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-2329fc7 [2022-12-13 15:14:42,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:14:42,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:14:42,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:14:42,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:14:42,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:14:42,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:14:42,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:14:42,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:14:42,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:14:42,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:14:42,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:14:42,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:14:42,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:14:42,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:14:42,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:14:42,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:14:42,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:14:42,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:14:42,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:14:42,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:14:42,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:14:42,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:14:42,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:14:42,222 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:14:42,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:14:42,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:14:42,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:14:42,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:14:42,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:14:42,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:14:42,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:14:42,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:14:42,226 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:14:42,227 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:14:42,227 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:14:42,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:14:42,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:14:42,228 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:14:42,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:14:42,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:14:42,229 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e10b9d13-4ee4-4c46-a37a-0629bf7a3a22/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-12-13 15:14:42,245 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:14:42,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:14:42,245 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:14:42,245 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:14:42,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:14:42,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:14:42,246 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:14:42,246 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 15:14:42,247 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 15:14:42,247 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 15:14:42,247 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 15:14:42,247 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 15:14:42,247 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 15:14:42,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:14:42,247 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:14:42,247 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 15:14:42,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:14:42,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:14:42,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:14:42,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 15:14:42,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 15:14:42,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 15:14:42,248 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:14:42,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 15:14:42,248 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 15:14:42,248 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:14:42,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 15:14:42,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:14:42,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:14:42,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:14:42,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 15:14:42,250 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 15:14:42,250 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_e10b9d13-4ee4-4c46-a37a-0629bf7a3a22/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e10b9d13-4ee4-4c46-a37a-0629bf7a3a22/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 [2022-12-13 15:14:42,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:14:42,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:14:42,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:14:42,450 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:14:42,450 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:14:42,451 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e10b9d13-4ee4-4c46-a37a-0629bf7a3a22/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2022-12-13 15:14:45,031 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:14:45,191 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:14:45,192 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e10b9d13-4ee4-4c46-a37a-0629bf7a3a22/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2022-12-13 15:14:45,198 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e10b9d13-4ee4-4c46-a37a-0629bf7a3a22/bin/uautomizer-uyxdKDjOR8/data/3162add16/2feac3d5e07645fc8519bb13a1c12c81/FLAGaf2105fdf [2022-12-13 15:14:45,210 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e10b9d13-4ee4-4c46-a37a-0629bf7a3a22/bin/uautomizer-uyxdKDjOR8/data/3162add16/2feac3d5e07645fc8519bb13a1c12c81 [2022-12-13 15:14:45,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:14:45,214 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:14:45,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:14:45,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:14:45,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:14:45,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:14:45" (1/1) ... [2022-12-13 15:14:45,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59511848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:45, skipping insertion in model container [2022-12-13 15:14:45,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:14:45" (1/1) ... [2022-12-13 15:14:45,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:14:45,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:14:45,422 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_e10b9d13-4ee4-4c46-a37a-0629bf7a3a22/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c[5984,5997] [2022-12-13 15:14:45,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:14:45,436 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:14:45,468 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_e10b9d13-4ee4-4c46-a37a-0629bf7a3a22/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c[5984,5997] [2022-12-13 15:14:45,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:14:45,483 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:14:45,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:45 WrapperNode [2022-12-13 15:14:45,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:14:45,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:14:45,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:14:45,485 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:14:45,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:45" (1/1) ... [2022-12-13 15:14:45,499 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:45" (1/1) ... [2022-12-13 15:14:45,520 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2022-12-13 15:14:45,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:14:45,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:14:45,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:14:45,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:14:45,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:45" (1/1) ... [2022-12-13 15:14:45,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:45" (1/1) ... [2022-12-13 15:14:45,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:45" (1/1) ... [2022-12-13 15:14:45,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:45" (1/1) ... [2022-12-13 15:14:45,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:45" (1/1) ... [2022-12-13 15:14:45,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:45" (1/1) ... [2022-12-13 15:14:45,542 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:45" (1/1) ... [2022-12-13 15:14:45,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:45" (1/1) ... [2022-12-13 15:14:45,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:14:45,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:14:45,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:14:45,547 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:14:45,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:45" (1/1) ... [2022-12-13 15:14:45,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:14:45,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e10b9d13-4ee4-4c46-a37a-0629bf7a3a22/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:14:45,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e10b9d13-4ee4-4c46-a37a-0629bf7a3a22/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:14:45,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e10b9d13-4ee4-4c46-a37a-0629bf7a3a22/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 15:14:45,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:14:45,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 15:14:45,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:14:45,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:14:45,685 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:14:45,687 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:14:45,898 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:14:45,905 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:14:45,906 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 15:14:45,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:14:45 BoogieIcfgContainer [2022-12-13 15:14:45,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:14:45,908 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 15:14:45,908 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 15:14:45,911 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 15:14:45,912 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 15:14:45,912 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 03:14:45" (1/3) ... [2022-12-13 15:14:45,913 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57fd966b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 03:14:45, skipping insertion in model container [2022-12-13 15:14:45,914 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 15:14:45,914 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:14:45" (2/3) ... [2022-12-13 15:14:45,914 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57fd966b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 03:14:45, skipping insertion in model container [2022-12-13 15:14:45,914 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 15:14:45,914 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:14:45" (3/3) ... [2022-12-13 15:14:45,916 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2022-12-13 15:14:45,970 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 15:14:45,970 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 15:14:45,970 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 15:14:45,970 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 15:14:45,970 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 15:14:45,970 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 15:14:45,970 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 15:14:45,971 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 15:14:45,979 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-12-13 15:14:45,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2022-12-13 15:14:45,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:14:45,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:14:46,001 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:14:46,001 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:14:46,001 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 15:14:46,001 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-12-13 15:14:46,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2022-12-13 15:14:46,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:14:46,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:14:46,006 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:14:46,006 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:14:46,012 INFO L748 eck$LassoCheckResult]: Stem: 25#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(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_#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; 38#L131true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 23#L131-1true init_#res#1 := init_~tmp~0#1; 19#init_returnLabel#1true 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); 28#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-12-13 15:14:46,013 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; 20#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; 50#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; 45#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; 35#L204true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 44#L204-1true check_#res#1 := check_~tmp~1#1; 15#check_returnLabel#1true 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; 22#L280true assume !(0 == assert_~arg#1 % 256); 36#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-12-13 15:14:46,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:14:46,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2022-12-13 15:14:46,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:14:46,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044826221] [2022-12-13 15:14:46,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:14:46,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:14:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:14:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:14:46,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:14:46,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044826221] [2022-12-13 15:14:46,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044826221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:14:46,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:14:46,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:14:46,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115059557] [2022-12-13 15:14:46,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:14:46,217 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 15:14:46,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:14:46,218 INFO L85 PathProgramCache]: Analyzing trace with hash 317704902, now seen corresponding path program 1 times [2022-12-13 15:14:46,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:14:46,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457603598] [2022-12-13 15:14:46,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:14:46,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:14:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:14:46,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:14:46,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:14:46,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457603598] [2022-12-13 15:14:46,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457603598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:14:46,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:14:46,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:14:46,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343594051] [2022-12-13 15:14:46,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:14:46,476 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 15:14:46,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:14:46,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:14:46,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:14:46,506 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-12-13 15:14:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:14:46,579 INFO L93 Difference]: Finished difference Result 87 states and 136 transitions. [2022-12-13 15:14:46,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 136 transitions. [2022-12-13 15:14:46,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-12-13 15:14:46,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 78 states and 112 transitions. [2022-12-13 15:14:46,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2022-12-13 15:14:46,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2022-12-13 15:14:46,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 112 transitions. [2022-12-13 15:14:46,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:14:46,590 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 112 transitions. [2022-12-13 15:14:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 112 transitions. [2022-12-13 15:14:46,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2022-12-13 15:14:46,610 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-12-13 15:14:46,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-12-13 15:14:46,612 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-12-13 15:14:46,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:14:46,617 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-12-13 15:14:46,617 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 15:14:46,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 67 transitions. [2022-12-13 15:14:46,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-12-13 15:14:46,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:14:46,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:14:46,619 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-12-13 15:14:46,619 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:14:46,620 INFO L748 eck$LassoCheckResult]: Stem: 194#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(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; 195#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; 202#L131 assume 0 == ~r1~0; 206#L132 assume ~id1~0 >= 0; 204#L133 assume 0 == ~st1~0; 205#L134 assume ~send1~0 == ~id1~0; 201#L135 assume 0 == ~mode1~0 % 256; 179#L136 assume ~id2~0 >= 0; 180#L137 assume 0 == ~st2~0; 209#L138 assume ~send2~0 == ~id2~0; 192#L139 assume 0 == ~mode2~0 % 256; 193#L140 assume ~id3~0 >= 0; 207#L141 assume 0 == ~st3~0; 197#L142 assume ~send3~0 == ~id3~0; 196#L143 assume 0 == ~mode3~0 % 256; 169#L144 assume ~id1~0 != ~id2~0; 170#L145 assume ~id1~0 != ~id3~0; 184#L146 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 185#L131-1 init_#res#1 := init_~tmp~0#1; 187#init_returnLabel#1 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; 188#L248 assume !(0 == main_~i2~0#1); 198#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-12-13 15:14:46,620 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; 190#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; 208#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; 183#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; 203#L204 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 177#L204-1 check_#res#1 := check_~tmp~1#1; 181#check_returnLabel#1 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; 182#L280 assume !(0 == assert_~arg#1 % 256); 191#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-12-13 15:14:46,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:14:46,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2022-12-13 15:14:46,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:14:46,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978837111] [2022-12-13 15:14:46,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:14:46,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:14:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:14:46,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:14:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:14:46,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:14:46,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:14:46,671 INFO L85 PathProgramCache]: Analyzing trace with hash 317704902, now seen corresponding path program 2 times [2022-12-13 15:14:46,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:14:46,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408876887] [2022-12-13 15:14:46,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:14:46,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:14:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:14:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:14:46,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:14:46,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408876887] [2022-12-13 15:14:46,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408876887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:14:46,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:14:46,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:14:46,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842462214] [2022-12-13 15:14:46,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:14:46,798 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 15:14:46,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:14:46,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:14:46,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:14:46,799 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-12-13 15:14:46,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:14:46,835 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2022-12-13 15:14:46,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 69 transitions. [2022-12-13 15:14:46,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-12-13 15:14:46,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 50 states and 64 transitions. [2022-12-13 15:14:46,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2022-12-13 15:14:46,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2022-12-13 15:14:46,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 64 transitions. [2022-12-13 15:14:46,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:14:46,837 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-12-13 15:14:46,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 64 transitions. [2022-12-13 15:14:46,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-12-13 15:14:46,839 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-12-13 15:14:46,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-12-13 15:14:46,840 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-12-13 15:14:46,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:14:46,840 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-12-13 15:14:46,841 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 15:14:46,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 64 transitions. [2022-12-13 15:14:46,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-12-13 15:14:46,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:14:46,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:14:46,843 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-12-13 15:14:46,843 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:14:46,843 INFO L748 eck$LassoCheckResult]: Stem: 309#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(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; 310#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; 317#L131 assume 0 == ~r1~0; 321#L132 assume ~id1~0 >= 0; 319#L133 assume 0 == ~st1~0; 320#L134 assume ~send1~0 == ~id1~0; 316#L135 assume 0 == ~mode1~0 % 256; 294#L136 assume ~id2~0 >= 0; 295#L137 assume 0 == ~st2~0; 324#L138 assume ~send2~0 == ~id2~0; 307#L139 assume 0 == ~mode2~0 % 256; 308#L140 assume ~id3~0 >= 0; 322#L141 assume 0 == ~st3~0; 312#L142 assume ~send3~0 == ~id3~0; 311#L143 assume 0 == ~mode3~0 % 256; 284#L144 assume ~id1~0 != ~id2~0; 285#L145 assume ~id1~0 != ~id3~0; 299#L146 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 300#L131-1 init_#res#1 := init_~tmp~0#1; 302#init_returnLabel#1 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; 303#L248 assume !(0 == main_~i2~0#1); 313#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-12-13 15:14:46,843 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; 305#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; 323#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; 298#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; 318#L204 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 286#L205 assume ~r1~0 >= 3; 287#$Ultimate##101 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 292#L204-1 check_#res#1 := check_~tmp~1#1; 296#check_returnLabel#1 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; 297#L280 assume !(0 == assert_~arg#1 % 256); 306#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-12-13 15:14:46,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:14:46,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2022-12-13 15:14:46,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:14:46,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269430069] [2022-12-13 15:14:46,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:14:46,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:14:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:14:46,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:14:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:14:46,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:14:46,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:14:46,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1044091498, now seen corresponding path program 1 times [2022-12-13 15:14:46,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:14:46,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531405692] [2022-12-13 15:14:46,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:14:46,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:14:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:14:46,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:14:46,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:14:46,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531405692] [2022-12-13 15:14:46,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531405692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:14:46,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:14:46,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:14:46,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238688504] [2022-12-13 15:14:46,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:14:46,879 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 15:14:46,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:14:46,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:14:46,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:14:46,880 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-12-13 15:14:46,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:14:46,898 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2022-12-13 15:14:46,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 95 transitions. [2022-12-13 15:14:46,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-12-13 15:14:46,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 95 transitions. [2022-12-13 15:14:46,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2022-12-13 15:14:46,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2022-12-13 15:14:46,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 95 transitions. [2022-12-13 15:14:46,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:14:46,901 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-12-13 15:14:46,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 95 transitions. [2022-12-13 15:14:46,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-12-13 15:14:46,904 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-12-13 15:14:46,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2022-12-13 15:14:46,905 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-12-13 15:14:46,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:14:46,906 INFO L428 stractBuchiCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-12-13 15:14:46,906 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 15:14:46,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 95 transitions. [2022-12-13 15:14:46,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-12-13 15:14:46,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:14:46,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:14:46,909 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-12-13 15:14:46,909 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:14:46,909 INFO L748 eck$LassoCheckResult]: Stem: 436#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(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; 437#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; 447#L131 assume 0 == ~r1~0; 451#L132 assume ~id1~0 >= 0; 449#L133 assume 0 == ~st1~0; 450#L134 assume ~send1~0 == ~id1~0; 444#L135 assume 0 == ~mode1~0 % 256; 421#L136 assume ~id2~0 >= 0; 422#L137 assume 0 == ~st2~0; 455#L138 assume ~send2~0 == ~id2~0; 434#L139 assume 0 == ~mode2~0 % 256; 435#L140 assume ~id3~0 >= 0; 452#L141 assume 0 == ~st3~0; 439#L142 assume ~send3~0 == ~id3~0; 438#L143 assume 0 == ~mode3~0 % 256; 412#L144 assume ~id1~0 != ~id2~0; 413#L145 assume ~id1~0 != ~id3~0; 426#L146 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 427#L131-1 init_#res#1 := init_~tmp~0#1; 429#init_returnLabel#1 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; 430#L248 assume !(0 == main_~i2~0#1); 440#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; 441#L256-2 [2022-12-13 15:14:46,909 INFO L750 eck$LassoCheckResult]: Loop: 441#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; 470#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; 417#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; 466#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; 464#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; 459#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; 458#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; 457#L204 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 456#L205 assume !(~r1~0 >= 3); 445#L208 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 446#$Ultimate##101 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 474#L204-1 check_#res#1 := check_~tmp~1#1; 473#check_returnLabel#1 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; 472#L280 assume !(0 == assert_~arg#1 % 256); 471#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; 441#L256-2 [2022-12-13 15:14:46,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:14:46,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2022-12-13 15:14:46,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:14:46,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760621831] [2022-12-13 15:14:46,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:14:46,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:14:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:14:46,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:14:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:14:46,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:14:46,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:14:46,926 INFO L85 PathProgramCache]: Analyzing trace with hash -655493558, now seen corresponding path program 1 times [2022-12-13 15:14:46,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:14:46,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740482628] [2022-12-13 15:14:46,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:14:46,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:14:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:14:46,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:14:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:14:46,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:14:46,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:14:46,951 INFO L85 PathProgramCache]: Analyzing trace with hash 214545420, now seen corresponding path program 1 times [2022-12-13 15:14:46,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:14:46,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598790427] [2022-12-13 15:14:46,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:14:46,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:14:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:14:46,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:14:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:14:46,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:14:48,220 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 15:14:48,221 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 15:14:48,221 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 15:14:48,221 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 15:14:48,221 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-12-13 15:14:48,221 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:14:48,221 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 15:14:48,221 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 15:14:48,221 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-12-13 15:14:48,221 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 15:14:48,222 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 15:14:48,253 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 15:14:48,264 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 15:14:48,268 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 15:14:48,270 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 15:14:48,273 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 15:14:48,277 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 15:14:48,282 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 15:14:48,284 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 15:14:48,287 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 15:14:48,803 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 15:14:48,808 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 15:14:49,490 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 17 [2022-12-13 15:15:02,219 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 331668 conjuctions. This might take some time...