./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be84654c-5af3-4323-b380-568137e78631/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be84654c-5af3-4323-b380-568137e78631/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be84654c-5af3-4323-b380-568137e78631/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be84654c-5af3-4323-b380-568137e78631/bin/uautomizer-ZsLfNo2U6R/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be84654c-5af3-4323-b380-568137e78631/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be84654c-5af3-4323-b380-568137e78631/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cea4cc3548129351800c62333a8b3afa818cc0cede5b8fec1c7e8b8079e480c6 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:36:15,902 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:36:15,904 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:36:15,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:36:15,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:36:15,927 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:36:15,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:36:15,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:36:15,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:36:15,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:36:15,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:36:15,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:36:15,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:36:15,937 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:36:15,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:36:15,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:36:15,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:36:15,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:36:15,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:36:15,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:36:15,947 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:36:15,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:36:15,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:36:15,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:36:15,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:36:15,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:36:15,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:36:15,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:36:15,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:36:15,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:36:15,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:36:15,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:36:15,961 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:36:15,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:36:15,963 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:36:15,964 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:36:15,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:36:15,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:36:15,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:36:15,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:36:15,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:36:15,968 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be84654c-5af3-4323-b380-568137e78631/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-25 17:36:15,994 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:36:15,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:36:15,994 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:36:15,995 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:36:15,996 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:36:15,996 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:36:15,996 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:36:15,997 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-25 17:36:15,997 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-25 17:36:15,997 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-25 17:36:15,997 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-25 17:36:15,998 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-25 17:36:15,998 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-25 17:36:15,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:36:15,998 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:36:15,999 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:36:15,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:36:15,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:36:15,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:36:16,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-25 17:36:16,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-25 17:36:16,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-25 17:36:16,000 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:36:16,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:36:16,001 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-25 17:36:16,001 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:36:16,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-25 17:36:16,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:36:16,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:36:16,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:36:16,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:36:16,004 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-25 17:36:16,004 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_be84654c-5af3-4323-b380-568137e78631/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be84654c-5af3-4323-b380-568137e78631/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cea4cc3548129351800c62333a8b3afa818cc0cede5b8fec1c7e8b8079e480c6 [2022-11-25 17:36:16,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:36:16,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:36:16,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:36:16,312 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:36:16,312 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:36:16,314 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be84654c-5af3-4323-b380-568137e78631/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2022-11-25 17:36:19,517 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:36:19,750 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:36:19,750 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be84654c-5af3-4323-b380-568137e78631/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2022-11-25 17:36:19,759 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be84654c-5af3-4323-b380-568137e78631/bin/uautomizer-ZsLfNo2U6R/data/22dfccda6/519f2bda9690439c8f273118aa408316/FLAG197e203db [2022-11-25 17:36:19,775 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be84654c-5af3-4323-b380-568137e78631/bin/uautomizer-ZsLfNo2U6R/data/22dfccda6/519f2bda9690439c8f273118aa408316 [2022-11-25 17:36:19,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:36:19,779 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:36:19,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:36:19,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:36:19,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:36:19,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:36:19" (1/1) ... [2022-11-25 17:36:19,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b627657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:36:19, skipping insertion in model container [2022-11-25 17:36:19,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:36:19" (1/1) ... [2022-11-25 17:36:19,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:36:19,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:36:20,063 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_be84654c-5af3-4323-b380-568137e78631/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c[12639,12652] [2022-11-25 17:36:20,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:36:20,079 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:36:20,169 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_be84654c-5af3-4323-b380-568137e78631/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c[12639,12652] [2022-11-25 17:36:20,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:36:20,198 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:36:20,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:36:20 WrapperNode [2022-11-25 17:36:20,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:36:20,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:36:20,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:36:20,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:36:20,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:36:20" (1/1) ... [2022-11-25 17:36:20,241 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:36:20" (1/1) ... [2022-11-25 17:36:20,277 INFO L138 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 330 [2022-11-25 17:36:20,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:36:20,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:36:20,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:36:20,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:36:20,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:36:20" (1/1) ... [2022-11-25 17:36:20,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:36:20" (1/1) ... [2022-11-25 17:36:20,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:36:20" (1/1) ... [2022-11-25 17:36:20,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:36:20" (1/1) ... [2022-11-25 17:36:20,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:36:20" (1/1) ... [2022-11-25 17:36:20,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:36:20" (1/1) ... [2022-11-25 17:36:20,313 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:36:20" (1/1) ... [2022-11-25 17:36:20,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:36:20" (1/1) ... [2022-11-25 17:36:20,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:36:20,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:36:20,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:36:20,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:36:20,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:36:20" (1/1) ... [2022-11-25 17:36:20,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:36:20,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be84654c-5af3-4323-b380-568137e78631/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:36:20,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be84654c-5af3-4323-b380-568137e78631/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:36:20,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be84654c-5af3-4323-b380-568137e78631/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-25 17:36:20,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:36:20,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:36:20,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:36:20,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:36:20,522 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:36:20,524 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:36:21,144 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:36:21,154 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:36:21,154 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 17:36:21,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:36:21 BoogieIcfgContainer [2022-11-25 17:36:21,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:36:21,159 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-25 17:36:21,159 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-25 17:36:21,164 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-25 17:36:21,165 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 17:36:21,165 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 05:36:19" (1/3) ... [2022-11-25 17:36:21,166 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b2578af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 05:36:21, skipping insertion in model container [2022-11-25 17:36:21,167 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 17:36:21,167 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:36:20" (2/3) ... [2022-11-25 17:36:21,167 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b2578af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 05:36:21, skipping insertion in model container [2022-11-25 17:36:21,167 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 17:36:21,168 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:36:21" (3/3) ... [2022-11-25 17:36:21,170 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2022-11-25 17:36:21,235 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-25 17:36:21,235 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-25 17:36:21,235 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-25 17:36:21,236 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-25 17:36:21,236 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-25 17:36:21,236 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-25 17:36:21,236 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-25 17:36:21,236 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-25 17:36:21,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 100 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 99 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:36:21,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2022-11-25 17:36:21,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:36:21,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:36:21,280 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:36:21,280 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:36:21,281 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-25 17:36:21,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 100 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 99 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:36:21,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2022-11-25 17:36:21,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:36:21,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:36:21,289 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:36:21,290 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:36:21,299 INFO L748 eck$LassoCheckResult]: Stem: 83#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(50, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; 25#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~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1, main_#t~post32#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 56#L243true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 88#L243-1true init_#res#1 := init_~tmp~0#1; 22#L372true main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#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; 27#L22true assume !(0 == assume_abort_if_not_~cond#1); 70#L21true assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 66#L441-2true [2022-11-25 17:36:21,301 INFO L750 eck$LassoCheckResult]: Loop: 66#L441-2true assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 46#L76true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 9#L80true assume !(node1_~m1~0#1 != ~nomsg~0); 78#L80-1true ~mode1~0 := 0; 84#L76-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; 15#L108true assume !(0 != ~mode2~0 % 256); 60#L125true assume 0 != ~alive2~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); 100#L128-2true ~mode2~0 := 1; 65#L108-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; 72#L142true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 39#L145true assume !(node3_~m3~0#1 != ~nomsg~0); 47#L145-1true ~mode3~0 := 0; 68#L142-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 29#L176true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 90#L179true assume !(node4_~m4~0#1 != ~nomsg~0); 55#L179-1true ~mode4~0 := 0; 95#L176-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 7#L210true assume !(0 != ~mode5~0 % 256); 69#L227true assume 0 != ~alive5~0 % 256;~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256); 82#L230-2true ~mode5~0 := 1; 85#L210-2true assume { :end_inline_node5 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 52#L380true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 5#L380-1true check_#res#1 := check_~tmp~1#1; 30#L392true main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 17#L471true assume !(0 == assert_~arg#1 % 256); 96#L466true assume { :end_inline_assert } true;main_#t~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; 66#L441-2true [2022-11-25 17:36:21,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:36:21,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1984313218, now seen corresponding path program 1 times [2022-11-25 17:36:21,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:36:21,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094336068] [2022-11-25 17:36:21,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:36:21,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:36:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:36:21,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:36:21,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094336068] [2022-11-25 17:36:21,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094336068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:36:21,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:36:21,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:36:21,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750023209] [2022-11-25 17:36:21,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:36:21,799 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:36:21,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:36:21,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1571904528, now seen corresponding path program 1 times [2022-11-25 17:36:21,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:36:21,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117948831] [2022-11-25 17:36:21,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:36:21,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:36:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:22,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-25 17:36:22,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:36:22,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117948831] [2022-11-25 17:36:22,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117948831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:36:22,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:36:22,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:36:22,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20165864] [2022-11-25 17:36:22,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:36:22,185 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 17:36:22,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:36:22,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:36:22,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:36:22,249 INFO L87 Difference]: Start difference. First operand has 100 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 99 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:36:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:36:22,417 INFO L93 Difference]: Finished difference Result 103 states and 171 transitions. [2022-11-25 17:36:22,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 171 transitions. [2022-11-25 17:36:22,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 57 [2022-11-25 17:36:22,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 95 states and 132 transitions. [2022-11-25 17:36:22,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2022-11-25 17:36:22,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2022-11-25 17:36:22,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 132 transitions. [2022-11-25 17:36:22,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:36:22,443 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 132 transitions. [2022-11-25 17:36:22,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 132 transitions. [2022-11-25 17:36:22,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-25 17:36:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 94 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:36:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2022-11-25 17:36:22,486 INFO L240 hiAutomatonCegarLoop]: Abstraction has 95 states and 132 transitions. [2022-11-25 17:36:22,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:36:22,490 INFO L428 stractBuchiCegarLoop]: Abstraction has 95 states and 132 transitions. [2022-11-25 17:36:22,491 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-25 17:36:22,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 132 transitions. [2022-11-25 17:36:22,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 57 [2022-11-25 17:36:22,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:36:22,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:36:22,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:36:22,493 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:36:22,494 INFO L748 eck$LassoCheckResult]: Stem: 306#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(50, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; 296#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~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1, main_#t~post32#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 250#L243 assume 0 == ~r1~0; 239#L244 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 240#L245 assume ~id1~0 >= 0; 283#L246 assume 0 == ~st1~0; 294#L247 assume ~send1~0 == ~id1~0; 295#L248 assume 0 == ~mode1~0 % 256; 231#L249 assume ~id2~0 >= 0; 232#L250 assume 0 == ~st2~0; 252#L251 assume ~send2~0 == ~id2~0; 253#L252 assume 0 == ~mode2~0 % 256; 255#L253 assume ~id3~0 >= 0; 256#L254 assume 0 == ~st3~0; 257#L255 assume ~send3~0 == ~id3~0; 258#L256 assume 0 == ~mode3~0 % 256; 305#L257 assume ~id4~0 >= 0; 287#L258 assume 0 == ~st4~0; 224#L259 assume ~send4~0 == ~id4~0; 225#L260 assume 0 == ~mode4~0 % 256; 315#L261 assume ~id5~0 >= 0; 311#L262 assume 0 == ~st5~0; 312#L263 assume ~send5~0 == ~id5~0; 313#L264 assume 0 == ~mode5~0 % 256; 226#L265 assume ~id1~0 != ~id2~0; 227#L266 assume ~id1~0 != ~id3~0; 251#L267 assume ~id1~0 != ~id4~0; 270#L268 assume ~id1~0 != ~id5~0; 271#L269 assume ~id2~0 != ~id3~0; 241#L270 assume ~id2~0 != ~id4~0; 242#L271 assume ~id2~0 != ~id5~0; 288#L272 assume ~id3~0 != ~id4~0; 299#L273 assume ~id3~0 != ~id5~0; 265#L274 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 266#L243-1 init_#res#1 := init_~tmp~0#1; 290#L372 main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#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; 291#L22 assume !(0 == assume_abort_if_not_~cond#1); 285#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 279#L441-2 [2022-11-25 17:36:22,494 INFO L750 eck$LassoCheckResult]: Loop: 279#L441-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 280#L76 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 246#L80 assume !(node1_~m1~0#1 != ~nomsg~0); 248#L80-1 ~mode1~0 := 0; 293#L76-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; 272#L108 assume !(0 != ~mode2~0 % 256); 259#L125 assume 0 != ~alive2~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); 260#L128-2 ~mode2~0 := 1; 275#L108-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; 276#L142 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 289#L145 assume !(node3_~m3~0#1 != ~nomsg~0); 264#L145-1 ~mode3~0 := 0; 281#L142-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 282#L176 assume !(0 != ~mode4~0 % 256); 301#L193 assume 0 != ~alive4~0 % 256;~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256); 307#L196-2 ~mode4~0 := 1; 249#L176-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 243#L210 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 244#L213 assume !(node5_~m5~0#1 != ~nomsg~0); 298#L213-1 ~mode5~0 := 0; 304#L210-2 assume { :end_inline_node5 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 228#L380 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 229#L380-1 check_#res#1 := check_~tmp~1#1; 233#L392 main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 277#L471 assume !(0 == assert_~arg#1 % 256); 278#L466 assume { :end_inline_assert } true;main_#t~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; 279#L441-2 [2022-11-25 17:36:22,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:36:22,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1707437673, now seen corresponding path program 1 times [2022-11-25 17:36:22,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:36:22,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479369154] [2022-11-25 17:36:22,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:36:22,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:36:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:36:22,529 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:36:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:36:22,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:36:22,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:36:22,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1799871344, now seen corresponding path program 1 times [2022-11-25 17:36:22,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:36:22,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448955881] [2022-11-25 17:36:22,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:36:22,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:36:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:36:22,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:36:22,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448955881] [2022-11-25 17:36:22,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448955881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:36:22,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:36:22,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:36:22,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233091148] [2022-11-25 17:36:22,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:36:22,864 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 17:36:22,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:36:22,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:36:22,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:36:22,865 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. cyclomatic complexity: 38 Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:36:22,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:36:22,932 INFO L93 Difference]: Finished difference Result 98 states and 134 transitions. [2022-11-25 17:36:22,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 134 transitions. [2022-11-25 17:36:22,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 57 [2022-11-25 17:36:22,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 95 states and 130 transitions. [2022-11-25 17:36:22,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2022-11-25 17:36:22,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2022-11-25 17:36:22,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 130 transitions. [2022-11-25 17:36:22,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:36:22,937 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 130 transitions. [2022-11-25 17:36:22,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 130 transitions. [2022-11-25 17:36:22,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-25 17:36:22,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.368421052631579) internal successors, (130), 94 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:36:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 130 transitions. [2022-11-25 17:36:22,946 INFO L240 hiAutomatonCegarLoop]: Abstraction has 95 states and 130 transitions. [2022-11-25 17:36:22,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:36:22,948 INFO L428 stractBuchiCegarLoop]: Abstraction has 95 states and 130 transitions. [2022-11-25 17:36:22,948 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-25 17:36:22,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 130 transitions. [2022-11-25 17:36:22,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 57 [2022-11-25 17:36:22,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:36:22,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:36:22,954 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:36:22,954 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:36:22,954 INFO L748 eck$LassoCheckResult]: Stem: 511#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(50, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; 501#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~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1, main_#t~post32#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 455#L243 assume 0 == ~r1~0; 444#L244 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 445#L245 assume ~id1~0 >= 0; 488#L246 assume 0 == ~st1~0; 499#L247 assume ~send1~0 == ~id1~0; 500#L248 assume 0 == ~mode1~0 % 256; 435#L249 assume ~id2~0 >= 0; 436#L250 assume 0 == ~st2~0; 457#L251 assume ~send2~0 == ~id2~0; 458#L252 assume 0 == ~mode2~0 % 256; 460#L253 assume ~id3~0 >= 0; 461#L254 assume 0 == ~st3~0; 462#L255 assume ~send3~0 == ~id3~0; 463#L256 assume 0 == ~mode3~0 % 256; 510#L257 assume ~id4~0 >= 0; 492#L258 assume 0 == ~st4~0; 429#L259 assume ~send4~0 == ~id4~0; 430#L260 assume 0 == ~mode4~0 % 256; 520#L261 assume ~id5~0 >= 0; 516#L262 assume 0 == ~st5~0; 517#L263 assume ~send5~0 == ~id5~0; 518#L264 assume 0 == ~mode5~0 % 256; 431#L265 assume ~id1~0 != ~id2~0; 432#L266 assume ~id1~0 != ~id3~0; 456#L267 assume ~id1~0 != ~id4~0; 475#L268 assume ~id1~0 != ~id5~0; 476#L269 assume ~id2~0 != ~id3~0; 449#L270 assume ~id2~0 != ~id4~0; 450#L271 assume ~id2~0 != ~id5~0; 493#L272 assume ~id3~0 != ~id4~0; 504#L273 assume ~id3~0 != ~id5~0; 470#L274 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 471#L243-1 init_#res#1 := init_~tmp~0#1; 495#L372 main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#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; 496#L22 assume !(0 == assume_abort_if_not_~cond#1); 490#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 484#L441-2 [2022-11-25 17:36:22,955 INFO L750 eck$LassoCheckResult]: Loop: 484#L441-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 485#L76 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 452#L80 assume !(node1_~m1~0#1 != ~nomsg~0); 454#L80-1 ~mode1~0 := 0; 498#L76-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; 477#L108 assume !(0 != ~mode2~0 % 256); 464#L125 assume 0 != ~alive2~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); 465#L128-2 ~mode2~0 := 1; 480#L108-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; 481#L142 assume !(0 != ~mode3~0 % 256); 441#L159 assume 0 != ~alive3~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); 442#L162-2 ~mode3~0 := 1; 486#L142-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 487#L176 assume !(0 != ~mode4~0 % 256); 505#L193 assume 0 != ~alive4~0 % 256;~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256); 512#L196-2 ~mode4~0 := 1; 451#L176-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 446#L210 assume !(0 != ~mode5~0 % 256); 448#L227 assume 0 != ~alive5~0 % 256;~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256); 440#L230-2 ~mode5~0 := 1; 508#L210-2 assume { :end_inline_node5 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 433#L380 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 434#L381 assume ~r1~0 < 5;check_~tmp~1#1 := 1; 437#L380-1 check_#res#1 := check_~tmp~1#1; 438#L392 main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 482#L471 assume !(0 == assert_~arg#1 % 256); 483#L466 assume { :end_inline_assert } true;main_#t~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; 484#L441-2 [2022-11-25 17:36:22,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:36:22,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1707437673, now seen corresponding path program 2 times [2022-11-25 17:36:22,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:36:22,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679919912] [2022-11-25 17:36:22,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:36:22,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:36:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:36:23,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:36:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:36:23,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:36:23,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:36:23,038 INFO L85 PathProgramCache]: Analyzing trace with hash -202400587, now seen corresponding path program 1 times [2022-11-25 17:36:23,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:36:23,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103430017] [2022-11-25 17:36:23,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:36:23,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:36:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:36:23,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:36:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:36:23,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:36:23,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:36:23,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1159511391, now seen corresponding path program 1 times [2022-11-25 17:36:23,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:36:23,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990788709] [2022-11-25 17:36:23,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:36:23,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:36:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:36:23,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:36:23,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990788709] [2022-11-25 17:36:23,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990788709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:36:23,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:36:23,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:36:23,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455873543] [2022-11-25 17:36:23,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:36:26,833 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 17:36:26,834 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 17:36:26,834 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 17:36:26,834 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 17:36:26,834 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-25 17:36:26,834 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:36:26,834 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 17:36:26,835 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 17:36:26,835 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2022-11-25 17:36:26,835 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 17:36:26,835 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 17:36:26,873 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:36:26,885 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:36:26,892 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:36:26,895 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:36:26,900 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:36:26,902 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:36:26,907 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:36:26,914 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:36:26,917 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:36:26,932 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:36:26,938 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:36:26,941 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:36:26,947 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:36:26,950 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:36:26,956 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:36:26,959 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:36:26,962 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:36:30,320 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 20