./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 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.8.1.ufo.BOUNDED-16.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 584cb00847e346bcb7b5af30068947c52ce3c4d690063caf12c5ab86dbf7ec89 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 02:59:41,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 02:59:41,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 02:59:41,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 02:59:41,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 02:59:41,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 02:59:41,805 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 02:59:41,807 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 02:59:41,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 02:59:41,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 02:59:41,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 02:59:41,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 02:59:41,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 02:59:41,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 02:59:41,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 02:59:41,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 02:59:41,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 02:59:41,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 02:59:41,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 02:59:41,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 02:59:41,828 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 02:59:41,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 02:59:41,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 02:59:41,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 02:59:41,833 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 02:59:41,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 02:59:41,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 02:59:41,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 02:59:41,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 02:59:41,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 02:59:41,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 02:59:41,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 02:59:41,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 02:59:41,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 02:59:41,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 02:59:41,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 02:59:41,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 02:59:41,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 02:59:41,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 02:59:41,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 02:59:41,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 02:59:41,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 02:59:41,853 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 02:59:41,878 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 02:59:41,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 02:59:41,879 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 02:59:41,879 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 02:59:41,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 02:59:41,881 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 02:59:41,881 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 02:59:41,881 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 02:59:41,881 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 02:59:41,882 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 02:59:41,882 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 02:59:41,882 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 02:59:41,883 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 02:59:41,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 02:59:41,883 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 02:59:41,883 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 02:59:41,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 02:59:41,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 02:59:41,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 02:59:41,884 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 02:59:41,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 02:59:41,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 02:59:41,884 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 02:59:41,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 02:59:41,885 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 02:59:41,885 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 02:59:41,885 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 02:59:41,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 02:59:41,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 02:59:41,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 02:59:41,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 02:59:41,888 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 02:59:41,888 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 -> 584cb00847e346bcb7b5af30068947c52ce3c4d690063caf12c5ab86dbf7ec89 [2022-07-22 02:59:42,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 02:59:42,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 02:59:42,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 02:59:42,231 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 02:59:42,236 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 02:59:42,237 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2022-07-22 02:59:42,289 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccfa1e6b0/fe1c253ab52f41ba96f44671dc3d0768/FLAG7e81d3dfe [2022-07-22 02:59:42,667 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 02:59:42,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2022-07-22 02:59:42,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccfa1e6b0/fe1c253ab52f41ba96f44671dc3d0768/FLAG7e81d3dfe [2022-07-22 02:59:43,033 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccfa1e6b0/fe1c253ab52f41ba96f44671dc3d0768 [2022-07-22 02:59:43,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 02:59:43,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 02:59:43,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 02:59:43,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 02:59:43,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 02:59:43,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:59:43" (1/1) ... [2022-07-22 02:59:43,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@344cf2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:43, skipping insertion in model container [2022-07-22 02:59:43,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:59:43" (1/1) ... [2022-07-22 02:59:43,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 02:59:43,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 02:59:43,330 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.8.1.ufo.BOUNDED-16.pals.c[26490,26503] [2022-07-22 02:59:43,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:59:43,349 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 02:59:43,401 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.8.1.ufo.BOUNDED-16.pals.c[26490,26503] [2022-07-22 02:59:43,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:59:43,418 INFO L208 MainTranslator]: Completed translation [2022-07-22 02:59:43,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:43 WrapperNode [2022-07-22 02:59:43,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 02:59:43,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 02:59:43,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 02:59:43,420 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 02:59:43,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:43" (1/1) ... [2022-07-22 02:59:43,444 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:43" (1/1) ... [2022-07-22 02:59:43,479 INFO L137 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 498 [2022-07-22 02:59:43,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 02:59:43,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 02:59:43,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 02:59:43,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 02:59:43,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:43" (1/1) ... [2022-07-22 02:59:43,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:43" (1/1) ... [2022-07-22 02:59:43,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:43" (1/1) ... [2022-07-22 02:59:43,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:43" (1/1) ... [2022-07-22 02:59:43,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:43" (1/1) ... [2022-07-22 02:59:43,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:43" (1/1) ... [2022-07-22 02:59:43,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:43" (1/1) ... [2022-07-22 02:59:43,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 02:59:43,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 02:59:43,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 02:59:43,547 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 02:59:43,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:43" (1/1) ... [2022-07-22 02:59:43,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:59:43,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:59:43,570 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-22 02:59:43,575 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-22 02:59:43,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 02:59:43,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 02:59:43,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 02:59:43,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 02:59:43,710 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 02:59:43,728 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 02:59:44,230 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 02:59:44,236 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 02:59:44,238 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 02:59:44,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:59:44 BoogieIcfgContainer [2022-07-22 02:59:44,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 02:59:44,240 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 02:59:44,241 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 02:59:44,242 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 02:59:44,243 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:59:44,243 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 02:59:43" (1/3) ... [2022-07-22 02:59:44,244 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54228483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:59:44, skipping insertion in model container [2022-07-22 02:59:44,244 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:59:44,244 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:43" (2/3) ... [2022-07-22 02:59:44,244 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54228483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:59:44, skipping insertion in model container [2022-07-22 02:59:44,244 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:59:44,244 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:59:44" (3/3) ... [2022-07-22 02:59:44,245 INFO L354 chiAutomizerObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2022-07-22 02:59:44,288 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 02:59:44,288 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 02:59:44,288 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 02:59:44,288 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 02:59:44,288 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 02:59:44,288 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 02:59:44,289 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 02:59:44,289 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 02:59:44,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 146 states, 145 states have (on average 1.7586206896551724) internal successors, (255), 145 states have internal predecessors, (255), 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-22 02:59:44,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2022-07-22 02:59:44,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:59:44,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:59:44,317 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:59:44,317 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, 1] [2022-07-22 02:59:44,317 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 02:59:44,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 146 states, 145 states have (on average 1.7586206896551724) internal successors, (255), 145 states have internal predecessors, (255), 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-22 02:59:44,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2022-07-22 02:59:44,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:59:44,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:59:44,330 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:59:44,330 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, 1] [2022-07-22 02:59:44,335 INFO L752 eck$LassoCheckResult]: Stem: 133#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(35, 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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 45#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_#t~post47#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~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 35#L297true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 34#L297-1true init_#res#1 := init_~tmp~0#1; 7#L542true main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#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; 46#L22true assume !(0 == assume_abort_if_not_~cond#1); 112#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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 132#L632-2true [2022-07-22 02:59:44,336 INFO L754 eck$LassoCheckResult]: Loop: 132#L632-2true assume !!(main_~i2~0#1 < 16);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; 125#L92true assume !(0 != ~mode1~0 % 256); 17#L108true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 107#L108-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; 70#L92-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; 50#L120true assume !(0 != ~mode2~0 % 256); 124#L133true assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; 21#L133-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; 29#L120-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; 65#L145true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 27#L148true assume !(node3_~m3~0#1 != ~nomsg~0); 121#L148-1true ~mode3~0 := 0; 59#L145-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; 79#L170true assume !(0 != ~mode4~0 % 256); 26#L183true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 42#L183-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; 53#L170-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; 119#L195true assume !(0 != ~mode5~0 % 256); 120#L208true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 122#L208-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; 86#L195-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; 72#L220true assume !(0 != ~mode6~0 % 256); 73#L233true assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 67#L233-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; 54#L220-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; 25#L245true assume !(0 != ~mode7~0 % 256); 33#L258true assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 85#L258-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; 88#L245-2true assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 8#L270true assume !(0 != ~mode8~0 % 256); 111#L283true assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 13#L283-2true ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 74#L270-2true assume { :end_inline_node8 } 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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 145#L550true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; 51#L550-1true check_#res#1 := check_~tmp~1#1; 44#L570true main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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; 131#L671true assume !(0 == assert_~arg#1 % 256); 12#L666true assume { :end_inline_assert } true;main_#t~post47#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post47#1;havoc main_#t~post47#1; 132#L632-2true [2022-07-22 02:59:44,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:59:44,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2144605008, now seen corresponding path program 1 times [2022-07-22 02:59:44,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:59:44,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226018993] [2022-07-22 02:59:44,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:59:44,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:59:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:59:44,549 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-22 02:59:44,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:59:44,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226018993] [2022-07-22 02:59:44,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226018993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:59:44,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:59:44,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:59:44,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553818884] [2022-07-22 02:59:44,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:59:44,558 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:59:44,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:59:44,560 INFO L85 PathProgramCache]: Analyzing trace with hash -305615167, now seen corresponding path program 1 times [2022-07-22 02:59:44,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:59:44,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231752906] [2022-07-22 02:59:44,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:59:44,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:59:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:59:44,722 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-22 02:59:44,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:59:44,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231752906] [2022-07-22 02:59:44,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231752906] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:59:44,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:59:44,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:59:44,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287126639] [2022-07-22 02:59:44,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:59:44,724 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:59:44,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:59:44,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 02:59:44,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 02:59:44,749 INFO L87 Difference]: Start difference. First operand has 146 states, 145 states have (on average 1.7586206896551724) internal successors, (255), 145 states have internal predecessors, (255), 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-22 02:59:44,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:59:44,854 INFO L93 Difference]: Finished difference Result 149 states and 254 transitions. [2022-07-22 02:59:44,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 02:59:44,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 254 transitions. [2022-07-22 02:59:44,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2022-07-22 02:59:44,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 141 states and 186 transitions. [2022-07-22 02:59:44,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2022-07-22 02:59:44,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2022-07-22 02:59:44,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 186 transitions. [2022-07-22 02:59:44,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:59:44,875 INFO L369 hiAutomatonCegarLoop]: Abstraction has 141 states and 186 transitions. [2022-07-22 02:59:44,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 186 transitions. [2022-07-22 02:59:44,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-07-22 02:59:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 141 states have (on average 1.3191489361702127) internal successors, (186), 140 states have internal predecessors, (186), 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-22 02:59:44,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 186 transitions. [2022-07-22 02:59:44,904 INFO L392 hiAutomatonCegarLoop]: Abstraction has 141 states and 186 transitions. [2022-07-22 02:59:44,904 INFO L374 stractBuchiCegarLoop]: Abstraction has 141 states and 186 transitions. [2022-07-22 02:59:44,904 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 02:59:44,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 186 transitions. [2022-07-22 02:59:44,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2022-07-22 02:59:44,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:59:44,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:59:44,907 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:59:44,908 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, 1] [2022-07-22 02:59:44,908 INFO L752 eck$LassoCheckResult]: Stem: 452#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(35, 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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 385#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_#t~post47#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~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 373#L297 assume 0 == ~r1~0; 362#L298 assume ~id1~0 >= 0; 363#L299 assume 0 == ~st1~0; 382#L300 assume ~send1~0 == ~id1~0; 425#L301 assume 0 == ~mode1~0 % 256; 438#L302 assume ~id2~0 >= 0; 439#L303 assume 0 == ~st2~0; 445#L304 assume ~send2~0 == ~id2~0; 415#L305 assume 0 == ~mode2~0 % 256; 416#L306 assume ~id3~0 >= 0; 434#L307 assume 0 == ~st3~0; 329#L308 assume ~send3~0 == ~id3~0; 330#L309 assume 0 == ~mode3~0 % 256; 429#L310 assume ~id4~0 >= 0; 396#L311 assume 0 == ~st4~0; 397#L312 assume ~send4~0 == ~id4~0; 348#L313 assume 0 == ~mode4~0 % 256; 349#L314 assume ~id5~0 >= 0; 389#L315 assume 0 == ~st5~0; 390#L316 assume ~send5~0 == ~id5~0; 317#L317 assume 0 == ~mode5~0 % 256; 318#L318 assume ~id6~0 >= 0; 453#L319 assume 0 == ~st6~0; 437#L320 assume ~send6~0 == ~id6~0; 422#L321 assume 0 == ~mode6~0 % 256; 423#L322 assume ~id7~0 >= 0; 313#L323 assume 0 == ~st7~0; 314#L324 assume ~send7~0 == ~id7~0; 338#L325 assume 0 == ~mode7~0 % 256; 356#L326 assume ~id8~0 >= 0; 339#L327 assume 0 == ~st8~0; 340#L328 assume ~send8~0 == ~id8~0; 375#L329 assume 0 == ~mode8~0 % 256; 376#L330 assume ~id1~0 != ~id2~0; 327#L331 assume ~id1~0 != ~id3~0; 328#L332 assume ~id1~0 != ~id4~0; 352#L333 assume ~id1~0 != ~id5~0; 374#L334 assume ~id1~0 != ~id6~0; 346#L335 assume ~id1~0 != ~id7~0; 347#L336 assume ~id1~0 != ~id8~0; 433#L337 assume ~id2~0 != ~id3~0; 401#L338 assume ~id2~0 != ~id4~0; 402#L339 assume ~id2~0 != ~id5~0; 446#L340 assume ~id2~0 != ~id6~0; 443#L341 assume ~id2~0 != ~id7~0; 377#L342 assume ~id2~0 != ~id8~0; 378#L343 assume ~id3~0 != ~id4~0; 364#L344 assume ~id3~0 != ~id5~0; 365#L345 assume ~id3~0 != ~id6~0; 391#L346 assume ~id3~0 != ~id7~0; 392#L347 assume ~id3~0 != ~id8~0; 451#L348 assume ~id4~0 != ~id5~0; 440#L349 assume ~id4~0 != ~id6~0; 441#L350 assume ~id4~0 != ~id7~0; 426#L351 assume ~id4~0 != ~id8~0; 427#L352 assume ~id5~0 != ~id6~0; 444#L353 assume ~id5~0 != ~id7~0; 411#L354 assume ~id5~0 != ~id8~0; 379#L355 assume ~id6~0 != ~id7~0; 380#L356 assume ~id6~0 != ~id8~0; 408#L357 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 372#L297-1 init_#res#1 := init_~tmp~0#1; 322#L542 main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#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; 323#L22 assume !(0 == assume_abort_if_not_~cond#1); 386#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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 334#L632-2 [2022-07-22 02:59:44,909 INFO L754 eck$LassoCheckResult]: Loop: 334#L632-2 assume !!(main_~i2~0#1 < 16);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; 449#L92 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 450#L96 assume !(node1_~m1~0#1 != ~nomsg~0); 410#L96-1 ~mode1~0 := 0; 417#L92-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; 393#L120 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 343#L123 assume !(node2_~m2~0#1 != ~nomsg~0); 344#L123-1 ~mode2~0 := 0; 351#L120-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; 366#L145 assume !(0 != ~mode3~0 % 256); 337#L158 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; 331#L158-2 ~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; 332#L145-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; 403#L170 assume !(0 != ~mode4~0 % 256); 357#L183 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 358#L183-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; 381#L170-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; 395#L195 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 428#L198 assume !(node5_~m5~0#1 != ~nomsg~0); 399#L198-1 ~mode5~0 := 0; 431#L195-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; 418#L220 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 419#L223 assume !(node6_~m6~0#1 != ~nomsg~0); 315#L223-1 ~mode6~0 := 0; 316#L220-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; 353#L245 assume !(0 != ~mode7~0 % 256); 354#L258 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 371#L258-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; 430#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 324#L270 assume !(0 != ~mode8~0 % 256); 325#L283 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 335#L283-2 ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 336#L270-2 assume { :end_inline_node8 } 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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 421#L550 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; 388#L550-1 check_#res#1 := check_~tmp~1#1; 383#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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; 384#L671 assume !(0 == assert_~arg#1 % 256); 333#L666 assume { :end_inline_assert } true;main_#t~post47#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post47#1;havoc main_#t~post47#1; 334#L632-2 [2022-07-22 02:59:44,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:59:44,909 INFO L85 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 1 times [2022-07-22 02:59:44,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:59:44,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022881669] [2022-07-22 02:59:44,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:59:44,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:59:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:59:44,945 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:59:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:59:44,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:59:44,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:59:44,999 INFO L85 PathProgramCache]: Analyzing trace with hash -961480097, now seen corresponding path program 1 times [2022-07-22 02:59:44,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:59:45,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317116648] [2022-07-22 02:59:45,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:59:45,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:59:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:59:45,068 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-22 02:59:45,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:59:45,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317116648] [2022-07-22 02:59:45,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317116648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:59:45,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:59:45,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:59:45,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407227052] [2022-07-22 02:59:45,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:59:45,069 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:59:45,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:59:45,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 02:59:45,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 02:59:45,070 INFO L87 Difference]: Start difference. First operand 141 states and 186 transitions. cyclomatic complexity: 46 Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-22 02:59:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:59:45,103 INFO L93 Difference]: Finished difference Result 144 states and 188 transitions. [2022-07-22 02:59:45,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 02:59:45,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 188 transitions. [2022-07-22 02:59:45,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2022-07-22 02:59:45,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 141 states and 183 transitions. [2022-07-22 02:59:45,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2022-07-22 02:59:45,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2022-07-22 02:59:45,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 183 transitions. [2022-07-22 02:59:45,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:59:45,108 INFO L369 hiAutomatonCegarLoop]: Abstraction has 141 states and 183 transitions. [2022-07-22 02:59:45,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 183 transitions. [2022-07-22 02:59:45,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-07-22 02:59:45,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 141 states have (on average 1.297872340425532) internal successors, (183), 140 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:59:45,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2022-07-22 02:59:45,113 INFO L392 hiAutomatonCegarLoop]: Abstraction has 141 states and 183 transitions. [2022-07-22 02:59:45,113 INFO L374 stractBuchiCegarLoop]: Abstraction has 141 states and 183 transitions. [2022-07-22 02:59:45,113 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 02:59:45,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 183 transitions. [2022-07-22 02:59:45,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2022-07-22 02:59:45,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:59:45,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:59:45,116 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:59:45,116 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, 1, 1, 1] [2022-07-22 02:59:45,117 INFO L752 eck$LassoCheckResult]: Stem: 749#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(35, 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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 682#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_#t~post47#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~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 670#L297 assume 0 == ~r1~0; 660#L298 assume ~id1~0 >= 0; 661#L299 assume 0 == ~st1~0; 679#L300 assume ~send1~0 == ~id1~0; 722#L301 assume 0 == ~mode1~0 % 256; 735#L302 assume ~id2~0 >= 0; 736#L303 assume 0 == ~st2~0; 742#L304 assume ~send2~0 == ~id2~0; 713#L305 assume 0 == ~mode2~0 % 256; 714#L306 assume ~id3~0 >= 0; 731#L307 assume 0 == ~st3~0; 626#L308 assume ~send3~0 == ~id3~0; 627#L309 assume 0 == ~mode3~0 % 256; 726#L310 assume ~id4~0 >= 0; 693#L311 assume 0 == ~st4~0; 694#L312 assume ~send4~0 == ~id4~0; 645#L313 assume 0 == ~mode4~0 % 256; 646#L314 assume ~id5~0 >= 0; 686#L315 assume 0 == ~st5~0; 687#L316 assume ~send5~0 == ~id5~0; 614#L317 assume 0 == ~mode5~0 % 256; 615#L318 assume ~id6~0 >= 0; 750#L319 assume 0 == ~st6~0; 734#L320 assume ~send6~0 == ~id6~0; 719#L321 assume 0 == ~mode6~0 % 256; 720#L322 assume ~id7~0 >= 0; 610#L323 assume 0 == ~st7~0; 611#L324 assume ~send7~0 == ~id7~0; 635#L325 assume 0 == ~mode7~0 % 256; 653#L326 assume ~id8~0 >= 0; 636#L327 assume 0 == ~st8~0; 637#L328 assume ~send8~0 == ~id8~0; 672#L329 assume 0 == ~mode8~0 % 256; 673#L330 assume ~id1~0 != ~id2~0; 624#L331 assume ~id1~0 != ~id3~0; 625#L332 assume ~id1~0 != ~id4~0; 649#L333 assume ~id1~0 != ~id5~0; 671#L334 assume ~id1~0 != ~id6~0; 643#L335 assume ~id1~0 != ~id7~0; 644#L336 assume ~id1~0 != ~id8~0; 730#L337 assume ~id2~0 != ~id3~0; 698#L338 assume ~id2~0 != ~id4~0; 699#L339 assume ~id2~0 != ~id5~0; 743#L340 assume ~id2~0 != ~id6~0; 740#L341 assume ~id2~0 != ~id7~0; 674#L342 assume ~id2~0 != ~id8~0; 675#L343 assume ~id3~0 != ~id4~0; 662#L344 assume ~id3~0 != ~id5~0; 663#L345 assume ~id3~0 != ~id6~0; 688#L346 assume ~id3~0 != ~id7~0; 689#L347 assume ~id3~0 != ~id8~0; 748#L348 assume ~id4~0 != ~id5~0; 737#L349 assume ~id4~0 != ~id6~0; 738#L350 assume ~id4~0 != ~id7~0; 723#L351 assume ~id4~0 != ~id8~0; 724#L352 assume ~id5~0 != ~id6~0; 741#L353 assume ~id5~0 != ~id7~0; 708#L354 assume ~id5~0 != ~id8~0; 676#L355 assume ~id6~0 != ~id7~0; 677#L356 assume ~id6~0 != ~id8~0; 703#L357 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 669#L297-1 init_#res#1 := init_~tmp~0#1; 619#L542 main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#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; 620#L22 assume !(0 == assume_abort_if_not_~cond#1); 683#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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 631#L632-2 [2022-07-22 02:59:45,117 INFO L754 eck$LassoCheckResult]: Loop: 631#L632-2 assume !!(main_~i2~0#1 < 16);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; 746#L92 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 747#L96 assume !(node1_~m1~0#1 != ~nomsg~0); 707#L96-1 ~mode1~0 := 0; 712#L92-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; 690#L120 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 640#L123 assume !(node2_~m2~0#1 != ~nomsg~0); 641#L123-1 ~mode2~0 := 0; 648#L120-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; 659#L145 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 656#L148 assume !(node3_~m3~0#1 != ~nomsg~0); 657#L148-1 ~mode3~0 := 0; 629#L145-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; 700#L170 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 704#L173 assume !(node4_~m4~0#1 != ~nomsg~0); 702#L173-1 ~mode4~0 := 0; 678#L170-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; 692#L195 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 725#L198 assume !(node5_~m5~0#1 != ~nomsg~0); 696#L198-1 ~mode5~0 := 0; 728#L195-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; 715#L220 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 716#L223 assume !(node6_~m6~0#1 != ~nomsg~0); 612#L223-1 ~mode6~0 := 0; 613#L220-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; 650#L245 assume !(0 != ~mode7~0 % 256); 651#L258 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 668#L258-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; 727#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 621#L270 assume !(0 != ~mode8~0 % 256); 622#L283 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 632#L283-2 ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 633#L270-2 assume { :end_inline_node8 } 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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 718#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 665#L551 assume ~r1~0 >= 8; 666#L555 assume ~r1~0 < 8;check_~tmp~1#1 := 1; 685#L550-1 check_#res#1 := check_~tmp~1#1; 680#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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; 681#L671 assume !(0 == assert_~arg#1 % 256); 630#L666 assume { :end_inline_assert } true;main_#t~post47#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post47#1;havoc main_#t~post47#1; 631#L632-2 [2022-07-22 02:59:45,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:59:45,118 INFO L85 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 2 times [2022-07-22 02:59:45,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:59:45,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479302099] [2022-07-22 02:59:45,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:59:45,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:59:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:59:45,144 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:59:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:59:45,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:59:45,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:59:45,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1089360837, now seen corresponding path program 1 times [2022-07-22 02:59:45,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:59:45,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098888072] [2022-07-22 02:59:45,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:59:45,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:59:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:59:45,196 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-22 02:59:45,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:59:45,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098888072] [2022-07-22 02:59:45,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098888072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:59:45,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:59:45,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:59:45,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520705633] [2022-07-22 02:59:45,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:59:45,197 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:59:45,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:59:45,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:59:45,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:59:45,198 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. cyclomatic complexity: 43 Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-22 02:59:45,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:59:45,221 INFO L93 Difference]: Finished difference Result 209 states and 288 transitions. [2022-07-22 02:59:45,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:59:45,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 288 transitions. [2022-07-22 02:59:45,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 142 [2022-07-22 02:59:45,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 209 states and 288 transitions. [2022-07-22 02:59:45,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 209 [2022-07-22 02:59:45,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2022-07-22 02:59:45,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 209 states and 288 transitions. [2022-07-22 02:59:45,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:59:45,226 INFO L369 hiAutomatonCegarLoop]: Abstraction has 209 states and 288 transitions. [2022-07-22 02:59:45,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 288 transitions. [2022-07-22 02:59:45,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2022-07-22 02:59:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 209 states have (on average 1.3779904306220097) internal successors, (288), 208 states have internal predecessors, (288), 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-22 02:59:45,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 288 transitions. [2022-07-22 02:59:45,232 INFO L392 hiAutomatonCegarLoop]: Abstraction has 209 states and 288 transitions. [2022-07-22 02:59:45,233 INFO L374 stractBuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2022-07-22 02:59:45,233 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 02:59:45,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 209 states and 288 transitions. [2022-07-22 02:59:45,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 142 [2022-07-22 02:59:45,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:59:45,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:59:45,236 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:59:45,236 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, 1, 1, 1, 1] [2022-07-22 02:59:45,236 INFO L752 eck$LassoCheckResult]: Stem: 1109#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(35, 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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 1037#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_#t~post47#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~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 1025#L297 assume 0 == ~r1~0; 1015#L298 assume ~id1~0 >= 0; 1016#L299 assume 0 == ~st1~0; 1033#L300 assume ~send1~0 == ~id1~0; 1078#L301 assume 0 == ~mode1~0 % 256; 1093#L302 assume ~id2~0 >= 0; 1094#L303 assume 0 == ~st2~0; 1101#L304 assume ~send2~0 == ~id2~0; 1068#L305 assume 0 == ~mode2~0 % 256; 1069#L306 assume ~id3~0 >= 0; 1089#L307 assume 0 == ~st3~0; 982#L308 assume ~send3~0 == ~id3~0; 983#L309 assume 0 == ~mode3~0 % 256; 1083#L310 assume ~id4~0 >= 0; 1048#L311 assume 0 == ~st4~0; 1049#L312 assume ~send4~0 == ~id4~0; 1001#L313 assume 0 == ~mode4~0 % 256; 1002#L314 assume ~id5~0 >= 0; 1039#L315 assume 0 == ~st5~0; 1040#L316 assume ~send5~0 == ~id5~0; 968#L317 assume 0 == ~mode5~0 % 256; 969#L318 assume ~id6~0 >= 0; 1110#L319 assume 0 == ~st6~0; 1092#L320 assume ~send6~0 == ~id6~0; 1075#L321 assume 0 == ~mode6~0 % 256; 1076#L322 assume ~id7~0 >= 0; 966#L323 assume 0 == ~st7~0; 967#L324 assume ~send7~0 == ~id7~0; 991#L325 assume 0 == ~mode7~0 % 256; 1006#L326 assume ~id8~0 >= 0; 992#L327 assume 0 == ~st8~0; 993#L328 assume ~send8~0 == ~id8~0; 1027#L329 assume 0 == ~mode8~0 % 256; 1028#L330 assume ~id1~0 != ~id2~0; 980#L331 assume ~id1~0 != ~id3~0; 981#L332 assume ~id1~0 != ~id4~0; 1005#L333 assume ~id1~0 != ~id5~0; 1026#L334 assume ~id1~0 != ~id6~0; 999#L335 assume ~id1~0 != ~id7~0; 1000#L336 assume ~id1~0 != ~id8~0; 1088#L337 assume ~id2~0 != ~id3~0; 1054#L338 assume ~id2~0 != ~id4~0; 1055#L339 assume ~id2~0 != ~id5~0; 1102#L340 assume ~id2~0 != ~id6~0; 1098#L341 assume ~id2~0 != ~id7~0; 1029#L342 assume ~id2~0 != ~id8~0; 1030#L343 assume ~id3~0 != ~id4~0; 1017#L344 assume ~id3~0 != ~id5~0; 1018#L345 assume ~id3~0 != ~id6~0; 1043#L346 assume ~id3~0 != ~id7~0; 1044#L347 assume ~id3~0 != ~id8~0; 1107#L348 assume ~id4~0 != ~id5~0; 1095#L349 assume ~id4~0 != ~id6~0; 1096#L350 assume ~id4~0 != ~id7~0; 1079#L351 assume ~id4~0 != ~id8~0; 1080#L352 assume ~id5~0 != ~id6~0; 1099#L353 assume ~id5~0 != ~id7~0; 1064#L354 assume ~id5~0 != ~id8~0; 1031#L355 assume ~id6~0 != ~id7~0; 1032#L356 assume ~id6~0 != ~id8~0; 1059#L357 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 1024#L297-1 init_#res#1 := init_~tmp~0#1; 975#L542 main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#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; 976#L22 assume !(0 == assume_abort_if_not_~cond#1); 1038#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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1100#L632-2 [2022-07-22 02:59:45,236 INFO L754 eck$LassoCheckResult]: Loop: 1100#L632-2 assume !!(main_~i2~0#1 < 16);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; 1172#L92 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 1106#L96 assume !(node1_~m1~0#1 != ~nomsg~0); 1063#L96-1 ~mode1~0 := 0; 1081#L92-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; 1169#L120 assume !(0 != ~mode2~0 % 256); 1168#L133 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; 1163#L133-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; 1162#L120-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; 1161#L145 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1158#L148 assume !(node3_~m3~0#1 != ~nomsg~0); 1156#L148-1 ~mode3~0 := 0; 1154#L145-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; 1153#L170 assume !(0 != ~mode4~0 % 256); 1149#L183 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 1147#L183-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; 1146#L170-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; 1145#L195 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1143#L198 assume !(node5_~m5~0#1 != ~nomsg~0); 1140#L198-1 ~mode5~0 := 0; 1138#L195-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; 1137#L220 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 1136#L223 assume !(node6_~m6~0#1 != ~nomsg~0); 1132#L223-1 ~mode6~0 := 0; 1130#L220-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; 1129#L245 assume !(0 != ~mode7~0 % 256); 1125#L258 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 1123#L258-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; 1122#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 977#L270 assume !(0 != ~mode8~0 % 256); 978#L283 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 988#L283-2 ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 989#L270-2 assume { :end_inline_node8 } 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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1074#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 1114#L551 assume !(~r1~0 >= 8); 1112#L554 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 1113#L555 assume ~r1~0 < 8;check_~tmp~1#1 := 1; 1047#L550-1 check_#res#1 := check_~tmp~1#1; 1035#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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; 1036#L671 assume !(0 == assert_~arg#1 % 256); 1108#L666 assume { :end_inline_assert } true;main_#t~post47#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post47#1;havoc main_#t~post47#1; 1100#L632-2 [2022-07-22 02:59:45,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:59:45,237 INFO L85 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 3 times [2022-07-22 02:59:45,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:59:45,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624278350] [2022-07-22 02:59:45,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:59:45,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:59:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:59:45,259 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:59:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:59:45,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:59:45,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:59:45,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1981950247, now seen corresponding path program 1 times [2022-07-22 02:59:45,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:59:45,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247500554] [2022-07-22 02:59:45,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:59:45,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:59:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:59:45,317 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:59:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:59:45,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:59:45,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:59:45,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1492504346, now seen corresponding path program 1 times [2022-07-22 02:59:45,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:59:45,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789554803] [2022-07-22 02:59:45,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:59:45,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:59:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:59:45,448 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-22 02:59:45,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:59:45,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789554803] [2022-07-22 02:59:45,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789554803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:59:45,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:59:45,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:59:45,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135117729] [2022-07-22 02:59:45,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:59:47,198 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:59:47,198 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:59:47,198 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:59:47,198 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:59:47,199 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 02:59:47,199 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:59:47,199 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:59:47,199 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:59:47,199 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.8.1.ufo.BOUNDED-16.pals.c_Iteration4_Loop [2022-07-22 02:59:47,199 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:59:47,199 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:59:47,215 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-22 02:59:47,221 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-22 02:59:47,223 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-22 02:59:47,224 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-22 02:59:47,228 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-22 02:59:47,236 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-22 02:59:47,239 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-22 02:59:47,240 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-22 02:59:47,243 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-22 02:59:47,245 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-22 02:59:47,246 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-22 02:59:47,256 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-22 02:59:47,258 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-22 02:59:47,259 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-22 02:59:47,260 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-22 02:59:47,262 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-22 02:59:47,263 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-22 02:59:47,264 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-22 02:59:47,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-22 02:59:47,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-22 02:59:47,489 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-22 02:59:47,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-22 02:59:47,494 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-22 02:59:47,498 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-22 02:59:47,500 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-22 02:59:47,502 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-22 02:59:47,503 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-22 02:59:47,505 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-22 02:59:47,507 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-22 02:59:47,509 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-22 02:59:47,510 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-22 02:59:47,512 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-22 02:59:47,516 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-22 02:59:47,520 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-22 02:59:47,522 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-22 02:59:47,524 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-22 02:59:47,527 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-22 02:59:47,532 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-22 02:59:47,534 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-22 02:59:47,536 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-22 02:59:48,523 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12