./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.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_overflow.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 6994f5bfaf30a704120445031d2592cb0b289806736d22478b28cc84ed2b2216 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 10:11:15,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 10:11:15,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 10:11:15,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 10:11:15,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 10:11:15,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 10:11:15,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 10:11:15,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 10:11:15,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 10:11:15,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 10:11:15,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 10:11:15,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 10:11:15,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 10:11:15,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 10:11:15,829 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 10:11:15,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 10:11:15,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 10:11:15,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 10:11:15,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 10:11:15,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 10:11:15,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 10:11:15,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 10:11:15,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 10:11:15,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 10:11:15,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 10:11:15,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 10:11:15,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 10:11:15,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 10:11:15,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 10:11:15,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 10:11:15,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 10:11:15,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 10:11:15,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 10:11:15,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 10:11:15,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 10:11:15,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 10:11:15,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 10:11:15,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 10:11:15,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 10:11:15,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 10:11:15,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 10:11:15,862 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-16 10:11:15,889 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 10:11:15,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 10:11:15,890 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 10:11:15,890 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 10:11:15,892 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 10:11:15,892 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 10:11:15,892 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 10:11:15,892 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-16 10:11:15,892 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-16 10:11:15,893 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-16 10:11:15,893 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-16 10:11:15,893 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-16 10:11:15,894 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-16 10:11:15,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 10:11:15,894 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 10:11:15,894 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 10:11:15,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 10:11:15,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 10:11:15,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 10:11:15,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-16 10:11:15,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-16 10:11:15,895 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-16 10:11:15,895 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 10:11:15,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 10:11:15,896 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-16 10:11:15,896 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 10:11:15,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-16 10:11:15,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 10:11:15,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 10:11:15,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 10:11:15,897 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 10:11:15,897 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 10:11:15,898 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-16 10:11:15,898 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 -> 6994f5bfaf30a704120445031d2592cb0b289806736d22478b28cc84ed2b2216 [2021-12-16 10:11:16,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 10:11:16,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 10:11:16,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 10:11:16,176 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 10:11:16,176 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 10:11:16,177 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2021-12-16 10:11:16,232 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cef19b2f/13f73dd7c5bf4dd289e592925287b47b/FLAGf0e34e01d [2021-12-16 10:11:16,666 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 10:11:16,672 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2021-12-16 10:11:16,683 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cef19b2f/13f73dd7c5bf4dd289e592925287b47b/FLAGf0e34e01d [2021-12-16 10:11:16,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cef19b2f/13f73dd7c5bf4dd289e592925287b47b [2021-12-16 10:11:16,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 10:11:16,708 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 10:11:16,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 10:11:16,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 10:11:16,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 10:11:16,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:11:16" (1/1) ... [2021-12-16 10:11:16,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610d1834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:16, skipping insertion in model container [2021-12-16 10:11:16,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:11:16" (1/1) ... [2021-12-16 10:11:16,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 10:11:16,752 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 10:11:16,944 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_overflow.ufo.UNBOUNDED.pals.c[11335,11348] [2021-12-16 10:11:16,944 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 10:11:16,954 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 10:11:16,994 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_overflow.ufo.UNBOUNDED.pals.c[11335,11348] [2021-12-16 10:11:16,994 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 10:11:17,013 INFO L208 MainTranslator]: Completed translation [2021-12-16 10:11:17,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:17 WrapperNode [2021-12-16 10:11:17,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 10:11:17,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 10:11:17,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 10:11:17,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 10:11:17,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:17" (1/1) ... [2021-12-16 10:11:17,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:17" (1/1) ... [2021-12-16 10:11:17,049 INFO L137 Inliner]: procedures = 25, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 312 [2021-12-16 10:11:17,049 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 10:11:17,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 10:11:17,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 10:11:17,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 10:11:17,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:17" (1/1) ... [2021-12-16 10:11:17,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:17" (1/1) ... [2021-12-16 10:11:17,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:17" (1/1) ... [2021-12-16 10:11:17,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:17" (1/1) ... [2021-12-16 10:11:17,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:17" (1/1) ... [2021-12-16 10:11:17,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:17" (1/1) ... [2021-12-16 10:11:17,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:17" (1/1) ... [2021-12-16 10:11:17,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 10:11:17,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 10:11:17,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 10:11:17,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 10:11:17,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:17" (1/1) ... [2021-12-16 10:11:17,111 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:11:17,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:11:17,131 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-16 10:11:17,138 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-16 10:11:17,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 10:11:17,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 10:11:17,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 10:11:17,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 10:11:17,268 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 10:11:17,269 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 10:11:17,651 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 10:11:17,658 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 10:11:17,661 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-16 10:11:17,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:11:17 BoogieIcfgContainer [2021-12-16 10:11:17,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 10:11:17,665 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-16 10:11:17,665 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-16 10:11:17,668 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-16 10:11:17,669 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:11:17,670 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.12 10:11:16" (1/3) ... [2021-12-16 10:11:17,674 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3df0383d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 10:11:17, skipping insertion in model container [2021-12-16 10:11:17,674 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:11:17,674 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:17" (2/3) ... [2021-12-16 10:11:17,675 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3df0383d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 10:11:17, skipping insertion in model container [2021-12-16 10:11:17,675 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:11:17,675 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:11:17" (3/3) ... [2021-12-16 10:11:17,676 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2021-12-16 10:11:17,720 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-16 10:11:17,721 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-16 10:11:17,721 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-16 10:11:17,721 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-16 10:11:17,721 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-16 10:11:17,721 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-16 10:11:17,721 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-16 10:11:17,722 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-16 10:11:17,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 92 states, 91 states have (on average 1.7142857142857142) internal successors, (156), 91 states have internal predecessors, (156), 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-16 10:11:17,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2021-12-16 10:11:17,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:11:17,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:11:17,779 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:11:17,779 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-16 10:11:17,779 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-16 10:11:17,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 92 states, 91 states have (on average 1.7142857142857142) internal successors, (156), 91 states have internal predecessors, (156), 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-16 10:11:17,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2021-12-16 10:11:17,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:11:17,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:11:17,786 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:11:17,786 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-16 10:11:17,792 INFO L791 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; 54#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; 8#L198true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 34#L198-1true init_#res#1 := init_~tmp~0#1; 5#L323true 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; 65#L24true assume !(0 == assume_abort_if_not_~cond#1); 21#L23true assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~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; 19#L395-2true [2021-12-16 10:11:17,792 INFO L793 eck$LassoCheckResult]: Loop: 19#L395-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; 43#L73true assume !(0 != ~mode1~0 % 256); 78#L87true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 7#L87-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; 44#L73-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; 57#L99true assume !(0 != ~mode2~0 % 256); 72#L112true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 82#L112-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; 62#L99-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; 22#L124true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 76#L127true assume !(node3_~m3~0#1 != ~nomsg~0); 28#L127-1true ~mode3~0 := 0; 88#L124-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; 35#L149true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 42#L152true assume !(node4_~m4~0#1 != ~nomsg~0); 15#L152-1true ~mode4~0 := 0; 70#L149-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; 86#L174true assume !(0 != ~mode5~0 % 256); 75#L187true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 23#L187-2true ~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; 61#L174-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; 16#L331true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 39#L331-1true check_#res#1 := check_~tmp~1#1; 4#L351true 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; 59#L424true assume !(0 == assert_~arg#1 % 256); 6#L419true assume { :end_inline_assert } true; 19#L395-2true [2021-12-16 10:11:17,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:11:17,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1978587388, now seen corresponding path program 1 times [2021-12-16 10:11:17,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:11:17,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913786198] [2021-12-16 10:11:17,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:11:17,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:11:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:11:18,005 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-16 10:11:18,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:11:18,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913786198] [2021-12-16 10:11:18,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913786198] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:11:18,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:11:18,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 10:11:18,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827221585] [2021-12-16 10:11:18,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:11:18,013 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:11:18,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:11:18,016 INFO L85 PathProgramCache]: Analyzing trace with hash 698064284, now seen corresponding path program 1 times [2021-12-16 10:11:18,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:11:18,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51241524] [2021-12-16 10:11:18,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:11:18,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:11:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:11:18,210 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-16 10:11:18,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:11:18,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51241524] [2021-12-16 10:11:18,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51241524] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:11:18,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:11:18,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 10:11:18,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176184891] [2021-12-16 10:11:18,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:11:18,214 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 10:11:18,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:11:18,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 10:11:18,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 10:11:18,248 INFO L87 Difference]: Start difference. First operand has 92 states, 91 states have (on average 1.7142857142857142) internal successors, (156), 91 states have internal predecessors, (156), 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-16 10:11:18,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:11:18,349 INFO L93 Difference]: Finished difference Result 91 states and 151 transitions. [2021-12-16 10:11:18,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 10:11:18,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 151 transitions. [2021-12-16 10:11:18,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-16 10:11:18,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 87 states and 117 transitions. [2021-12-16 10:11:18,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2021-12-16 10:11:18,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2021-12-16 10:11:18,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 117 transitions. [2021-12-16 10:11:18,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:11:18,371 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2021-12-16 10:11:18,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 117 transitions. [2021-12-16 10:11:18,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-12-16 10:11:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 86 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-16 10:11:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2021-12-16 10:11:18,401 INFO L704 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2021-12-16 10:11:18,401 INFO L587 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2021-12-16 10:11:18,401 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-16 10:11:18,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 117 transitions. [2021-12-16 10:11:18,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-16 10:11:18,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:11:18,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:11:18,410 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-16 10:11:18,410 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-16 10:11:18,410 INFO L791 eck$LassoCheckResult]: Stem: 280#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; 209#L198 assume 0 == ~r1~0 % 256; 210#L199 assume ~id1~0 >= 0; 267#L200 assume 0 == ~st1~0; 268#L201 assume ~send1~0 == ~id1~0; 245#L202 assume 0 == ~mode1~0 % 256; 246#L203 assume ~id2~0 >= 0; 262#L204 assume 0 == ~st2~0; 218#L205 assume ~send2~0 == ~id2~0; 219#L206 assume 0 == ~mode2~0 % 256; 211#L207 assume ~id3~0 >= 0; 212#L208 assume 0 == ~st3~0; 270#L209 assume ~send3~0 == ~id3~0; 223#L210 assume 0 == ~mode3~0 % 256; 224#L211 assume ~id4~0 >= 0; 213#L212 assume 0 == ~st4~0; 214#L213 assume ~send4~0 == ~id4~0; 285#L214 assume 0 == ~mode4~0 % 256; 286#L215 assume ~id5~0 >= 0; 269#L216 assume 0 == ~st5~0; 251#L217 assume ~send5~0 == ~id5~0; 252#L218 assume 0 == ~mode5~0 % 256; 272#L219 assume ~id1~0 != ~id2~0; 287#L220 assume ~id1~0 != ~id3~0; 244#L221 assume ~id1~0 != ~id4~0; 242#L222 assume ~id1~0 != ~id5~0; 243#L223 assume ~id2~0 != ~id3~0; 234#L224 assume ~id2~0 != ~id4~0; 235#L225 assume ~id2~0 != ~id5~0; 229#L226 assume ~id3~0 != ~id4~0; 230#L227 assume ~id3~0 != ~id5~0; 247#L228 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 248#L198-1 init_#res#1 := init_~tmp~0#1; 203#L323 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; 204#L24 assume !(0 == assume_abort_if_not_~cond#1); 236#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~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; 206#L395-2 [2021-12-16 10:11:18,411 INFO L793 eck$LassoCheckResult]: Loop: 206#L395-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; 233#L73 assume !(0 != ~mode1~0 % 256); 264#L87 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 207#L87-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; 208#L73-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; 265#L99 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 273#L102 assume !(node2_~m2~0#1 != ~nomsg~0); 253#L102-1 ~mode2~0 := 0; 254#L99-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; 237#L124 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 238#L127 assume !(node3_~m3~0#1 != ~nomsg~0); 249#L127-1 ~mode3~0 := 0; 250#L124-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; 257#L149 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 258#L152 assume !(node4_~m4~0#1 != ~nomsg~0); 216#L152-1 ~mode4~0 := 0; 225#L149-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; 279#L174 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 282#L177 assume !(node5_~m5~0#1 != ~nomsg~0); 261#L177-1 ~mode5~0 := 0; 241#L174-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; 226#L331 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 227#L331-1 check_#res#1 := check_~tmp~1#1; 201#L351 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; 202#L424 assume !(0 == assert_~arg#1 % 256); 205#L419 assume { :end_inline_assert } true; 206#L395-2 [2021-12-16 10:11:18,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:11:18,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 1 times [2021-12-16 10:11:18,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:11:18,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059798816] [2021-12-16 10:11:18,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:11:18,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:11:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:11:18,456 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:11:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:11:18,519 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:11:18,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:11:18,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1420109744, now seen corresponding path program 1 times [2021-12-16 10:11:18,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:11:18,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766370333] [2021-12-16 10:11:18,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:11:18,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:11:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:11:18,633 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-16 10:11:18,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:11:18,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766370333] [2021-12-16 10:11:18,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766370333] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:11:18,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:11:18,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 10:11:18,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788582836] [2021-12-16 10:11:18,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:11:18,639 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 10:11:18,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:11:18,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 10:11:18,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 10:11:18,641 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. cyclomatic complexity: 31 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-16 10:11:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:11:18,682 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2021-12-16 10:11:18,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 10:11:18,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 119 transitions. [2021-12-16 10:11:18,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-16 10:11:18,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 87 states and 114 transitions. [2021-12-16 10:11:18,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2021-12-16 10:11:18,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2021-12-16 10:11:18,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 114 transitions. [2021-12-16 10:11:18,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:11:18,691 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2021-12-16 10:11:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 114 transitions. [2021-12-16 10:11:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-12-16 10:11:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 86 states have internal predecessors, (114), 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-16 10:11:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2021-12-16 10:11:18,704 INFO L704 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2021-12-16 10:11:18,704 INFO L587 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2021-12-16 10:11:18,704 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-16 10:11:18,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 114 transitions. [2021-12-16 10:11:18,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-16 10:11:18,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:11:18,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:11:18,706 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-16 10:11:18,706 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-16 10:11:18,706 INFO L791 eck$LassoCheckResult]: Stem: 469#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; 460#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; 398#L198 assume 0 == ~r1~0 % 256; 399#L199 assume ~id1~0 >= 0; 456#L200 assume 0 == ~st1~0; 457#L201 assume ~send1~0 == ~id1~0; 434#L202 assume 0 == ~mode1~0 % 256; 435#L203 assume ~id2~0 >= 0; 449#L204 assume 0 == ~st2~0; 404#L205 assume ~send2~0 == ~id2~0; 405#L206 assume 0 == ~mode2~0 % 256; 400#L207 assume ~id3~0 >= 0; 401#L208 assume 0 == ~st3~0; 459#L209 assume ~send3~0 == ~id3~0; 409#L210 assume 0 == ~mode3~0 % 256; 410#L211 assume ~id4~0 >= 0; 402#L212 assume 0 == ~st4~0; 403#L213 assume ~send4~0 == ~id4~0; 474#L214 assume 0 == ~mode4~0 % 256; 475#L215 assume ~id5~0 >= 0; 458#L216 assume 0 == ~st5~0; 440#L217 assume ~send5~0 == ~id5~0; 441#L218 assume 0 == ~mode5~0 % 256; 461#L219 assume ~id1~0 != ~id2~0; 476#L220 assume ~id1~0 != ~id3~0; 433#L221 assume ~id1~0 != ~id4~0; 431#L222 assume ~id1~0 != ~id5~0; 432#L223 assume ~id2~0 != ~id3~0; 423#L224 assume ~id2~0 != ~id4~0; 424#L225 assume ~id2~0 != ~id5~0; 417#L226 assume ~id3~0 != ~id4~0; 418#L227 assume ~id3~0 != ~id5~0; 436#L228 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 437#L198-1 init_#res#1 := init_~tmp~0#1; 394#L323 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; 395#L24 assume !(0 == assume_abort_if_not_~cond#1); 425#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~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; 393#L395-2 [2021-12-16 10:11:18,707 INFO L793 eck$LassoCheckResult]: Loop: 393#L395-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; 422#L73 assume !(0 != ~mode1~0 % 256); 453#L87 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 396#L87-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; 397#L73-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; 454#L99 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 462#L102 assume !(node2_~m2~0#1 != ~nomsg~0); 442#L102-1 ~mode2~0 := 0; 443#L99-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; 426#L124 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 427#L127 assume !(node3_~m3~0#1 != ~nomsg~0); 438#L127-1 ~mode3~0 := 0; 439#L124-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; 446#L149 assume !(0 != ~mode4~0 % 256); 448#L162 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 455#L162-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; 414#L149-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; 468#L174 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 471#L177 assume !(node5_~m5~0#1 != ~nomsg~0); 451#L177-1 ~mode5~0 := 0; 430#L174-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; 415#L331 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 416#L332 assume ~r1~0 % 256 >= 5; 419#L336 assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; 420#L331-1 check_#res#1 := check_~tmp~1#1; 390#L351 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; 391#L424 assume !(0 == assert_~arg#1 % 256); 392#L419 assume { :end_inline_assert } true; 393#L395-2 [2021-12-16 10:11:18,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:11:18,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 2 times [2021-12-16 10:11:18,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:11:18,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468736620] [2021-12-16 10:11:18,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:11:18,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:11:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:11:18,724 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:11:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:11:18,744 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:11:18,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:11:18,745 INFO L85 PathProgramCache]: Analyzing trace with hash 6707478, now seen corresponding path program 1 times [2021-12-16 10:11:18,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:11:18,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613699179] [2021-12-16 10:11:18,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:11:18,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:11:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:11:18,767 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-16 10:11:18,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:11:18,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613699179] [2021-12-16 10:11:18,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613699179] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:11:18,768 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:11:18,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:11:18,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204823073] [2021-12-16 10:11:18,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:11:18,769 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 10:11:18,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:11:18,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 10:11:18,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 10:11:18,770 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. cyclomatic complexity: 28 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-16 10:11:18,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:11:18,787 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2021-12-16 10:11:18,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 10:11:18,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 180 transitions. [2021-12-16 10:11:18,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-16 10:11:18,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 131 states and 180 transitions. [2021-12-16 10:11:18,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2021-12-16 10:11:18,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2021-12-16 10:11:18,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 180 transitions. [2021-12-16 10:11:18,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:11:18,796 INFO L681 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2021-12-16 10:11:18,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 180 transitions. [2021-12-16 10:11:18,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-12-16 10:11:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 130 states have internal predecessors, (180), 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-16 10:11:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 180 transitions. [2021-12-16 10:11:18,802 INFO L704 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2021-12-16 10:11:18,802 INFO L587 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2021-12-16 10:11:18,802 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-16 10:11:18,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 180 transitions. [2021-12-16 10:11:18,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-16 10:11:18,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:11:18,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:11:18,805 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-16 10:11:18,805 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-16 10:11:18,805 INFO L791 eck$LassoCheckResult]: Stem: 699#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; 687#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; 622#L198 assume 0 == ~r1~0 % 256; 623#L199 assume ~id1~0 >= 0; 683#L200 assume 0 == ~st1~0; 684#L201 assume ~send1~0 == ~id1~0; 658#L202 assume 0 == ~mode1~0 % 256; 659#L203 assume ~id2~0 >= 0; 678#L204 assume 0 == ~st2~0; 631#L205 assume ~send2~0 == ~id2~0; 632#L206 assume 0 == ~mode2~0 % 256; 624#L207 assume ~id3~0 >= 0; 625#L208 assume 0 == ~st3~0; 686#L209 assume ~send3~0 == ~id3~0; 636#L210 assume 0 == ~mode3~0 % 256; 637#L211 assume ~id4~0 >= 0; 626#L212 assume 0 == ~st4~0; 627#L213 assume ~send4~0 == ~id4~0; 705#L214 assume 0 == ~mode4~0 % 256; 706#L215 assume ~id5~0 >= 0; 685#L216 assume 0 == ~st5~0; 667#L217 assume ~send5~0 == ~id5~0; 668#L218 assume 0 == ~mode5~0 % 256; 688#L219 assume ~id1~0 != ~id2~0; 707#L220 assume ~id1~0 != ~id3~0; 657#L221 assume ~id1~0 != ~id4~0; 655#L222 assume ~id1~0 != ~id5~0; 656#L223 assume ~id2~0 != ~id3~0; 646#L224 assume ~id2~0 != ~id4~0; 647#L225 assume ~id2~0 != ~id5~0; 641#L226 assume ~id3~0 != ~id4~0; 642#L227 assume ~id3~0 != ~id5~0; 660#L228 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 661#L198-1 init_#res#1 := init_~tmp~0#1; 616#L323 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; 617#L24 assume !(0 == assume_abort_if_not_~cond#1); 648#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~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; 649#L395-2 [2021-12-16 10:11:18,805 INFO L793 eck$LassoCheckResult]: Loop: 649#L395-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; 738#L73 assume !(0 != ~mode1~0 % 256); 737#L87 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 736#L87-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; 664#L73-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; 735#L99 assume !(0 != ~mode2~0 % 256); 731#L112 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 730#L112-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; 728#L99-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; 650#L124 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 651#L127 assume !(node3_~m3~0#1 != ~nomsg~0); 662#L127-1 ~mode3~0 := 0; 663#L124-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; 672#L149 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 673#L152 assume !(node4_~m4~0#1 != ~nomsg~0); 629#L152-1 ~mode4~0 := 0; 638#L149-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; 717#L174 assume !(0 != ~mode5~0 % 256); 713#L187 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 711#L187-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; 710#L174-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; 709#L331 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 708#L332 assume !(~r1~0 % 256 >= 5); 670#L335 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; 671#L336 assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; 742#L331-1 check_#res#1 := check_~tmp~1#1; 741#L351 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; 740#L424 assume !(0 == assert_~arg#1 % 256); 739#L419 assume { :end_inline_assert } true; 649#L395-2 [2021-12-16 10:11:18,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:11:18,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 3 times [2021-12-16 10:11:18,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:11:18,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673048747] [2021-12-16 10:11:18,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:11:18,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:11:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:11:18,817 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:11:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:11:18,833 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:11:18,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:11:18,834 INFO L85 PathProgramCache]: Analyzing trace with hash 507304517, now seen corresponding path program 1 times [2021-12-16 10:11:18,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:11:18,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619584873] [2021-12-16 10:11:18,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:11:18,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:11:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:11:18,843 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:11:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:11:18,862 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:11:18,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:11:18,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1291825389, now seen corresponding path program 1 times [2021-12-16 10:11:18,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:11:18,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772394579] [2021-12-16 10:11:18,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:11:18,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:11:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:11:18,901 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-16 10:11:18,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:11:18,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772394579] [2021-12-16 10:11:18,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772394579] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:11:18,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:11:18,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:11:18,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013686109] [2021-12-16 10:11:18,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:11:19,960 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 10:11:19,961 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 10:11:19,961 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 10:11:19,961 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 10:11:19,961 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 10:11:19,962 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:11:19,962 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 10:11:19,962 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 10:11:19,962 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2021-12-16 10:11:19,962 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 10:11:19,962 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 10:11:19,981 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-16 10:11:19,993 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-16 10:11:19,995 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-16 10:11:20,000 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-16 10:11:20,002 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-16 10:11:20,005 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-16 10:11:20,015 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-16 10:11:20,018 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-16 10:11:20,028 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-16 10:11:20,031 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-16 10:11:20,033 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-16 10:11:20,037 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-16 10:11:20,039 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-16 10:11:20,043 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-16 10:11:20,239 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-16 10:11:20,245 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-16 10:11:20,634 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2021-12-16 10:11:52,529 WARN L227 SmtUtils]: Spent 31.64s on a formula simplification. DAG size of input: 634 DAG size of output: 186 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2021-12-16 10:11:52,609 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 10:11:52,610 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 10:11:52,612 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:11:52,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:11:52,615 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-16 10:11:52,621 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-16 10:11:52,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 10:11:52,624 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:11:52,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-16 10:11:52,674 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:11:52,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:11:52,675 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-16 10:11:52,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 10:11:52,690 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:11:52,709 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-16 10:11:52,801 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 10:11:52,805 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-16 10:11:52,806 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 10:11:52,806 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 10:11:52,806 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 10:11:52,806 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 10:11:52,806 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 10:11:52,806 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:11:52,806 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 10:11:52,806 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 10:11:52,806 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2021-12-16 10:11:52,806 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 10:11:52,806 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 10:11:52,810 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-16 10:11:52,819 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-16 10:11:52,823 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-16 10:11:52,825 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-16 10:11:52,831 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-16 10:11:53,015 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-16 10:11:53,020 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-16 10:11:53,021 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-16 10:11:53,026 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-16 10:11:53,027 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-16 10:11:53,029 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-16 10:11:53,033 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-16 10:11:53,035 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-16 10:11:53,037 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-16 10:11:53,041 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-16 10:11:53,043 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-16 10:11:53,402 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9