./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 e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_034f54c1-3519-43ca-a318-12e06da7b6fd/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_034f54c1-3519-43ca-a318-12e06da7b6fd/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_034f54c1-3519-43ca-a318-12e06da7b6fd/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_034f54c1-3519-43ca-a318-12e06da7b6fd/bin/uautomizer-tPACEb0tL8/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_034f54c1-3519-43ca-a318-12e06da7b6fd/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_034f54c1-3519-43ca-a318-12e06da7b6fd/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-e04fb08 [2022-11-16 12:03:20,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:03:20,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:03:20,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:03:20,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:03:20,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:03:20,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:03:20,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:03:20,135 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:03:20,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:03:20,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:03:20,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:03:20,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:03:20,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:03:20,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:03:20,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:03:20,145 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:03:20,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:03:20,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:03:20,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:03:20,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:03:20,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:03:20,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:03:20,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:03:20,178 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:03:20,178 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:03:20,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:03:20,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:03:20,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:03:20,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:03:20,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:03:20,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:03:20,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:03:20,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:03:20,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:03:20,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:03:20,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:03:20,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:03:20,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:03:20,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:03:20,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:03:20,203 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_034f54c1-3519-43ca-a318-12e06da7b6fd/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-16 12:03:20,230 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:03:20,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:03:20,231 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:03:20,231 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:03:20,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:03:20,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:03:20,233 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:03:20,233 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-16 12:03:20,234 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-16 12:03:20,234 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-16 12:03:20,234 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-16 12:03:20,234 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-16 12:03:20,235 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-16 12:03:20,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:03:20,235 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:03:20,236 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:03:20,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:03:20,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:03:20,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:03:20,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-16 12:03:20,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-16 12:03:20,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-16 12:03:20,237 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:03:20,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:03:20,238 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-16 12:03:20,238 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:03:20,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-16 12:03:20,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:03:20,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:03:20,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:03:20,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:03:20,241 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-16 12:03:20,241 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_034f54c1-3519-43ca-a318-12e06da7b6fd/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_034f54c1-3519-43ca-a318-12e06da7b6fd/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca [2022-11-16 12:03:20,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:03:20,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:03:20,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:03:20,657 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:03:20,658 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:03:20,660 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_034f54c1-3519-43ca-a318-12e06da7b6fd/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-16 12:03:20,761 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_034f54c1-3519-43ca-a318-12e06da7b6fd/bin/uautomizer-tPACEb0tL8/data/5cc613829/6aef31eff84346bda9265f9dcea9ebd5/FLAGcdf0de397 [2022-11-16 12:03:21,427 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:03:21,435 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_034f54c1-3519-43ca-a318-12e06da7b6fd/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-16 12:03:21,449 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_034f54c1-3519-43ca-a318-12e06da7b6fd/bin/uautomizer-tPACEb0tL8/data/5cc613829/6aef31eff84346bda9265f9dcea9ebd5/FLAGcdf0de397 [2022-11-16 12:03:21,724 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_034f54c1-3519-43ca-a318-12e06da7b6fd/bin/uautomizer-tPACEb0tL8/data/5cc613829/6aef31eff84346bda9265f9dcea9ebd5 [2022-11-16 12:03:21,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:03:21,729 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:03:21,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:03:21,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:03:21,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:03:21,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:03:21" (1/1) ... [2022-11-16 12:03:21,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2de580a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:21, skipping insertion in model container [2022-11-16 12:03:21,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:03:21" (1/1) ... [2022-11-16 12:03:21,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:03:21,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:03:22,079 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_034f54c1-3519-43ca-a318-12e06da7b6fd/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2022-11-16 12:03:22,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:03:22,092 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:03:22,152 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_034f54c1-3519-43ca-a318-12e06da7b6fd/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2022-11-16 12:03:22,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:03:22,177 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:03:22,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:22 WrapperNode [2022-11-16 12:03:22,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:03:22,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:03:22,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:03:22,180 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:03:22,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:22" (1/1) ... [2022-11-16 12:03:22,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:22" (1/1) ... [2022-11-16 12:03:22,231 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 194 [2022-11-16 12:03:22,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:03:22,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:03:22,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:03:22,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:03:22,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:22" (1/1) ... [2022-11-16 12:03:22,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:22" (1/1) ... [2022-11-16 12:03:22,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:22" (1/1) ... [2022-11-16 12:03:22,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:22" (1/1) ... [2022-11-16 12:03:22,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:22" (1/1) ... [2022-11-16 12:03:22,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:22" (1/1) ... [2022-11-16 12:03:22,261 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:22" (1/1) ... [2022-11-16 12:03:22,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:22" (1/1) ... [2022-11-16 12:03:22,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:03:22,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:03:22,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:03:22,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:03:22,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:22" (1/1) ... [2022-11-16 12:03:22,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 12:03:22,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_034f54c1-3519-43ca-a318-12e06da7b6fd/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:03:22,335 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_034f54c1-3519-43ca-a318-12e06da7b6fd/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 12:03:22,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_034f54c1-3519-43ca-a318-12e06da7b6fd/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-16 12:03:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:03:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:03:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:03:22,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:03:22,577 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:03:22,579 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:03:23,094 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:03:23,102 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:03:23,107 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 12:03:23,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:23 BoogieIcfgContainer [2022-11-16 12:03:23,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:03:23,112 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-16 12:03:23,113 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-16 12:03:23,118 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-16 12:03:23,119 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 12:03:23,119 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:03:21" (1/3) ... [2022-11-16 12:03:23,122 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fa39365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:03:23, skipping insertion in model container [2022-11-16 12:03:23,122 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 12:03:23,122 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:22" (2/3) ... [2022-11-16 12:03:23,123 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fa39365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:03:23, skipping insertion in model container [2022-11-16 12:03:23,123 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 12:03:23,123 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:23" (3/3) ... [2022-11-16 12:03:23,125 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-16 12:03:23,217 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-16 12:03:23,217 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-16 12:03:23,217 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-16 12:03:23,218 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-16 12:03:23,218 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-16 12:03:23,218 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-16 12:03:23,218 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-16 12:03:23,219 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-16 12:03:23,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 54 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:03:23,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2022-11-16 12:03:23,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 12:03:23,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 12:03:23,293 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:03:23,293 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:03:23,294 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-16 12:03:23,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 54 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:03:23,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2022-11-16 12:03:23,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 12:03:23,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 12:03:23,301 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:03:23,302 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:03:23,312 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);~p1~0 := 0;~nomsg~0 := -1;~p2~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p2_old~0 := 0;~send1~0 := 0;~send2~0 := 0;~p2_new~0 := 0;~send3~0 := 0;~st2~0 := 0;~st1~0 := 0;~p3_old~0 := 0;~st3~0 := 0;~id2~0 := 0;~p1_old~0 := 0;~id1~0 := 0;~id3~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 31#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~ret17#1, main_#t~ret18#1, main_~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-16 12:03:23,326 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-16 12:03:23,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:03:23,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2022-11-16 12:03:23,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:03:23,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528580785] [2022-11-16 12:03:23,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:03:23,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:03:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:03:23,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:03:23,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:03:23,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528580785] [2022-11-16 12:03:23,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528580785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:03:23,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:03:23,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:03:23,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189165111] [2022-11-16 12:03:23,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:03:23,705 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 12:03:23,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:03:23,709 INFO L85 PathProgramCache]: Analyzing trace with hash 317704902, now seen corresponding path program 1 times [2022-11-16 12:03:23,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:03:23,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816587824] [2022-11-16 12:03:23,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:03:23,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:03:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:03:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:03:24,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:03:24,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816587824] [2022-11-16 12:03:24,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816587824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:03:24,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:03:24,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:03:24,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346928444] [2022-11-16 12:03:24,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:03:24,246 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 12:03:24,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:03:24,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:03:24,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:03:24,313 INFO L87 Difference]: Start difference. First operand has 55 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 54 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:03:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:03:24,469 INFO L93 Difference]: Finished difference Result 54 states and 86 transitions. [2022-11-16 12:03:24,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 86 transitions. [2022-11-16 12:03:24,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-11-16 12:03:24,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 50 states and 67 transitions. [2022-11-16 12:03:24,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2022-11-16 12:03:24,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2022-11-16 12:03:24,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 67 transitions. [2022-11-16 12:03:24,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:03:24,482 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-11-16 12:03:24,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 67 transitions. [2022-11-16 12:03:24,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-16 12:03:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.34) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:03:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-11-16 12:03:24,515 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-11-16 12:03:24,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:03:24,521 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-11-16 12:03:24,521 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-16 12:03:24,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 67 transitions. [2022-11-16 12:03:24,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-11-16 12:03:24,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 12:03:24,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 12:03:24,525 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:03:24,525 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:03:24,525 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);~p1~0 := 0;~nomsg~0 := -1;~p2~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p2_old~0 := 0;~send1~0 := 0;~send2~0 := 0;~p2_new~0 := 0;~send3~0 := 0;~st2~0 := 0;~st1~0 := 0;~p3_old~0 := 0;~st3~0 := 0;~id2~0 := 0;~p1_old~0 := 0;~id1~0 := 0;~id3~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 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-16 12:03:24,526 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-16 12:03:24,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:03:24,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2022-11-16 12:03:24,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:03:24,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480263532] [2022-11-16 12:03:24,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:03:24,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:03:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:03:24,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:03:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:03:24,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:03:24,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:03:24,661 INFO L85 PathProgramCache]: Analyzing trace with hash 317704902, now seen corresponding path program 2 times [2022-11-16 12:03:24,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:03:24,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442184317] [2022-11-16 12:03:24,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:03:24,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:03:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:03:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:03:24,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:03:24,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442184317] [2022-11-16 12:03:24,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442184317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:03:24,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:03:24,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:03:24,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856166889] [2022-11-16 12:03:25,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:03:25,000 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 12:03:25,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:03:25,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:03:25,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:03:25,004 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. cyclomatic complexity: 18 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:03:25,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:03:25,094 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2022-11-16 12:03:25,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 69 transitions. [2022-11-16 12:03:25,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-11-16 12:03:25,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 50 states and 64 transitions. [2022-11-16 12:03:25,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2022-11-16 12:03:25,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2022-11-16 12:03:25,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 64 transitions. [2022-11-16 12:03:25,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:03:25,099 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-11-16 12:03:25,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 64 transitions. [2022-11-16 12:03:25,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-16 12:03:25,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.28) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:03:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-11-16 12:03:25,104 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-11-16 12:03:25,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:03:25,106 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-11-16 12:03:25,106 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-16 12:03:25,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 64 transitions. [2022-11-16 12:03:25,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-11-16 12:03:25,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 12:03:25,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 12:03:25,110 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:03:25,110 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:03:25,110 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);~p1~0 := 0;~nomsg~0 := -1;~p2~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p2_old~0 := 0;~send1~0 := 0;~send2~0 := 0;~p2_new~0 := 0;~send3~0 := 0;~st2~0 := 0;~st1~0 := 0;~p3_old~0 := 0;~st3~0 := 0;~id2~0 := 0;~p1_old~0 := 0;~id1~0 := 0;~id3~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 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-16 12:03:25,111 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-16 12:03:25,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:03:25,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2022-11-16 12:03:25,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:03:25,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653257553] [2022-11-16 12:03:25,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:03:25,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:03:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:03:25,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:03:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:03:25,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:03:25,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:03:25,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1044091498, now seen corresponding path program 1 times [2022-11-16 12:03:25,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:03:25,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058251505] [2022-11-16 12:03:25,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:03:25,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:03:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:03:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:03:25,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:03:25,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058251505] [2022-11-16 12:03:25,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058251505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:03:25,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:03:25,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:03:25,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379901377] [2022-11-16 12:03:25,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:03:25,183 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 12:03:25,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:03:25,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:03:25,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:03:25,185 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:03:25,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:03:25,217 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2022-11-16 12:03:25,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 95 transitions. [2022-11-16 12:03:25,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-11-16 12:03:25,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 95 transitions. [2022-11-16 12:03:25,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2022-11-16 12:03:25,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2022-11-16 12:03:25,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 95 transitions. [2022-11-16 12:03:25,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:03:25,223 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-11-16 12:03:25,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 95 transitions. [2022-11-16 12:03:25,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-16 12:03:25,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 71 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:03:25,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2022-11-16 12:03:25,230 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-11-16 12:03:25,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:03:25,231 INFO L428 stractBuchiCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-11-16 12:03:25,232 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-16 12:03:25,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 95 transitions. [2022-11-16 12:03:25,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-11-16 12:03:25,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 12:03:25,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 12:03:25,239 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:03:25,239 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:03:25,239 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);~p1~0 := 0;~nomsg~0 := -1;~p2~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p2_old~0 := 0;~send1~0 := 0;~send2~0 := 0;~p2_new~0 := 0;~send3~0 := 0;~st2~0 := 0;~st1~0 := 0;~p3_old~0 := 0;~st3~0 := 0;~id2~0 := 0;~p1_old~0 := 0;~id1~0 := 0;~id3~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 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-16 12:03:25,240 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-16 12:03:25,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:03:25,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2022-11-16 12:03:25,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:03:25,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268630374] [2022-11-16 12:03:25,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:03:25,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:03:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:03:25,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:03:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:03:25,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:03:25,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:03:25,297 INFO L85 PathProgramCache]: Analyzing trace with hash -655493558, now seen corresponding path program 1 times [2022-11-16 12:03:25,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:03:25,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357437299] [2022-11-16 12:03:25,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:03:25,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:03:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:03:25,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:03:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:03:25,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:03:25,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:03:25,398 INFO L85 PathProgramCache]: Analyzing trace with hash 214545420, now seen corresponding path program 1 times [2022-11-16 12:03:25,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:03:25,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850443761] [2022-11-16 12:03:25,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:03:25,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:03:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:03:25,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:03:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:03:25,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:03:28,105 INFO L210 LassoAnalysis]: Preferences: [2022-11-16 12:03:28,106 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-16 12:03:28,107 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-16 12:03:28,107 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-16 12:03:28,114 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-16 12:03:28,115 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 12:03:28,115 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-16 12:03:28,115 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-16 12:03:28,116 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-11-16 12:03:28,116 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-16 12:03:28,116 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-16 12:03:28,160 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 12:03:28,176 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 12:03:28,183 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 12:03:28,190 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 12:03:28,194 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 12:03:28,197 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 12:03:28,201 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 12:03:28,208 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 12:03:29,346 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 12:03:30,792 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2022-11-16 12:03:58,202 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 358668 conjuctions. This might take some time...