./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 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_0a823593-5816-4374-b47e-76abbb203d44/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a823593-5816-4374-b47e-76abbb203d44/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_0a823593-5816-4374-b47e-76abbb203d44/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a823593-5816-4374-b47e-76abbb203d44/bin/uautomizer-uyxdKDjOR8/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_0a823593-5816-4374-b47e-76abbb203d44/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_0a823593-5816-4374-b47e-76abbb203d44/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 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-2329fc7 [2022-12-13 15:19:09,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:19:09,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:19:09,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:19:09,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:19:09,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:19:09,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:19:09,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:19:09,438 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:19:09,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:19:09,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:19:09,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:19:09,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:19:09,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:19:09,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:19:09,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:19:09,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:19:09,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:19:09,447 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:19:09,449 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:19:09,450 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:19:09,451 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:19:09,452 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:19:09,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:19:09,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:19:09,456 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:19:09,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:19:09,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:19:09,458 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:19:09,459 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:19:09,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:19:09,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:19:09,460 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:19:09,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:19:09,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:19:09,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:19:09,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:19:09,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:19:09,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:19:09,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:19:09,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:19:09,465 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a823593-5816-4374-b47e-76abbb203d44/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-12-13 15:19:09,485 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:19:09,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:19:09,486 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:19:09,486 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:19:09,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:19:09,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:19:09,492 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:19:09,493 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 15:19:09,493 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 15:19:09,493 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 15:19:09,493 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 15:19:09,493 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 15:19:09,494 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 15:19:09,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:19:09,494 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:19:09,494 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 15:19:09,494 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:19:09,495 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:19:09,495 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:19:09,495 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 15:19:09,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 15:19:09,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 15:19:09,495 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:19:09,496 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 15:19:09,496 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 15:19:09,496 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:19:09,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 15:19:09,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:19:09,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:19:09,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:19:09,497 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 15:19:09,498 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 15:19:09,498 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_0a823593-5816-4374-b47e-76abbb203d44/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_0a823593-5816-4374-b47e-76abbb203d44/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 -> e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca [2022-12-13 15:19:09,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:19:09,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:19:09,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:19:09,697 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:19:09,697 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:19:09,698 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a823593-5816-4374-b47e-76abbb203d44/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-12-13 15:19:12,237 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:19:12,412 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:19:12,413 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a823593-5816-4374-b47e-76abbb203d44/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-12-13 15:19:12,420 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a823593-5816-4374-b47e-76abbb203d44/bin/uautomizer-uyxdKDjOR8/data/eee267794/b340503c853741ecb74ef52860048491/FLAGba073a177 [2022-12-13 15:19:12,819 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a823593-5816-4374-b47e-76abbb203d44/bin/uautomizer-uyxdKDjOR8/data/eee267794/b340503c853741ecb74ef52860048491 [2022-12-13 15:19:12,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:19:12,829 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:19:12,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:19:12,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:19:12,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:19:12,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:19:12" (1/1) ... [2022-12-13 15:19:12,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51c2eb03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:12, skipping insertion in model container [2022-12-13 15:19:12,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:19:12" (1/1) ... [2022-12-13 15:19:12,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:19:12,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:19:12,979 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_0a823593-5816-4374-b47e-76abbb203d44/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2022-12-13 15:19:12,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:19:12,989 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:19:13,013 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_0a823593-5816-4374-b47e-76abbb203d44/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2022-12-13 15:19:13,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:19:13,024 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:19:13,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:13 WrapperNode [2022-12-13 15:19:13,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:19:13,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:19:13,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:19:13,025 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:19:13,030 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:19:13" (1/1) ... [2022-12-13 15:19:13,036 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:19:13" (1/1) ... [2022-12-13 15:19:13,051 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 194 [2022-12-13 15:19:13,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:19:13,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:19:13,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:19:13,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:19:13,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:13" (1/1) ... [2022-12-13 15:19:13,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:13" (1/1) ... [2022-12-13 15:19:13,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:13" (1/1) ... [2022-12-13 15:19:13,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:13" (1/1) ... [2022-12-13 15:19:13,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:13" (1/1) ... [2022-12-13 15:19:13,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:13" (1/1) ... [2022-12-13 15:19:13,067 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:13" (1/1) ... [2022-12-13 15:19:13,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:13" (1/1) ... [2022-12-13 15:19:13,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:19:13,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:19:13,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:19:13,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:19:13,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:13" (1/1) ... [2022-12-13 15:19:13,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:19:13,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a823593-5816-4374-b47e-76abbb203d44/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:19:13,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a823593-5816-4374-b47e-76abbb203d44/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:19:13,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a823593-5816-4374-b47e-76abbb203d44/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 15:19:13,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:19:13,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 15:19:13,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:19:13,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:19:13,203 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:19:13,205 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:19:13,405 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:19:13,411 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:19:13,412 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 15:19:13,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:19:13 BoogieIcfgContainer [2022-12-13 15:19:13,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:19:13,414 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 15:19:13,415 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 15:19:13,418 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 15:19:13,419 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 15:19:13,419 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 03:19:12" (1/3) ... [2022-12-13 15:19:13,420 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f482e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 03:19:13, skipping insertion in model container [2022-12-13 15:19:13,420 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 15:19:13,420 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:13" (2/3) ... [2022-12-13 15:19:13,420 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f482e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 03:19:13, skipping insertion in model container [2022-12-13 15:19:13,420 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 15:19:13,421 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:19:13" (3/3) ... [2022-12-13 15:19:13,422 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-12-13 15:19:13,465 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 15:19:13,465 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 15:19:13,465 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 15:19:13,465 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 15:19:13,465 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 15:19:13,465 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 15:19:13,465 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 15:19:13,466 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 15:19:13,469 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:19:13,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2022-12-13 15:19:13,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:19:13,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:19:13,487 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:19:13,487 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:19:13,487 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 15:19:13,488 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:19:13,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2022-12-13 15:19:13,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:19:13,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:19:13,490 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:19:13,491 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:19:13,496 INFO L748 eck$LassoCheckResult]: Stem: 22#$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(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; 32#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; 45#L134true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 42#L134-1true init_#res#1 := init_~tmp~0#1; 17#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;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; 40#L24true assume !(0 == assume_abort_if_not_~cond#1); 11#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-12-13 15:19:13,497 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; 27#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; 47#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; 28#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; 25#L207-1true check_#res#1 := check_~tmp~1#1; 14#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; 4#L282true assume !(0 == assert_~arg#1 % 256); 52#L277true assume { :end_inline_assert } true; 37#L259-2true [2022-12-13 15:19:13,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:19:13,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2022-12-13 15:19:13,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:19:13,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587864385] [2022-12-13 15:19:13,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:13,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:19:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:13,675 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:19:13,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:19:13,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587864385] [2022-12-13 15:19:13,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587864385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:19:13,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:19:13,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:19:13,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669113409] [2022-12-13 15:19:13,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:19:13,681 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 15:19:13,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:19:13,682 INFO L85 PathProgramCache]: Analyzing trace with hash 317704902, now seen corresponding path program 1 times [2022-12-13 15:19:13,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:19:13,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508010697] [2022-12-13 15:19:13,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:13,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:19:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:13,856 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:19:13,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:19:13,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508010697] [2022-12-13 15:19:13,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508010697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:19:13,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:19:13,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:19:13,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53036979] [2022-12-13 15:19:13,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:19:13,857 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 15:19:13,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:19:13,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:19:13,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:19:13,888 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:19:13,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:19:13,945 INFO L93 Difference]: Finished difference Result 54 states and 86 transitions. [2022-12-13 15:19:13,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 86 transitions. [2022-12-13 15:19:13,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-12-13 15:19:13,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 50 states and 67 transitions. [2022-12-13 15:19:13,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2022-12-13 15:19:13,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2022-12-13 15:19:13,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 67 transitions. [2022-12-13 15:19:13,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:19:13,952 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-12-13 15:19:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 67 transitions. [2022-12-13 15:19:13,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-12-13 15:19:13,969 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:19:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-12-13 15:19:13,971 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-12-13 15:19:13,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:19:13,975 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-12-13 15:19:13,975 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 15:19:13,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 67 transitions. [2022-12-13 15:19:13,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-12-13 15:19:13,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:19:13,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:19:13,977 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:19:13,977 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:19:13,977 INFO L748 eck$LassoCheckResult]: Stem: 162#$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(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; 163#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; 173#L134 assume 0 == ~r1~0 % 256; 171#L135 assume ~id1~0 >= 0; 148#L136 assume 0 == ~st1~0; 149#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; 175#L141 assume ~send2~0 == ~id2~0; 165#L142 assume 0 == ~mode2~0 % 256; 164#L143 assume ~id3~0 >= 0; 144#L144 assume 0 == ~st3~0; 145#L145 assume ~send3~0 == ~id3~0; 151#L146 assume 0 == ~mode3~0 % 256; 152#L147 assume ~id1~0 != ~id2~0; 161#L148 assume ~id1~0 != ~id3~0; 156#L149 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 157#L134-1 init_#res#1 := init_~tmp~0#1; 154#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;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; 155#L24 assume !(0 == assume_abort_if_not_~cond#1); 146#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; 147#L259-2 [2022-12-13 15:19:13,978 INFO L750 eck$LassoCheckResult]: Loop: 147#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; 168#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; 169#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; 170#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; 150#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; 130#L282 assume !(0 == assert_~arg#1 % 256); 131#L277 assume { :end_inline_assert } true; 147#L259-2 [2022-12-13 15:19:13,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:19:13,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2022-12-13 15:19:13,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:19:13,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069677570] [2022-12-13 15:19:13,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:13,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:19:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:19:13,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:19:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:19:14,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:19:14,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:19:14,022 INFO L85 PathProgramCache]: Analyzing trace with hash 317704902, now seen corresponding path program 2 times [2022-12-13 15:19:14,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:19:14,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276744272] [2022-12-13 15:19:14,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:14,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:19:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:14,149 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:19:14,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:19:14,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276744272] [2022-12-13 15:19:14,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276744272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:19:14,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:19:14,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:19:14,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407484759] [2022-12-13 15:19:14,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:19:14,150 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 15:19:14,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:19:14,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:19:14,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:19:14,151 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:19:14,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:19:14,191 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2022-12-13 15:19:14,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 69 transitions. [2022-12-13 15:19:14,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-12-13 15:19:14,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 50 states and 64 transitions. [2022-12-13 15:19:14,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2022-12-13 15:19:14,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2022-12-13 15:19:14,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 64 transitions. [2022-12-13 15:19:14,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:19:14,194 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-12-13 15:19:14,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 64 transitions. [2022-12-13 15:19:14,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-12-13 15:19:14,197 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:19:14,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-12-13 15:19:14,198 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-12-13 15:19:14,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:19:14,199 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-12-13 15:19:14,199 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 15:19:14,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 64 transitions. [2022-12-13 15:19:14,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-12-13 15:19:14,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:19:14,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:19:14,201 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:19:14,201 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:19:14,201 INFO L748 eck$LassoCheckResult]: Stem: 276#$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(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; 277#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; 288#L134 assume 0 == ~r1~0 % 256; 286#L135 assume ~id1~0 >= 0; 262#L136 assume 0 == ~st1~0; 263#L137 assume ~send1~0 == ~id1~0; 291#L138 assume 0 == ~mode1~0 % 256; 273#L139 assume ~id2~0 >= 0; 274#L140 assume 0 == ~st2~0; 290#L141 assume ~send2~0 == ~id2~0; 279#L142 assume 0 == ~mode2~0 % 256; 278#L143 assume ~id3~0 >= 0; 258#L144 assume 0 == ~st3~0; 259#L145 assume ~send3~0 == ~id3~0; 265#L146 assume 0 == ~mode3~0 % 256; 266#L147 assume ~id1~0 != ~id2~0; 275#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; 268#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 269#L24 assume !(0 == assume_abort_if_not_~cond#1); 260#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; 261#L259-2 [2022-12-13 15:19:14,202 INFO L750 eck$LassoCheckResult]: Loop: 261#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; 283#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; 284#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; 285#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; 281#$Ultimate##100 assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; 282#L207-1 check_#res#1 := check_~tmp~1#1; 264#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; 245#L282 assume !(0 == assert_~arg#1 % 256); 246#L277 assume { :end_inline_assert } true; 261#L259-2 [2022-12-13 15:19:14,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:19:14,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2022-12-13 15:19:14,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:19:14,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974949517] [2022-12-13 15:19:14,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:14,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:19:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:19:14,216 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:19:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:19:14,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:19:14,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:19:14,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1044091498, now seen corresponding path program 1 times [2022-12-13 15:19:14,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:19:14,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520077897] [2022-12-13 15:19:14,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:14,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:19:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:14,256 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:19:14,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:19:14,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520077897] [2022-12-13 15:19:14,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520077897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:19:14,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:19:14,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:19:14,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2566698] [2022-12-13 15:19:14,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:19:14,257 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 15:19:14,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:19:14,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:19:14,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:19:14,258 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:19:14,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:19:14,279 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2022-12-13 15:19:14,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 95 transitions. [2022-12-13 15:19:14,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-12-13 15:19:14,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 95 transitions. [2022-12-13 15:19:14,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2022-12-13 15:19:14,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2022-12-13 15:19:14,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 95 transitions. [2022-12-13 15:19:14,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:19:14,283 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-12-13 15:19:14,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 95 transitions. [2022-12-13 15:19:14,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-12-13 15:19:14,287 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:19:14,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2022-12-13 15:19:14,288 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-12-13 15:19:14,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:19:14,289 INFO L428 stractBuchiCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-12-13 15:19:14,289 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 15:19:14,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 95 transitions. [2022-12-13 15:19:14,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-12-13 15:19:14,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:19:14,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:19:14,292 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:19:14,292 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:19:14,292 INFO L748 eck$LassoCheckResult]: Stem: 404#$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(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; 405#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; 417#L134 assume 0 == ~r1~0 % 256; 414#L135 assume ~id1~0 >= 0; 390#L136 assume 0 == ~st1~0; 391#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; 419#L141 assume ~send2~0 == ~id2~0; 407#L142 assume 0 == ~mode2~0 % 256; 406#L143 assume ~id3~0 >= 0; 386#L144 assume 0 == ~st3~0; 387#L145 assume ~send3~0 == ~id3~0; 393#L146 assume 0 == ~mode3~0 % 256; 394#L147 assume ~id1~0 != ~id2~0; 403#L148 assume ~id1~0 != ~id3~0; 398#L149 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 399#L134-1 init_#res#1 := init_~tmp~0#1; 396#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;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; 397#L24 assume !(0 == assume_abort_if_not_~cond#1); 388#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; 389#L259-2 [2022-12-13 15:19:14,292 INFO L750 eck$LassoCheckResult]: Loop: 389#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; 421#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); 408#L211 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 409#$Ultimate##100 assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; 441#L207-1 check_#res#1 := check_~tmp~1#1; 440#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; 439#L282 assume !(0 == assert_~arg#1 % 256); 438#L277 assume { :end_inline_assert } true; 389#L259-2 [2022-12-13 15:19:14,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:19:14,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2022-12-13 15:19:14,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:19:14,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174932710] [2022-12-13 15:19:14,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:14,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:19:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:19:14,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:19:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:19:14,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:19:14,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:19:14,322 INFO L85 PathProgramCache]: Analyzing trace with hash -655493558, now seen corresponding path program 1 times [2022-12-13 15:19:14,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:19:14,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251485762] [2022-12-13 15:19:14,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:14,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:19:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:19:14,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:19:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:19:14,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:19:14,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:19:14,367 INFO L85 PathProgramCache]: Analyzing trace with hash 214545420, now seen corresponding path program 1 times [2022-12-13 15:19:14,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:19:14,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508795129] [2022-12-13 15:19:14,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:14,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:19:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:19:14,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:19:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:19:14,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:19:15,671 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 15:19:15,671 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 15:19:15,671 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 15:19:15,671 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 15:19:15,671 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-12-13 15:19:15,671 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:19:15,671 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 15:19:15,671 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 15:19:15,672 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-12-13 15:19:15,672 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 15:19:15,672 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 15:19:15,694 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:19:15,704 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:19:15,708 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 15:19:15,712 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 15:19:15,714 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:19:15,716 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:19:15,718 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 15:19:15,722 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:19:16,294 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:19:17,070 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2022-12-13 15:19:30,461 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 529730 conjuctions. This might take some time...