./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 6382bf7d3923cc5e5d05cc0b7a660c702c8db87925ef073e0a0a8704a68a4a3b --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 19:43:47,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 19:43:47,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 19:43:47,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 19:43:47,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 19:43:47,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 19:43:47,068 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 19:43:47,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 19:43:47,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 19:43:47,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 19:43:47,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 19:43:47,077 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 19:43:47,077 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 19:43:47,079 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 19:43:47,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 19:43:47,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 19:43:47,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 19:43:47,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 19:43:47,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 19:43:47,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 19:43:47,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 19:43:47,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 19:43:47,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 19:43:47,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 19:43:47,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 19:43:47,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 19:43:47,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 19:43:47,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 19:43:47,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 19:43:47,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 19:43:47,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 19:43:47,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 19:43:47,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 19:43:47,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 19:43:47,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 19:43:47,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 19:43:47,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 19:43:47,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 19:43:47,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 19:43:47,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 19:43:47,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 19:43:47,106 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-19 19:43:47,132 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 19:43:47,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 19:43:47,133 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 19:43:47,133 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 19:43:47,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 19:43:47,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 19:43:47,134 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 19:43:47,135 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-19 19:43:47,135 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-19 19:43:47,135 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-19 19:43:47,136 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-19 19:43:47,136 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-19 19:43:47,136 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-19 19:43:47,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 19:43:47,136 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 19:43:47,136 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 19:43:47,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 19:43:47,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 19:43:47,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 19:43:47,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-19 19:43:47,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-19 19:43:47,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-19 19:43:47,137 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 19:43:47,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-19 19:43:47,138 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-19 19:43:47,138 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 19:43:47,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-19 19:43:47,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 19:43:47,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 19:43:47,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 19:43:47,139 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 19:43:47,139 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 19:43:47,140 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-19 19:43:47,140 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 6382bf7d3923cc5e5d05cc0b7a660c702c8db87925ef073e0a0a8704a68a4a3b [2021-12-19 19:43:47,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 19:43:47,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 19:43:47,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 19:43:47,351 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 19:43:47,351 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 19:43:47,352 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.UNBOUNDED.pals.c [2021-12-19 19:43:47,421 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1e7a32c3/34a13eeb217b4997b69d84f36c6b17f7/FLAG1e8dfee04 [2021-12-19 19:43:47,806 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 19:43:47,807 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.UNBOUNDED.pals.c [2021-12-19 19:43:47,817 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1e7a32c3/34a13eeb217b4997b69d84f36c6b17f7/FLAG1e8dfee04 [2021-12-19 19:43:47,826 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1e7a32c3/34a13eeb217b4997b69d84f36c6b17f7 [2021-12-19 19:43:47,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 19:43:47,831 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 19:43:47,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 19:43:47,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 19:43:47,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 19:43:47,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 07:43:47" (1/1) ... [2021-12-19 19:43:47,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@334afb0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:43:47, skipping insertion in model container [2021-12-19 19:43:47,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 07:43:47" (1/1) ... [2021-12-19 19:43:47,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 19:43:47,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 19:43:48,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.UNBOUNDED.pals.c[11298,11311] [2021-12-19 19:43:48,048 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 19:43:48,054 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 19:43:48,103 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.UNBOUNDED.pals.c[11298,11311] [2021-12-19 19:43:48,104 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 19:43:48,113 INFO L208 MainTranslator]: Completed translation [2021-12-19 19:43:48,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:43:48 WrapperNode [2021-12-19 19:43:48,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 19:43:48,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 19:43:48,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 19:43:48,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 19:43:48,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:43:48" (1/1) ... [2021-12-19 19:43:48,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:43:48" (1/1) ... [2021-12-19 19:43:48,163 INFO L137 Inliner]: procedures = 25, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 315 [2021-12-19 19:43:48,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 19:43:48,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 19:43:48,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 19:43:48,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 19:43:48,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:43:48" (1/1) ... [2021-12-19 19:43:48,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:43:48" (1/1) ... [2021-12-19 19:43:48,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:43:48" (1/1) ... [2021-12-19 19:43:48,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:43:48" (1/1) ... [2021-12-19 19:43:48,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:43:48" (1/1) ... [2021-12-19 19:43:48,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:43:48" (1/1) ... [2021-12-19 19:43:48,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:43:48" (1/1) ... [2021-12-19 19:43:48,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 19:43:48,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 19:43:48,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 19:43:48,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 19:43:48,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:43:48" (1/1) ... [2021-12-19 19:43:48,202 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:43:48,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:43:48,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 19:43:48,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-19 19:43:48,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-19 19:43:48,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-19 19:43:48,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 19:43:48,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 19:43:48,319 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 19:43:48,320 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 19:43:48,547 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 19:43:48,552 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 19:43:48,552 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-19 19:43:48,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 07:43:48 BoogieIcfgContainer [2021-12-19 19:43:48,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 19:43:48,554 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-19 19:43:48,554 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-19 19:43:48,557 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-19 19:43:48,557 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 19:43:48,558 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.12 07:43:47" (1/3) ... [2021-12-19 19:43:48,558 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73e0d076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 07:43:48, skipping insertion in model container [2021-12-19 19:43:48,558 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 19:43:48,559 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 07:43:48" (2/3) ... [2021-12-19 19:43:48,559 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73e0d076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 07:43:48, skipping insertion in model container [2021-12-19 19:43:48,559 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 19:43:48,559 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 07:43:48" (3/3) ... [2021-12-19 19:43:48,560 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c [2021-12-19 19:43:48,586 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-19 19:43:48,586 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-19 19:43:48,587 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-19 19:43:48,587 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-19 19:43:48,587 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-19 19:43:48,587 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-19 19:43:48,587 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-19 19:43:48,587 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-19 19:43:48,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 94 states, 93 states have (on average 1.7096774193548387) internal successors, (159), 93 states have internal predecessors, (159), 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) [2021-12-19 19:43:48,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2021-12-19 19:43:48,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:43:48,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:43:48,624 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 19:43:48,624 INFO L843 BuchiCegarLoop]: 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] [2021-12-19 19:43:48,625 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-19 19:43:48,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 94 states, 93 states have (on average 1.7096774193548387) internal successors, (159), 93 states have internal predecessors, (159), 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) [2021-12-19 19:43:48,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2021-12-19 19:43:48,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:43:48,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:43:48,637 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 19:43:48,637 INFO L843 BuchiCegarLoop]: 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] [2021-12-19 19:43:48,643 INFO L791 eck$LassoCheckResult]: Stem: 64#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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; 52#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_~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~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~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; 90#L201true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 36#L201-1true init_#res#1 := init_~tmp~0#1; 39#L326true 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; 57#L22true assume !(0 == assume_abort_if_not_~cond#1); 41#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; 34#L398-2true [2021-12-19 19:43:48,647 INFO L793 eck$LassoCheckResult]: Loop: 34#L398-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 6#L71true assume !(0 != ~mode1~0 % 256); 72#L90true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 43#L90-2true ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 80#L71-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 61#L102true assume !(0 != ~mode2~0 % 256); 77#L115true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 82#L115-2true ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 60#L102-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 71#L127true assume !(0 != ~mode3~0 % 256); 74#L140true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 69#L140-2true ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 85#L127-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 42#L152true assume !(0 != ~mode4~0 % 256); 14#L165true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 30#L165-2true ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 22#L152-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 70#L177true assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 4#L180true assume !(node5_~m5~0#1 != ~nomsg~0); 29#L180-1true ~mode5~0 := 0; 66#L177-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; 44#L334true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 48#L334-1true check_#res#1 := check_~tmp~1#1; 75#L354true 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; 27#L427true assume !(0 == assert_~arg#1 % 256); 19#L422true assume { :end_inline_assert } true; 34#L398-2true [2021-12-19 19:43:48,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:43:48,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1978587388, now seen corresponding path program 1 times [2021-12-19 19:43:48,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:43:48,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119007900] [2021-12-19 19:43:48,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:43:48,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:43:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:43:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 19:43:48,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:43:48,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119007900] [2021-12-19 19:43:48,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119007900] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:43:48,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:43:48,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 19:43:48,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342027598] [2021-12-19 19:43:48,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:43:48,835 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 19:43:48,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:43:48,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1523633561, now seen corresponding path program 1 times [2021-12-19 19:43:48,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:43:48,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481133021] [2021-12-19 19:43:48,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:43:48,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:43:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:43:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 19:43:48,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:43:48,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481133021] [2021-12-19 19:43:48,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481133021] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:43:48,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:43:48,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 19:43:48,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771274253] [2021-12-19 19:43:48,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:43:48,998 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 19:43:48,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 19:43:49,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 19:43:49,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-19 19:43:49,029 INFO L87 Difference]: Start difference. First operand has 94 states, 93 states have (on average 1.7096774193548387) internal successors, (159), 93 states have internal predecessors, (159), 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) [2021-12-19 19:43:49,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 19:43:49,120 INFO L93 Difference]: Finished difference Result 93 states and 154 transitions. [2021-12-19 19:43:49,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 19:43:49,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 154 transitions. [2021-12-19 19:43:49,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2021-12-19 19:43:49,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 89 states and 120 transitions. [2021-12-19 19:43:49,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2021-12-19 19:43:49,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2021-12-19 19:43:49,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 120 transitions. [2021-12-19 19:43:49,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 19:43:49,144 INFO L681 BuchiCegarLoop]: Abstraction has 89 states and 120 transitions. [2021-12-19 19:43:49,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 120 transitions. [2021-12-19 19:43:49,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-12-19 19:43:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.348314606741573) internal successors, (120), 88 states have internal predecessors, (120), 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) [2021-12-19 19:43:49,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2021-12-19 19:43:49,165 INFO L704 BuchiCegarLoop]: Abstraction has 89 states and 120 transitions. [2021-12-19 19:43:49,166 INFO L587 BuchiCegarLoop]: Abstraction has 89 states and 120 transitions. [2021-12-19 19:43:49,166 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-19 19:43:49,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 120 transitions. [2021-12-19 19:43:49,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2021-12-19 19:43:49,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:43:49,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:43:49,171 INFO L842 BuchiCegarLoop]: 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] [2021-12-19 19:43:49,171 INFO L843 BuchiCegarLoop]: 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] [2021-12-19 19:43:49,171 INFO L791 eck$LassoCheckResult]: Stem: 284#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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; 271#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_~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~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~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; 272#L201 assume 0 == ~r1~0 % 256; 243#L202 assume ~id1~0 >= 0; 244#L203 assume 0 == ~st1~0; 261#L204 assume ~send1~0 == ~id1~0; 221#L205 assume 0 == ~mode1~0 % 256; 222#L206 assume ~id2~0 >= 0; 208#L207 assume 0 == ~st2~0; 209#L208 assume ~send2~0 == ~id2~0; 270#L209 assume 0 == ~mode2~0 % 256; 223#L210 assume ~id3~0 >= 0; 224#L211 assume 0 == ~st3~0; 210#L212 assume ~send3~0 == ~id3~0; 211#L213 assume 0 == ~mode3~0 % 256; 290#L214 assume ~id4~0 >= 0; 291#L215 assume 0 == ~st4~0; 269#L216 assume ~send4~0 == ~id4~0; 247#L217 assume 0 == ~mode4~0 % 256; 248#L218 assume ~id5~0 >= 0; 273#L219 assume 0 == ~st5~0; 293#L220 assume ~send5~0 == ~id5~0; 237#L221 assume 0 == ~mode5~0 % 256; 235#L222 assume ~id1~0 != ~id2~0; 236#L223 assume ~id1~0 != ~id3~0; 229#L224 assume ~id1~0 != ~id4~0; 230#L225 assume ~id1~0 != ~id5~0; 225#L226 assume ~id2~0 != ~id3~0; 226#L227 assume ~id2~0 != ~id4~0; 245#L228 assume ~id2~0 != ~id5~0; 246#L229 assume ~id3~0 != ~id4~0; 217#L230 assume ~id3~0 != ~id5~0; 218#L231 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 231#L201-1 init_#res#1 := init_~tmp~0#1; 260#L326 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; 262#L22 assume !(0 == assume_abort_if_not_~cond#1); 263#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; 234#L398-2 [2021-12-19 19:43:49,171 INFO L793 eck$LassoCheckResult]: Loop: 234#L398-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 212#L71 assume !(0 != ~mode1~0 % 256); 214#L90 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 266#L90-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 256#L71-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 281#L102 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 240#L105 assume !(node2_~m2~0#1 != ~nomsg~0); 241#L105-1 ~mode2~0 := 0; 279#L102-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 280#L127 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 288#L130 assume !(node3_~m3~0#1 != ~nomsg~0); 277#L130-1 ~mode3~0 := 0; 286#L127-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 264#L152 assume !(0 != ~mode4~0 % 256); 227#L165 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 228#L165-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 238#L152-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 239#L177 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 205#L180 assume !(node5_~m5~0#1 != ~nomsg~0); 207#L180-1 ~mode5~0 := 0; 252#L177-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; 267#L334 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 259#L334-1 check_#res#1 := check_~tmp~1#1; 268#L354 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; 249#L427 assume !(0 == assert_~arg#1 % 256); 233#L422 assume { :end_inline_assert } true; 234#L398-2 [2021-12-19 19:43:49,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:43:49,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 1 times [2021-12-19 19:43:49,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:43:49,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117087314] [2021-12-19 19:43:49,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:43:49,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:43:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:43:49,208 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 19:43:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:43:49,274 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 19:43:49,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:43:49,275 INFO L85 PathProgramCache]: Analyzing trace with hash 762981805, now seen corresponding path program 1 times [2021-12-19 19:43:49,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:43:49,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506669162] [2021-12-19 19:43:49,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:43:49,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:43:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:43:49,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 19:43:49,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:43:49,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506669162] [2021-12-19 19:43:49,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506669162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:43:49,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:43:49,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 19:43:49,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660493795] [2021-12-19 19:43:49,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:43:49,359 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 19:43:49,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 19:43:49,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 19:43:49,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-19 19:43:49,360 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. cyclomatic complexity: 32 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) [2021-12-19 19:43:49,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 19:43:49,402 INFO L93 Difference]: Finished difference Result 92 states and 122 transitions. [2021-12-19 19:43:49,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 19:43:49,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 122 transitions. [2021-12-19 19:43:49,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2021-12-19 19:43:49,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 89 states and 117 transitions. [2021-12-19 19:43:49,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2021-12-19 19:43:49,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2021-12-19 19:43:49,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 117 transitions. [2021-12-19 19:43:49,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 19:43:49,408 INFO L681 BuchiCegarLoop]: Abstraction has 89 states and 117 transitions. [2021-12-19 19:43:49,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 117 transitions. [2021-12-19 19:43:49,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-12-19 19:43:49,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 88 states have internal predecessors, (117), 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) [2021-12-19 19:43:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 117 transitions. [2021-12-19 19:43:49,416 INFO L704 BuchiCegarLoop]: Abstraction has 89 states and 117 transitions. [2021-12-19 19:43:49,416 INFO L587 BuchiCegarLoop]: Abstraction has 89 states and 117 transitions. [2021-12-19 19:43:49,416 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-19 19:43:49,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 117 transitions. [2021-12-19 19:43:49,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2021-12-19 19:43:49,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:43:49,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:43:49,420 INFO L842 BuchiCegarLoop]: 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] [2021-12-19 19:43:49,420 INFO L843 BuchiCegarLoop]: 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, 1] [2021-12-19 19:43:49,421 INFO L791 eck$LassoCheckResult]: Stem: 477#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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; 464#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_~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~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~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; 465#L201 assume 0 == ~r1~0 % 256; 436#L202 assume ~id1~0 >= 0; 437#L203 assume 0 == ~st1~0; 454#L204 assume ~send1~0 == ~id1~0; 414#L205 assume 0 == ~mode1~0 % 256; 415#L206 assume ~id2~0 >= 0; 401#L207 assume 0 == ~st2~0; 402#L208 assume ~send2~0 == ~id2~0; 463#L209 assume 0 == ~mode2~0 % 256; 416#L210 assume ~id3~0 >= 0; 417#L211 assume 0 == ~st3~0; 403#L212 assume ~send3~0 == ~id3~0; 404#L213 assume 0 == ~mode3~0 % 256; 483#L214 assume ~id4~0 >= 0; 484#L215 assume 0 == ~st4~0; 462#L216 assume ~send4~0 == ~id4~0; 441#L217 assume 0 == ~mode4~0 % 256; 442#L218 assume ~id5~0 >= 0; 466#L219 assume 0 == ~st5~0; 486#L220 assume ~send5~0 == ~id5~0; 430#L221 assume 0 == ~mode5~0 % 256; 428#L222 assume ~id1~0 != ~id2~0; 429#L223 assume ~id1~0 != ~id3~0; 422#L224 assume ~id1~0 != ~id4~0; 423#L225 assume ~id1~0 != ~id5~0; 418#L226 assume ~id2~0 != ~id3~0; 419#L227 assume ~id2~0 != ~id4~0; 438#L228 assume ~id2~0 != ~id5~0; 439#L229 assume ~id3~0 != ~id4~0; 410#L230 assume ~id3~0 != ~id5~0; 411#L231 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 424#L201-1 init_#res#1 := init_~tmp~0#1; 453#L326 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; 455#L22 assume !(0 == assume_abort_if_not_~cond#1); 456#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; 426#L398-2 [2021-12-19 19:43:49,421 INFO L793 eck$LassoCheckResult]: Loop: 426#L398-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 405#L71 assume !(0 != ~mode1~0 % 256); 407#L90 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 459#L90-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 449#L71-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 474#L102 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 433#L105 assume !(node2_~m2~0#1 != ~nomsg~0); 434#L105-1 ~mode2~0 := 0; 472#L102-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 473#L127 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 481#L130 assume !(node3_~m3~0#1 != ~nomsg~0); 470#L130-1 ~mode3~0 := 0; 479#L127-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 457#L152 assume !(0 != ~mode4~0 % 256); 420#L165 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 421#L165-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 431#L152-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 432#L177 assume !(0 != ~mode5~0 % 256); 480#L190 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 467#L190-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 445#L177-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; 460#L334 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 446#L335 assume ~r1~0 % 256 >= 5; 447#L339 assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; 452#L334-1 check_#res#1 := check_~tmp~1#1; 461#L354 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; 440#L427 assume !(0 == assert_~arg#1 % 256); 425#L422 assume { :end_inline_assert } true; 426#L398-2 [2021-12-19 19:43:49,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:43:49,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 2 times [2021-12-19 19:43:49,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:43:49,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395887884] [2021-12-19 19:43:49,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:43:49,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:43:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:43:49,443 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 19:43:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:43:49,487 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 19:43:49,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:43:49,488 INFO L85 PathProgramCache]: Analyzing trace with hash -376848461, now seen corresponding path program 1 times [2021-12-19 19:43:49,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:43:49,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162337181] [2021-12-19 19:43:49,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:43:49,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:43:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:43:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 19:43:49,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:43:49,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162337181] [2021-12-19 19:43:49,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162337181] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:43:49,508 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:43:49,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 19:43:49,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551234569] [2021-12-19 19:43:49,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:43:49,509 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 19:43:49,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 19:43:49,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 19:43:49,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 19:43:49,510 INFO L87 Difference]: Start difference. First operand 89 states and 117 transitions. cyclomatic complexity: 29 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2021-12-19 19:43:49,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 19:43:49,544 INFO L93 Difference]: Finished difference Result 135 states and 186 transitions. [2021-12-19 19:43:49,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 19:43:49,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 186 transitions. [2021-12-19 19:43:49,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 98 [2021-12-19 19:43:49,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 135 states and 186 transitions. [2021-12-19 19:43:49,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2021-12-19 19:43:49,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2021-12-19 19:43:49,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 186 transitions. [2021-12-19 19:43:49,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 19:43:49,548 INFO L681 BuchiCegarLoop]: Abstraction has 135 states and 186 transitions. [2021-12-19 19:43:49,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 186 transitions. [2021-12-19 19:43:49,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2021-12-19 19:43:49,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 132 states have internal predecessors, (183), 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) [2021-12-19 19:43:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 183 transitions. [2021-12-19 19:43:49,551 INFO L704 BuchiCegarLoop]: Abstraction has 133 states and 183 transitions. [2021-12-19 19:43:49,552 INFO L587 BuchiCegarLoop]: Abstraction has 133 states and 183 transitions. [2021-12-19 19:43:49,552 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-19 19:43:49,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 183 transitions. [2021-12-19 19:43:49,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2021-12-19 19:43:49,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 19:43:49,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 19:43:49,553 INFO L842 BuchiCegarLoop]: 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] [2021-12-19 19:43:49,553 INFO L843 BuchiCegarLoop]: 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, 1, 1] [2021-12-19 19:43:49,553 INFO L791 eck$LassoCheckResult]: Stem: 708#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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; 693#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_~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~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~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; 694#L201 assume 0 == ~r1~0 % 256; 666#L202 assume ~id1~0 >= 0; 667#L203 assume 0 == ~st1~0; 683#L204 assume ~send1~0 == ~id1~0; 644#L205 assume 0 == ~mode1~0 % 256; 645#L206 assume ~id2~0 >= 0; 631#L207 assume 0 == ~st2~0; 632#L208 assume ~send2~0 == ~id2~0; 692#L209 assume 0 == ~mode2~0 % 256; 646#L210 assume ~id3~0 >= 0; 647#L211 assume 0 == ~st3~0; 636#L212 assume ~send3~0 == ~id3~0; 637#L213 assume 0 == ~mode3~0 % 256; 717#L214 assume ~id4~0 >= 0; 718#L215 assume 0 == ~st4~0; 691#L216 assume ~send4~0 == ~id4~0; 671#L217 assume 0 == ~mode4~0 % 256; 672#L218 assume ~id5~0 >= 0; 695#L219 assume 0 == ~st5~0; 722#L220 assume ~send5~0 == ~id5~0; 660#L221 assume 0 == ~mode5~0 % 256; 658#L222 assume ~id1~0 != ~id2~0; 659#L223 assume ~id1~0 != ~id3~0; 652#L224 assume ~id1~0 != ~id4~0; 653#L225 assume ~id1~0 != ~id5~0; 648#L226 assume ~id2~0 != ~id3~0; 649#L227 assume ~id2~0 != ~id4~0; 668#L228 assume ~id2~0 != ~id5~0; 669#L229 assume ~id3~0 != ~id4~0; 640#L230 assume ~id3~0 != ~id5~0; 641#L231 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 654#L201-1 init_#res#1 := init_~tmp~0#1; 682#L326 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; 684#L22 assume !(0 == assume_abort_if_not_~cond#1); 685#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; 657#L398-2 [2021-12-19 19:43:49,553 INFO L793 eck$LassoCheckResult]: Loop: 657#L398-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 633#L71 assume !(0 != ~mode1~0 % 256); 635#L90 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 688#L90-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 678#L71-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 703#L102 assume !(0 != ~mode2~0 % 256); 704#L115 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 719#L115-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 721#L102-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 745#L127 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 720#L130 assume !(node3_~m3~0#1 != ~nomsg~0); 699#L130-1 ~mode3~0 := 0; 710#L127-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 686#L152 assume !(0 != ~mode4~0 % 256); 650#L165 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 651#L165-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 661#L152-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 662#L177 assume !(0 != ~mode5~0 % 256); 728#L190 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 726#L190-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 725#L177-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; 724#L334 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 723#L335 assume !(~r1~0 % 256 >= 5); 706#L338 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; 707#L339 assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; 760#L334-1 check_#res#1 := check_~tmp~1#1; 716#L354 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; 670#L427 assume !(0 == assert_~arg#1 % 256); 656#L422 assume { :end_inline_assert } true; 657#L398-2 [2021-12-19 19:43:49,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:43:49,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 3 times [2021-12-19 19:43:49,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:43:49,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098190926] [2021-12-19 19:43:49,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:43:49,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:43:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:43:49,570 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 19:43:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:43:49,584 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 19:43:49,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:43:49,585 INFO L85 PathProgramCache]: Analyzing trace with hash 469815887, now seen corresponding path program 1 times [2021-12-19 19:43:49,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:43:49,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577035670] [2021-12-19 19:43:49,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:43:49,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:43:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:43:49,607 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 19:43:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 19:43:49,623 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 19:43:49,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 19:43:49,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1329314019, now seen corresponding path program 1 times [2021-12-19 19:43:49,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 19:43:49,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608532706] [2021-12-19 19:43:49,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 19:43:49,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 19:43:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 19:43:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 19:43:49,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 19:43:49,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608532706] [2021-12-19 19:43:49,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608532706] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 19:43:49,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 19:43:49,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 19:43:49,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882055261] [2021-12-19 19:43:49,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 19:43:50,534 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 19:43:50,535 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 19:43:50,535 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 19:43:50,535 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 19:43:50,535 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 19:43:50,535 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:43:50,535 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 19:43:50,535 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 19:43:50,535 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5.1.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2021-12-19 19:43:50,535 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 19:43:50,535 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 19:43:50,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:43:50,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:43:50,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:43:50,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:43:50,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:43:50,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:43:50,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:43:50,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:43:50,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:43:50,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:43:50,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:43:50,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:43:50,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:43:50,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:43:50,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:43:50,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:43:51,175 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2021-12-19 19:54:20,706 WARN L227 SmtUtils]: Spent 10.43m on a formula simplification. DAG size of input: 4235 DAG size of output: 395 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2021-12-19 19:54:20,889 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 19:54:20,890 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 19:54:20,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:54:20,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:54:20,892 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 19:54:20,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-19 19:54:20,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 19:54:20,900 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:54:20,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-19 19:54:20,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:54:20,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 19:54:20,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 19:54:21,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-19 19:54:21,023 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 19:54:21,024 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 19:54:21,113 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 19:54:21,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-19 19:54:21,119 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 19:54:21,120 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 19:54:21,120 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 19:54:21,120 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 19:54:21,120 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 19:54:21,120 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 19:54:21,120 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 19:54:21,120 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 19:54:21,120 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5.1.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2021-12-19 19:54:21,120 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 19:54:21,120 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 19:54:21,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:54:21,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:54:21,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:54:21,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:54:21,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:54:21,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:54:21,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:54:21,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:54:21,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:54:21,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:54:21,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:54:21,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:54:21,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:54:21,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:54:21,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:54:21,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 19:54:21,701 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12 Killed by 15