./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c 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.7.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d52f31574095462f7bebf0d97516364dd650b64428a7b12e3aa21d1b47f96325 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 04:39:13,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:39:13,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:39:13,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:39:13,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:39:13,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:39:13,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:39:13,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:39:13,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:39:13,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:39:13,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:39:13,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:39:13,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:39:13,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:39:13,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:39:13,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:39:13,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:39:13,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:39:13,908 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:39:13,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:39:13,911 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:39:13,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:39:13,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:39:13,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:39:13,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:39:13,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:39:13,921 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:39:13,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:39:13,922 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:39:13,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:39:13,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:39:13,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:39:13,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:39:13,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:39:13,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:39:13,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:39:13,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:39:13,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:39:13,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:39:13,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:39:13,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:39:13,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:39:13,931 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 04:39:13,954 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:39:13,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:39:13,954 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:39:13,955 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:39:13,956 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:39:13,956 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:39:13,956 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:39:13,956 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:39:13,956 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:39:13,957 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:39:13,957 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:39:13,957 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:39:13,957 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:39:13,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:39:13,958 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:39:13,958 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:39:13,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:39:13,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:39:13,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:39:13,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:39:13,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:39:13,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:39:13,959 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:39:13,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:39:13,959 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:39:13,959 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:39:13,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:39:13,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:39:13,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:39:13,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:39:13,960 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:39:13,960 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:39:13,961 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 -> d52f31574095462f7bebf0d97516364dd650b64428a7b12e3aa21d1b47f96325 [2022-07-13 04:39:14,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:39:14,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:39:14,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:39:14,128 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:39:14,129 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:39:14,129 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.UNBOUNDED.pals.c [2022-07-13 04:39:14,181 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf2ea086d/ec9ff5db06a14969b7032c7d617d63aa/FLAGd3a857b05 [2022-07-13 04:39:14,589 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:39:14,590 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.UNBOUNDED.pals.c [2022-07-13 04:39:14,598 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf2ea086d/ec9ff5db06a14969b7032c7d617d63aa/FLAGd3a857b05 [2022-07-13 04:39:14,972 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf2ea086d/ec9ff5db06a14969b7032c7d617d63aa [2022-07-13 04:39:14,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:39:14,975 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:39:14,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:39:14,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:39:14,978 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:39:14,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:39:14" (1/1) ... [2022-07-13 04:39:14,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@383cbc08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:39:14, skipping insertion in model container [2022-07-13 04:39:14,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:39:14" (1/1) ... [2022-07-13 04:39:14,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:39:15,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:39:15,185 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.7.1.ufo.UNBOUNDED.pals.c[20084,20097] [2022-07-13 04:39:15,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:39:15,199 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:39:15,244 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.7.1.ufo.UNBOUNDED.pals.c[20084,20097] [2022-07-13 04:39:15,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:39:15,268 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:39:15,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:39:15 WrapperNode [2022-07-13 04:39:15,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:39:15,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:39:15,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:39:15,270 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:39:15,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:39:15" (1/1) ... [2022-07-13 04:39:15,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:39:15" (1/1) ... [2022-07-13 04:39:15,302 INFO L137 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 429 [2022-07-13 04:39:15,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:39:15,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:39:15,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:39:15,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:39:15,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:39:15" (1/1) ... [2022-07-13 04:39:15,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:39:15" (1/1) ... [2022-07-13 04:39:15,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:39:15" (1/1) ... [2022-07-13 04:39:15,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:39:15" (1/1) ... [2022-07-13 04:39:15,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:39:15" (1/1) ... [2022-07-13 04:39:15,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:39:15" (1/1) ... [2022-07-13 04:39:15,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:39:15" (1/1) ... [2022-07-13 04:39:15,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:39:15,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:39:15,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:39:15,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:39:15,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:39:15" (1/1) ... [2022-07-13 04:39:15,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:39:15,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:39:15,382 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) [2022-07-13 04:39:15,387 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 [2022-07-13 04:39:15,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 04:39:15,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 04:39:15,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:39:15,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:39:15,516 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:39:15,517 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:39:15,912 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:39:15,918 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:39:15,919 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 04:39:15,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:39:15 BoogieIcfgContainer [2022-07-13 04:39:15,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:39:15,921 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:39:15,921 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:39:15,923 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:39:15,924 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:39:15,924 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:39:14" (1/3) ... [2022-07-13 04:39:15,924 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f8cf4d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:39:15, skipping insertion in model container [2022-07-13 04:39:15,925 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:39:15,925 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:39:15" (2/3) ... [2022-07-13 04:39:15,925 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f8cf4d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:39:15, skipping insertion in model container [2022-07-13 04:39:15,925 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:39:15,925 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:39:15" (3/3) ... [2022-07-13 04:39:15,926 INFO L354 chiAutomizerObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c [2022-07-13 04:39:15,962 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:39:15,963 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:39:15,963 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:39:15,963 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:39:15,963 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:39:15,963 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:39:15,963 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:39:15,964 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:39:15,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 129 states, 128 states have (on average 1.7421875) internal successors, (223), 128 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:39:15,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2022-07-13 04:39:15,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:39:15,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:39:15,996 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:39:15,996 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:39:15,996 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:39:15,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 129 states, 128 states have (on average 1.7421875) internal successors, (223), 128 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:39:16,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2022-07-13 04:39:16,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:39:16,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:39:16,002 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:39:16,002 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:39:16,007 INFO L752 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 42#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 70#L265true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 111#L265-1true init_#res#1 := init_~tmp~0#1; 122#L466true main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; 43#L22true assume !(0 == assume_abort_if_not_~cond#1); 93#L21true assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 18#L550-2true [2022-07-13 04:39:16,007 INFO L754 eck$LassoCheckResult]: Loop: 18#L550-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; 40#L85true assume !(0 != ~mode1~0 % 256); 19#L104true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 127#L104-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; 7#L85-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; 31#L116true assume !(0 != ~mode2~0 % 256); 106#L129true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 15#L129-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; 107#L116-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; 45#L141true assume !(0 != ~mode3~0 % 256); 88#L154true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 129#L154-2true ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 110#L141-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; 89#L166true assume !(0 != ~mode4~0 % 256); 116#L179true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 21#L179-2true ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 84#L166-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; 79#L191true assume !(0 != ~mode5~0 % 256); 101#L204true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 94#L204-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; 72#L191-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 98#L216true assume !(0 != ~mode6~0 % 256); 124#L229true assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 108#L229-2true ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 25#L216-2true assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 32#L241true assume !(0 != ~mode7~0 % 256); 51#L254true assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 30#L254-2true ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 56#L241-2true assume { :end_inline_node7 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 53#L474true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; 16#L474-1true check_#res#1 := check_~tmp~1#1; 77#L494true main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 75#L585true assume !(0 == assert_~arg#1 % 256); 3#L580true assume { :end_inline_assert } true; 18#L550-2true [2022-07-13 04:39:16,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:39:16,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2087378158, now seen corresponding path program 1 times [2022-07-13 04:39:16,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:39:16,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708831596] [2022-07-13 04:39:16,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:39:16,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:39:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:39:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:39:16,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:39:16,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708831596] [2022-07-13 04:39:16,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708831596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:39:16,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:39:16,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:39:16,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833254454] [2022-07-13 04:39:16,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:39:16,205 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:39:16,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:39:16,207 INFO L85 PathProgramCache]: Analyzing trace with hash 2009903109, now seen corresponding path program 1 times [2022-07-13 04:39:16,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:39:16,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128378649] [2022-07-13 04:39:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:39:16,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:39:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:39:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:39:16,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:39:16,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128378649] [2022-07-13 04:39:16,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128378649] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:39:16,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:39:16,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:39:16,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163511023] [2022-07-13 04:39:16,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:39:16,378 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:39:16,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:39:16,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 04:39:16,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 04:39:16,400 INFO L87 Difference]: Start difference. First operand has 129 states, 128 states have (on average 1.7421875) internal successors, (223), 128 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:39:16,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:39:16,469 INFO L93 Difference]: Finished difference Result 128 states and 218 transitions. [2022-07-13 04:39:16,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:39:16,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 218 transitions. [2022-07-13 04:39:16,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-07-13 04:39:16,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 124 states and 165 transitions. [2022-07-13 04:39:16,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-13 04:39:16,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-13 04:39:16,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 165 transitions. [2022-07-13 04:39:16,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:39:16,481 INFO L369 hiAutomatonCegarLoop]: Abstraction has 124 states and 165 transitions. [2022-07-13 04:39:16,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 165 transitions. [2022-07-13 04:39:16,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-13 04:39:16,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.3306451612903225) internal successors, (165), 123 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:39:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 165 transitions. [2022-07-13 04:39:16,503 INFO L392 hiAutomatonCegarLoop]: Abstraction has 124 states and 165 transitions. [2022-07-13 04:39:16,503 INFO L374 stractBuchiCegarLoop]: Abstraction has 124 states and 165 transitions. [2022-07-13 04:39:16,503 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:39:16,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 165 transitions. [2022-07-13 04:39:16,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-07-13 04:39:16,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:39:16,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:39:16,506 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:39:16,506 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:39:16,507 INFO L752 eck$LassoCheckResult]: Stem: 397#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 338#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 339#L265 assume 0 == ~r1~0 % 256; 299#L266 assume ~id1~0 >= 0; 300#L267 assume 0 == ~st1~0; 309#L268 assume ~send1~0 == ~id1~0; 310#L269 assume 0 == ~mode1~0 % 256; 295#L270 assume ~id2~0 >= 0; 296#L271 assume 0 == ~st2~0; 330#L272 assume ~send2~0 == ~id2~0; 342#L273 assume 0 == ~mode2~0 % 256; 356#L274 assume ~id3~0 >= 0; 382#L275 assume 0 == ~st3~0; 279#L276 assume ~send3~0 == ~id3~0; 280#L277 assume 0 == ~mode3~0 % 256; 398#L278 assume ~id4~0 >= 0; 349#L279 assume 0 == ~st4~0; 350#L280 assume ~send4~0 == ~id4~0; 305#L281 assume 0 == ~mode4~0 % 256; 281#L282 assume ~id5~0 >= 0; 282#L283 assume 0 == ~st5~0; 357#L284 assume ~send5~0 == ~id5~0; 358#L285 assume 0 == ~mode5~0 % 256; 381#L286 assume ~id6~0 >= 0; 364#L287 assume 0 == ~st6~0; 320#L288 assume ~send6~0 == ~id6~0; 321#L289 assume 0 == ~mode6~0 % 256; 332#L290 assume ~id7~0 >= 0; 374#L291 assume 0 == ~st7~0; 375#L292 assume ~send7~0 == ~id7~0; 383#L293 assume 0 == ~mode7~0 % 256; 394#L294 assume ~id1~0 != ~id2~0; 285#L295 assume ~id1~0 != ~id3~0; 286#L296 assume ~id1~0 != ~id4~0; 331#L297 assume ~id1~0 != ~id5~0; 328#L298 assume ~id1~0 != ~id6~0; 329#L299 assume ~id1~0 != ~id7~0; 337#L300 assume ~id2~0 != ~id3~0; 365#L301 assume ~id2~0 != ~id4~0; 379#L302 assume ~id2~0 != ~id5~0; 380#L303 assume ~id2~0 != ~id6~0; 389#L304 assume ~id2~0 != ~id7~0; 359#L305 assume ~id3~0 != ~id4~0; 360#L306 assume ~id3~0 != ~id5~0; 373#L307 assume ~id3~0 != ~id6~0; 297#L308 assume ~id3~0 != ~id7~0; 298#L309 assume ~id4~0 != ~id5~0; 371#L310 assume ~id4~0 != ~id6~0; 346#L311 assume ~id4~0 != ~id7~0; 347#L312 assume ~id5~0 != ~id6~0; 315#L313 assume ~id5~0 != ~id7~0; 316#L314 assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; 392#L265-1 init_#res#1 := init_~tmp~0#1; 396#L466 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; 340#L22 assume !(0 == assume_abort_if_not_~cond#1); 341#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 276#L550-2 [2022-07-13 04:39:16,507 INFO L754 eck$LassoCheckResult]: Loop: 276#L550-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; 306#L85 assume !(0 != ~mode1~0 % 256); 307#L104 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 308#L104-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; 283#L85-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; 284#L116 assume !(0 != ~mode2~0 % 256); 325#L129 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 301#L129-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; 302#L116-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; 343#L141 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 289#L144 assume !(node3_~m3~0#1 != ~nomsg~0); 291#L144-1 ~mode3~0 := 0; 336#L141-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; 385#L166 assume !(0 != ~mode4~0 % 256); 386#L179 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 311#L179-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; 312#L166-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; 376#L191 assume !(0 != ~mode5~0 % 256); 377#L204 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 388#L204-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; 288#L191-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 370#L216 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 390#L219 assume !(node6_~m6~0#1 != ~nomsg~0); 362#L219-1 ~mode6~0 := 0; 317#L216-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 318#L241 assume !(0 != ~mode7~0 % 256); 324#L254 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 323#L254-2 ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 319#L241-2 assume { :end_inline_node7 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 351#L474 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; 303#L474-1 check_#res#1 := check_~tmp~1#1; 304#L494 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 372#L585 assume !(0 == assert_~arg#1 % 256); 275#L580 assume { :end_inline_assert } true; 276#L550-2 [2022-07-13 04:39:16,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:39:16,508 INFO L85 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 1 times [2022-07-13 04:39:16,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:39:16,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353058582] [2022-07-13 04:39:16,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:39:16,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:39:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:39:16,531 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:39:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:39:16,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:39:16,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:39:16,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1877274599, now seen corresponding path program 1 times [2022-07-13 04:39:16,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:39:16,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281699589] [2022-07-13 04:39:16,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:39:16,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:39:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:39:16,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:39:16,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:39:16,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281699589] [2022-07-13 04:39:16,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281699589] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:39:16,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:39:16,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:39:16,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648808715] [2022-07-13 04:39:16,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:39:16,674 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:39:16,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:39:16,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 04:39:16,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 04:39:16,675 INFO L87 Difference]: Start difference. First operand 124 states and 165 transitions. cyclomatic complexity: 42 Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:39:16,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:39:16,706 INFO L93 Difference]: Finished difference Result 127 states and 167 transitions. [2022-07-13 04:39:16,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:39:16,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 167 transitions. [2022-07-13 04:39:16,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-07-13 04:39:16,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 124 states and 162 transitions. [2022-07-13 04:39:16,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-13 04:39:16,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-13 04:39:16,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 162 transitions. [2022-07-13 04:39:16,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:39:16,717 INFO L369 hiAutomatonCegarLoop]: Abstraction has 124 states and 162 transitions. [2022-07-13 04:39:16,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 162 transitions. [2022-07-13 04:39:16,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-13 04:39:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 123 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:39:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 162 transitions. [2022-07-13 04:39:16,723 INFO L392 hiAutomatonCegarLoop]: Abstraction has 124 states and 162 transitions. [2022-07-13 04:39:16,723 INFO L374 stractBuchiCegarLoop]: Abstraction has 124 states and 162 transitions. [2022-07-13 04:39:16,723 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:39:16,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 162 transitions. [2022-07-13 04:39:16,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-07-13 04:39:16,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:39:16,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:39:16,726 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:39:16,726 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:39:16,727 INFO L752 eck$LassoCheckResult]: Stem: 660#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 601#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 602#L265 assume 0 == ~r1~0 % 256; 562#L266 assume ~id1~0 >= 0; 563#L267 assume 0 == ~st1~0; 572#L268 assume ~send1~0 == ~id1~0; 573#L269 assume 0 == ~mode1~0 % 256; 558#L270 assume ~id2~0 >= 0; 559#L271 assume 0 == ~st2~0; 593#L272 assume ~send2~0 == ~id2~0; 605#L273 assume 0 == ~mode2~0 % 256; 619#L274 assume ~id3~0 >= 0; 645#L275 assume 0 == ~st3~0; 542#L276 assume ~send3~0 == ~id3~0; 543#L277 assume 0 == ~mode3~0 % 256; 661#L278 assume ~id4~0 >= 0; 612#L279 assume 0 == ~st4~0; 613#L280 assume ~send4~0 == ~id4~0; 568#L281 assume 0 == ~mode4~0 % 256; 544#L282 assume ~id5~0 >= 0; 545#L283 assume 0 == ~st5~0; 620#L284 assume ~send5~0 == ~id5~0; 621#L285 assume 0 == ~mode5~0 % 256; 644#L286 assume ~id6~0 >= 0; 627#L287 assume 0 == ~st6~0; 583#L288 assume ~send6~0 == ~id6~0; 584#L289 assume 0 == ~mode6~0 % 256; 595#L290 assume ~id7~0 >= 0; 637#L291 assume 0 == ~st7~0; 638#L292 assume ~send7~0 == ~id7~0; 646#L293 assume 0 == ~mode7~0 % 256; 657#L294 assume ~id1~0 != ~id2~0; 548#L295 assume ~id1~0 != ~id3~0; 549#L296 assume ~id1~0 != ~id4~0; 594#L297 assume ~id1~0 != ~id5~0; 591#L298 assume ~id1~0 != ~id6~0; 592#L299 assume ~id1~0 != ~id7~0; 600#L300 assume ~id2~0 != ~id3~0; 628#L301 assume ~id2~0 != ~id4~0; 642#L302 assume ~id2~0 != ~id5~0; 643#L303 assume ~id2~0 != ~id6~0; 652#L304 assume ~id2~0 != ~id7~0; 622#L305 assume ~id3~0 != ~id4~0; 623#L306 assume ~id3~0 != ~id5~0; 636#L307 assume ~id3~0 != ~id6~0; 560#L308 assume ~id3~0 != ~id7~0; 561#L309 assume ~id4~0 != ~id5~0; 634#L310 assume ~id4~0 != ~id6~0; 609#L311 assume ~id4~0 != ~id7~0; 610#L312 assume ~id5~0 != ~id6~0; 578#L313 assume ~id5~0 != ~id7~0; 579#L314 assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; 655#L265-1 init_#res#1 := init_~tmp~0#1; 659#L466 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; 603#L22 assume !(0 == assume_abort_if_not_~cond#1); 604#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 539#L550-2 [2022-07-13 04:39:16,727 INFO L754 eck$LassoCheckResult]: Loop: 539#L550-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; 569#L85 assume !(0 != ~mode1~0 % 256); 570#L104 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 571#L104-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; 546#L85-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; 547#L116 assume !(0 != ~mode2~0 % 256); 588#L129 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 564#L129-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; 565#L116-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; 606#L141 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 552#L144 assume !(node3_~m3~0#1 != ~nomsg~0); 554#L144-1 ~mode3~0 := 0; 599#L141-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; 648#L166 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 617#L169 assume !(node4_~m4~0#1 != ~nomsg~0); 611#L169-1 ~mode4~0 := 0; 575#L166-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; 639#L191 assume !(0 != ~mode5~0 % 256); 640#L204 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 651#L204-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; 551#L191-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 633#L216 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 653#L219 assume !(node6_~m6~0#1 != ~nomsg~0); 625#L219-1 ~mode6~0 := 0; 580#L216-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 581#L241 assume !(0 != ~mode7~0 % 256); 587#L254 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 586#L254-2 ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 582#L241-2 assume { :end_inline_node7 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 614#L474 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; 615#L475 assume ~r1~0 % 256 >= 7; 629#L479 assume ~r1~0 % 256 < 7;check_~tmp~1#1 := 1; 566#L474-1 check_#res#1 := check_~tmp~1#1; 567#L494 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 635#L585 assume !(0 == assert_~arg#1 % 256); 538#L580 assume { :end_inline_assert } true; 539#L550-2 [2022-07-13 04:39:16,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:39:16,728 INFO L85 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 2 times [2022-07-13 04:39:16,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:39:16,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712986261] [2022-07-13 04:39:16,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:39:16,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:39:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:39:16,756 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:39:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:39:16,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:39:16,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:39:16,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1236589901, now seen corresponding path program 1 times [2022-07-13 04:39:16,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:39:16,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099034821] [2022-07-13 04:39:16,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:39:16,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:39:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:39:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:39:16,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:39:16,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099034821] [2022-07-13 04:39:16,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099034821] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:39:16,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:39:16,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:39:16,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539859818] [2022-07-13 04:39:16,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:39:16,815 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:39:16,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:39:16,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:39:16,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:39:16,816 INFO L87 Difference]: Start difference. First operand 124 states and 162 transitions. cyclomatic complexity: 39 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:39:16,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:39:16,843 INFO L93 Difference]: Finished difference Result 186 states and 257 transitions. [2022-07-13 04:39:16,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:39:16,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 257 transitions. [2022-07-13 04:39:16,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 130 [2022-07-13 04:39:16,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 257 transitions. [2022-07-13 04:39:16,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2022-07-13 04:39:16,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2022-07-13 04:39:16,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 257 transitions. [2022-07-13 04:39:16,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:39:16,854 INFO L369 hiAutomatonCegarLoop]: Abstraction has 186 states and 257 transitions. [2022-07-13 04:39:16,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 257 transitions. [2022-07-13 04:39:16,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2022-07-13 04:39:16,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 183 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:39:16,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 254 transitions. [2022-07-13 04:39:16,862 INFO L392 hiAutomatonCegarLoop]: Abstraction has 184 states and 254 transitions. [2022-07-13 04:39:16,863 INFO L374 stractBuchiCegarLoop]: Abstraction has 184 states and 254 transitions. [2022-07-13 04:39:16,863 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:39:16,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 254 transitions. [2022-07-13 04:39:16,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 128 [2022-07-13 04:39:16,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:39:16,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:39:16,867 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:39:16,867 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:39:16,868 INFO L752 eck$LassoCheckResult]: Stem: 979#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 917#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 918#L265 assume 0 == ~r1~0 % 256; 878#L266 assume ~id1~0 >= 0; 879#L267 assume 0 == ~st1~0; 888#L268 assume ~send1~0 == ~id1~0; 889#L269 assume 0 == ~mode1~0 % 256; 874#L270 assume ~id2~0 >= 0; 875#L271 assume 0 == ~st2~0; 909#L272 assume ~send2~0 == ~id2~0; 921#L273 assume 0 == ~mode2~0 % 256; 935#L274 assume ~id3~0 >= 0; 960#L275 assume 0 == ~st3~0; 858#L276 assume ~send3~0 == ~id3~0; 859#L277 assume 0 == ~mode3~0 % 256; 981#L278 assume ~id4~0 >= 0; 928#L279 assume 0 == ~st4~0; 929#L280 assume ~send4~0 == ~id4~0; 884#L281 assume 0 == ~mode4~0 % 256; 860#L282 assume ~id5~0 >= 0; 861#L283 assume 0 == ~st5~0; 936#L284 assume ~send5~0 == ~id5~0; 937#L285 assume 0 == ~mode5~0 % 256; 959#L286 assume ~id6~0 >= 0; 943#L287 assume 0 == ~st6~0; 899#L288 assume ~send6~0 == ~id6~0; 900#L289 assume 0 == ~mode6~0 % 256; 911#L290 assume ~id7~0 >= 0; 952#L291 assume 0 == ~st7~0; 953#L292 assume ~send7~0 == ~id7~0; 961#L293 assume 0 == ~mode7~0 % 256; 975#L294 assume ~id1~0 != ~id2~0; 864#L295 assume ~id1~0 != ~id3~0; 865#L296 assume ~id1~0 != ~id4~0; 910#L297 assume ~id1~0 != ~id5~0; 907#L298 assume ~id1~0 != ~id6~0; 908#L299 assume ~id1~0 != ~id7~0; 916#L300 assume ~id2~0 != ~id3~0; 944#L301 assume ~id2~0 != ~id4~0; 957#L302 assume ~id2~0 != ~id5~0; 958#L303 assume ~id2~0 != ~id6~0; 968#L304 assume ~id2~0 != ~id7~0; 938#L305 assume ~id3~0 != ~id4~0; 939#L306 assume ~id3~0 != ~id5~0; 951#L307 assume ~id3~0 != ~id6~0; 876#L308 assume ~id3~0 != ~id7~0; 877#L309 assume ~id4~0 != ~id5~0; 949#L310 assume ~id4~0 != ~id6~0; 925#L311 assume ~id4~0 != ~id7~0; 926#L312 assume ~id5~0 != ~id6~0; 894#L313 assume ~id5~0 != ~id7~0; 895#L314 assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; 973#L265-1 init_#res#1 := init_~tmp~0#1; 978#L466 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; 919#L22 assume !(0 == assume_abort_if_not_~cond#1); 920#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 855#L550-2 [2022-07-13 04:39:16,869 INFO L754 eck$LassoCheckResult]: Loop: 855#L550-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; 885#L85 assume !(0 != ~mode1~0 % 256); 886#L104 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 887#L104-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; 862#L85-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; 863#L116 assume !(0 != ~mode2~0 % 256); 904#L129 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 880#L129-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; 881#L116-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; 977#L141 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1020#L144 assume !(node3_~m3~0#1 != ~nomsg~0); 1017#L144-1 ~mode3~0 := 0; 1015#L141-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; 1014#L166 assume !(0 != ~mode4~0 % 256); 980#L179 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 890#L179-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; 891#L166-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; 954#L191 assume !(0 != ~mode5~0 % 256); 955#L204 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 967#L204-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; 867#L191-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 948#L216 assume !(0 != ~mode6~0 % 256); 997#L229 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 996#L229-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 994#L216-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 993#L241 assume !(0 != ~mode7~0 % 256); 989#L254 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 988#L254-2 ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 986#L241-2 assume { :end_inline_node7 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 985#L474 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; 984#L475 assume !(~r1~0 % 256 >= 7); 982#L478 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0; 983#L479 assume ~r1~0 % 256 < 7;check_~tmp~1#1 := 1; 882#L474-1 check_#res#1 := check_~tmp~1#1; 883#L494 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 950#L585 assume !(0 == assert_~arg#1 % 256); 854#L580 assume { :end_inline_assert } true; 855#L550-2 [2022-07-13 04:39:16,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:39:16,870 INFO L85 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 3 times [2022-07-13 04:39:16,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:39:16,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060144707] [2022-07-13 04:39:16,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:39:16,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:39:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:39:16,895 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:39:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:39:16,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:39:16,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:39:16,944 INFO L85 PathProgramCache]: Analyzing trace with hash -325246003, now seen corresponding path program 1 times [2022-07-13 04:39:16,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:39:16,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778470960] [2022-07-13 04:39:16,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:39:16,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:39:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:39:16,959 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:39:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:39:16,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:39:16,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:39:16,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1977980836, now seen corresponding path program 1 times [2022-07-13 04:39:16,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:39:16,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691951618] [2022-07-13 04:39:16,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:39:16,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:39:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:39:17,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:39:17,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:39:17,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691951618] [2022-07-13 04:39:17,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691951618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:39:17,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:39:17,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:39:17,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799364640] [2022-07-13 04:39:17,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:39:18,431 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:39:18,431 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:39:18,431 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:39:18,431 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:39:18,432 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 04:39:18,432 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:39:18,432 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:39:18,432 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:39:18,432 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.7.1.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-07-13 04:39:18,432 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:39:18,432 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:39:18,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:39:18,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:39:18,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:39:18,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:39:18,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:39:18,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:39:18,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:39:18,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:39:18,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:39:18,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:39:18,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:39:18,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:39:18,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:39:18,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:39:18,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:39:18,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:39:18,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:39:18,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:39:18,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:39:18,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:39:20,044 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2022-07-13 04:39:21,978 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 46656 conjuctions. This might take some time...