./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b4ec56b 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_ae3225ba-49d1-42dc-9573-3d6cf888a548/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3225ba-49d1-42dc-9573-3d6cf888a548/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3225ba-49d1-42dc-9573-3d6cf888a548/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3225ba-49d1-42dc-9573-3d6cf888a548/bin/uautomizer-ug76WZFUDN/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3225ba-49d1-42dc-9573-3d6cf888a548/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3225ba-49d1-42dc-9573-3d6cf888a548/bin/uautomizer-ug76WZFUDN --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 e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca --- 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-6b4ec56 [2022-11-20 11:03:03,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:03:03,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:03:03,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:03:03,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:03:03,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:03:03,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:03:03,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:03:03,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:03:03,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:03:03,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:03:03,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:03:03,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:03:03,893 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:03:03,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:03:03,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:03:03,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:03:03,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:03:03,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:03:03,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:03:03,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:03:03,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:03:03,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:03:03,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:03:03,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:03:03,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:03:03,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:03:03,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:03:03,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:03:03,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:03:03,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:03:03,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:03:03,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:03:03,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:03:03,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:03:03,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:03:03,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:03:03,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:03:03,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:03:03,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:03:03,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:03:03,939 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3225ba-49d1-42dc-9573-3d6cf888a548/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-20 11:03:03,977 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:03:03,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:03:03,978 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:03:03,978 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:03:03,980 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:03:03,980 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:03:03,980 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:03:03,980 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-20 11:03:03,981 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-20 11:03:03,981 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-20 11:03:03,982 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-20 11:03:03,982 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-20 11:03:03,982 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-20 11:03:03,983 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:03:03,983 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:03:03,983 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:03:03,983 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:03:03,983 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:03:03,983 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:03:03,984 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-20 11:03:03,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-20 11:03:03,984 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-20 11:03:03,984 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:03:03,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:03:03,985 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-20 11:03:03,985 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:03:03,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-20 11:03:03,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:03:03,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:03:03,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:03:03,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:03:03,988 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-20 11:03:03,988 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_ae3225ba-49d1-42dc-9573-3d6cf888a548/bin/uautomizer-ug76WZFUDN/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_ae3225ba-49d1-42dc-9573-3d6cf888a548/bin/uautomizer-ug76WZFUDN 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 -> e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca [2022-11-20 11:03:04,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:03:04,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:03:04,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:03:04,327 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:03:04,328 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:03:04,329 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3225ba-49d1-42dc-9573-3d6cf888a548/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-20 11:03:07,575 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:03:07,839 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:03:07,840 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3225ba-49d1-42dc-9573-3d6cf888a548/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-20 11:03:07,849 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3225ba-49d1-42dc-9573-3d6cf888a548/bin/uautomizer-ug76WZFUDN/data/01daf2c9d/7c9708be63db4807bfa17a95876950ef/FLAG8fda58528 [2022-11-20 11:03:07,867 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3225ba-49d1-42dc-9573-3d6cf888a548/bin/uautomizer-ug76WZFUDN/data/01daf2c9d/7c9708be63db4807bfa17a95876950ef [2022-11-20 11:03:07,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:03:07,872 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:03:07,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:03:07,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:03:07,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:03:07,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:03:07" (1/1) ... [2022-11-20 11:03:07,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@772ad91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:07, skipping insertion in model container [2022-11-20 11:03:07,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:03:07" (1/1) ... [2022-11-20 11:03:07,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:03:07,954 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:03:08,261 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_ae3225ba-49d1-42dc-9573-3d6cf888a548/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2022-11-20 11:03:08,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:03:08,285 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:03:08,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_ae3225ba-49d1-42dc-9573-3d6cf888a548/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2022-11-20 11:03:08,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:03:08,394 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:03:08,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:08 WrapperNode [2022-11-20 11:03:08,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:03:08,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:03:08,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:03:08,398 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:03:08,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:08" (1/1) ... [2022-11-20 11:03:08,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:08" (1/1) ... [2022-11-20 11:03:08,477 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 194 [2022-11-20 11:03:08,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:03:08,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:03:08,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:03:08,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:03:08,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:08" (1/1) ... [2022-11-20 11:03:08,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:08" (1/1) ... [2022-11-20 11:03:08,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:08" (1/1) ... [2022-11-20 11:03:08,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:08" (1/1) ... [2022-11-20 11:03:08,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:08" (1/1) ... [2022-11-20 11:03:08,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:08" (1/1) ... [2022-11-20 11:03:08,519 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:08" (1/1) ... [2022-11-20 11:03:08,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:08" (1/1) ... [2022-11-20 11:03:08,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:03:08,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:03:08,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:03:08,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:03:08,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:08" (1/1) ... [2022-11-20 11:03:08,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 11:03:08,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3225ba-49d1-42dc-9573-3d6cf888a548/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:03:08,590 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3225ba-49d1-42dc-9573-3d6cf888a548/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 11:03:08,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3225ba-49d1-42dc-9573-3d6cf888a548/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-20 11:03:08,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:03:08,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:03:08,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:03:08,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:03:08,784 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:03:08,786 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:03:09,306 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:03:09,314 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:03:09,314 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 11:03:09,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:03:09 BoogieIcfgContainer [2022-11-20 11:03:09,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:03:09,318 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-20 11:03:09,318 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-20 11:03:09,323 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-20 11:03:09,324 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 11:03:09,325 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 11:03:07" (1/3) ... [2022-11-20 11:03:09,326 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66495060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 11:03:09, skipping insertion in model container [2022-11-20 11:03:09,326 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 11:03:09,326 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:08" (2/3) ... [2022-11-20 11:03:09,327 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66495060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 11:03:09, skipping insertion in model container [2022-11-20 11:03:09,327 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 11:03:09,327 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:03:09" (3/3) ... [2022-11-20 11:03:09,329 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-20 11:03:09,396 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-20 11:03:09,397 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-20 11:03:09,397 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-20 11:03:09,397 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-20 11:03:09,397 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-20 11:03:09,398 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-20 11:03:09,398 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-20 11:03:09,399 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-20 11:03:09,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 54 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:03:09,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2022-11-20 11:03:09,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 11:03:09,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 11:03:09,447 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:03:09,447 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:03:09,448 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-20 11:03:09,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 54 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:03:09,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2022-11-20 11:03:09,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 11:03:09,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 11:03:09,464 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:03:09,465 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:03:09,474 INFO L748 eck$LassoCheckResult]: Stem: 45#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(41, 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; 31#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~ret17#1, main_#t~ret18#1, main_~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; 46#L134true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 41#L134-1true init_#res#1 := init_~tmp~0#1; 43#L199true 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; 39#L24true assume !(0 == assume_abort_if_not_~cond#1); 12#L23true 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; 37#L259-2true [2022-11-20 11:03:09,475 INFO L750 eck$LassoCheckResult]: Loop: 37#L259-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 26#L59true 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; 48#L59-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; 27#L85true 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; 6#L85-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 3#L110true 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; 33#L110-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; 8#L207true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 24#L207-1true check_#res#1 := check_~tmp~1#1; 19#L227true 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; 4#L282true assume !(0 == assert_~arg#1 % 256); 52#L277true assume { :end_inline_assert } true; 37#L259-2true [2022-11-20 11:03:09,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:03:09,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2022-11-20 11:03:09,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:03:09,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374121974] [2022-11-20 11:03:09,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:03:09,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:03:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:03:09,861 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-20 11:03:09,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:03:09,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374121974] [2022-11-20 11:03:09,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374121974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:03:09,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:03:09,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:03:09,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631992627] [2022-11-20 11:03:09,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:03:09,871 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 11:03:09,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:03:09,873 INFO L85 PathProgramCache]: Analyzing trace with hash 317704902, now seen corresponding path program 1 times [2022-11-20 11:03:09,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:03:09,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682902605] [2022-11-20 11:03:09,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:03:09,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:03:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:03:10,335 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-20 11:03:10,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:03:10,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682902605] [2022-11-20 11:03:10,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682902605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:03:10,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:03:10,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:03:10,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619876402] [2022-11-20 11:03:10,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:03:10,338 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 11:03:10,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:03:10,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:03:10,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:03:10,400 INFO L87 Difference]: Start difference. First operand has 55 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 54 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:03:10,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:03:10,512 INFO L93 Difference]: Finished difference Result 54 states and 86 transitions. [2022-11-20 11:03:10,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 86 transitions. [2022-11-20 11:03:10,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-11-20 11:03:10,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 50 states and 67 transitions. [2022-11-20 11:03:10,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2022-11-20 11:03:10,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2022-11-20 11:03:10,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 67 transitions. [2022-11-20 11:03:10,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:03:10,522 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-11-20 11:03:10,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 67 transitions. [2022-11-20 11:03:10,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-20 11:03:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.34) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:03:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-11-20 11:03:10,555 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-11-20 11:03:10,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:03:10,561 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-11-20 11:03:10,562 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-20 11:03:10,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 67 transitions. [2022-11-20 11:03:10,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-11-20 11:03:10,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 11:03:10,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 11:03:10,570 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-20 11:03:10,570 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:03:10,571 INFO L748 eck$LassoCheckResult]: Stem: 175#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(41, 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; 169#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; 170#L134 assume 0 == ~r1~0 % 256; 168#L135 assume ~id1~0 >= 0; 150#L136 assume 0 == ~st1~0; 151#L137 assume ~send1~0 == ~id1~0; 176#L138 assume 0 == ~mode1~0 % 256; 159#L139 assume ~id2~0 >= 0; 160#L140 assume 0 == ~st2~0; 172#L141 assume ~send2~0 == ~id2~0; 163#L142 assume 0 == ~mode2~0 % 256; 162#L143 assume ~id3~0 >= 0; 146#L144 assume 0 == ~st3~0; 147#L145 assume ~send3~0 == ~id3~0; 152#L146 assume 0 == ~mode3~0 % 256; 153#L147 assume ~id1~0 != ~id2~0; 161#L148 assume ~id1~0 != ~id3~0; 155#L149 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 156#L134-1 init_#res#1 := init_~tmp~0#1; 174#L199 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; 173#L24 assume !(0 == assume_abort_if_not_~cond#1); 148#L23 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; 149#L259-2 [2022-11-20 11:03:10,571 INFO L750 eck$LassoCheckResult]: Loop: 149#L259-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 165#L59 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; 166#L59-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; 167#L85 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; 135#L85-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; 127#L110 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; 128#L110-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; 139#L207 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 141#L207-1 check_#res#1 := check_~tmp~1#1; 158#L227 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; 130#L282 assume !(0 == assert_~arg#1 % 256); 131#L277 assume { :end_inline_assert } true; 149#L259-2 [2022-11-20 11:03:10,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:03:10,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2022-11-20 11:03:10,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:03:10,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295444765] [2022-11-20 11:03:10,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:03:10,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:03:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:03:10,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:03:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:03:10,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:03:10,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:03:10,694 INFO L85 PathProgramCache]: Analyzing trace with hash 317704902, now seen corresponding path program 2 times [2022-11-20 11:03:10,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:03:10,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875128007] [2022-11-20 11:03:10,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:03:10,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:03:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:03:11,016 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-20 11:03:11,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:03:11,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875128007] [2022-11-20 11:03:11,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875128007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:03:11,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:03:11,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:03:11,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213204349] [2022-11-20 11:03:11,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:03:11,019 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 11:03:11,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:03:11,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:03:11,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:03:11,021 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. cyclomatic complexity: 18 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:03:11,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:03:11,124 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2022-11-20 11:03:11,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 69 transitions. [2022-11-20 11:03:11,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-11-20 11:03:11,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 50 states and 64 transitions. [2022-11-20 11:03:11,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2022-11-20 11:03:11,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2022-11-20 11:03:11,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 64 transitions. [2022-11-20 11:03:11,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:03:11,129 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-11-20 11:03:11,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 64 transitions. [2022-11-20 11:03:11,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-20 11:03:11,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.28) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:03:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-11-20 11:03:11,134 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-11-20 11:03:11,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:03:11,136 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-11-20 11:03:11,136 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-20 11:03:11,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 64 transitions. [2022-11-20 11:03:11,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-11-20 11:03:11,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 11:03:11,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 11:03:11,139 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-20 11:03:11,139 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:03:11,139 INFO L748 eck$LassoCheckResult]: Stem: 290#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(41, 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; 284#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; 285#L134 assume 0 == ~r1~0 % 256; 283#L135 assume ~id1~0 >= 0; 265#L136 assume 0 == ~st1~0; 266#L137 assume ~send1~0 == ~id1~0; 291#L138 assume 0 == ~mode1~0 % 256; 274#L139 assume ~id2~0 >= 0; 275#L140 assume 0 == ~st2~0; 287#L141 assume ~send2~0 == ~id2~0; 278#L142 assume 0 == ~mode2~0 % 256; 277#L143 assume ~id3~0 >= 0; 261#L144 assume 0 == ~st3~0; 262#L145 assume ~send3~0 == ~id3~0; 267#L146 assume 0 == ~mode3~0 % 256; 268#L147 assume ~id1~0 != ~id2~0; 276#L148 assume ~id1~0 != ~id3~0; 270#L149 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 271#L134-1 init_#res#1 := init_~tmp~0#1; 289#L199 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; 288#L24 assume !(0 == assume_abort_if_not_~cond#1); 263#L23 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; 264#L259-2 [2022-11-20 11:03:11,140 INFO L750 eck$LassoCheckResult]: Loop: 264#L259-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 280#L59 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; 281#L59-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; 282#L85 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; 250#L85-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; 242#L110 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; 243#L110-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; 254#L207 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 255#L208 assume ~r1~0 % 256 >= 3; 258#L212 assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; 259#L207-1 check_#res#1 := check_~tmp~1#1; 273#L227 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; 245#L282 assume !(0 == assert_~arg#1 % 256); 246#L277 assume { :end_inline_assert } true; 264#L259-2 [2022-11-20 11:03:11,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:03:11,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2022-11-20 11:03:11,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:03:11,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398737013] [2022-11-20 11:03:11,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:03:11,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:03:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:03:11,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:03:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:03:11,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:03:11,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:03:11,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1044091498, now seen corresponding path program 1 times [2022-11-20 11:03:11,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:03:11,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049514001] [2022-11-20 11:03:11,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:03:11,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:03:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:03:11,263 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-20 11:03:11,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:03:11,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049514001] [2022-11-20 11:03:11,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049514001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:03:11,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:03:11,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:03:11,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499150484] [2022-11-20 11:03:11,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:03:11,266 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 11:03:11,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:03:11,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:03:11,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:03:11,267 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:03:11,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:03:11,316 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2022-11-20 11:03:11,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 95 transitions. [2022-11-20 11:03:11,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-11-20 11:03:11,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 95 transitions. [2022-11-20 11:03:11,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2022-11-20 11:03:11,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2022-11-20 11:03:11,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 95 transitions. [2022-11-20 11:03:11,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:03:11,321 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-11-20 11:03:11,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 95 transitions. [2022-11-20 11:03:11,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-20 11:03:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 71 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:03:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2022-11-20 11:03:11,342 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-11-20 11:03:11,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:03:11,343 INFO L428 stractBuchiCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-11-20 11:03:11,343 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-20 11:03:11,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 95 transitions. [2022-11-20 11:03:11,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-11-20 11:03:11,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 11:03:11,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 11:03:11,347 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-20 11:03:11,347 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:03:11,348 INFO L748 eck$LassoCheckResult]: Stem: 421#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(41, 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; 413#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; 414#L134 assume 0 == ~r1~0 % 256; 412#L135 assume ~id1~0 >= 0; 392#L136 assume 0 == ~st1~0; 393#L137 assume ~send1~0 == ~id1~0; 422#L138 assume 0 == ~mode1~0 % 256; 401#L139 assume ~id2~0 >= 0; 402#L140 assume 0 == ~st2~0; 416#L141 assume ~send2~0 == ~id2~0; 405#L142 assume 0 == ~mode2~0 % 256; 404#L143 assume ~id3~0 >= 0; 388#L144 assume 0 == ~st3~0; 389#L145 assume ~send3~0 == ~id3~0; 394#L146 assume 0 == ~mode3~0 % 256; 395#L147 assume ~id1~0 != ~id2~0; 403#L148 assume ~id1~0 != ~id3~0; 397#L149 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 398#L134-1 init_#res#1 := init_~tmp~0#1; 420#L199 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; 419#L24 assume !(0 == assume_abort_if_not_~cond#1); 390#L23 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; 391#L259-2 [2022-11-20 11:03:11,348 INFO L750 eck$LassoCheckResult]: Loop: 391#L259-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 437#L59 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; 418#L59-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; 433#L85 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; 431#L85-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; 426#L110 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; 425#L110-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; 424#L207 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 423#L208 assume !(~r1~0 % 256 >= 3); 406#L211 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 407#L212 assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; 441#L207-1 check_#res#1 := check_~tmp~1#1; 440#L227 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; 439#L282 assume !(0 == assert_~arg#1 % 256); 438#L277 assume { :end_inline_assert } true; 391#L259-2 [2022-11-20 11:03:11,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:03:11,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2022-11-20 11:03:11,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:03:11,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203647315] [2022-11-20 11:03:11,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:03:11,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:03:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:03:11,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:03:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:03:11,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:03:11,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:03:11,411 INFO L85 PathProgramCache]: Analyzing trace with hash -655493558, now seen corresponding path program 1 times [2022-11-20 11:03:11,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:03:11,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108941919] [2022-11-20 11:03:11,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:03:11,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:03:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:03:11,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:03:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:03:11,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:03:11,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:03:11,519 INFO L85 PathProgramCache]: Analyzing trace with hash 214545420, now seen corresponding path program 1 times [2022-11-20 11:03:11,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:03:11,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824244490] [2022-11-20 11:03:11,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:03:11,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:03:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:03:11,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:03:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:03:11,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:03:13,981 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 11:03:13,982 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 11:03:13,982 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 11:03:13,983 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 11:03:13,992 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-20 11:03:13,993 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 11:03:13,993 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 11:03:13,993 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 11:03:13,993 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-11-20 11:03:13,993 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 11:03:13,994 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 11:03:14,042 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-20 11:03:14,060 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-20 11:03:14,066 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-20 11:03:14,075 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-20 11:03:14,079 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-20 11:03:14,082 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-20 11:03:14,087 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-20 11:03:14,094 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-20 11:03:15,224 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-20 11:03:16,664 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2022-11-20 11:03:43,207 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 496908 conjuctions. This might take some time...