./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.UNBOUNDED.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e82362cf624f0e845caa7a60d1834859999824a1181a9b545ac94ec06fd3aa08 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:30:52,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:30:52,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:30:52,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:30:52,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:30:52,566 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:30:52,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:30:52,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:30:52,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:30:52,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:30:52,577 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:30:52,578 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:30:52,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:30:52,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:30:52,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:30:52,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:30:52,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:30:52,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:30:52,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:30:52,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:30:52,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:30:52,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:30:52,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:30:52,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:30:52,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:30:52,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:30:52,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:30:52,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:30:52,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:30:52,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:30:52,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:30:52,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:30:52,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:30:52,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:30:52,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:30:52,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:30:52,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:30:52,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:30:52,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:30:52,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:30:52,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:30:52,611 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:30:52,653 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:30:52,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:30:52,654 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:30:52,654 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:30:52,655 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:30:52,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:30:52,656 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:30:52,656 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:30:52,656 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:30:52,656 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:30:52,657 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:30:52,657 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:30:52,657 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:30:52,658 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:30:52,658 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:30:52,658 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:30:52,658 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:30:52,658 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:30:52,659 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:30:52,659 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:30:52,659 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:30:52,659 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:30:52,659 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:30:52,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:30:52,660 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:30:52,660 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:30:52,660 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:30:52,660 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:30:52,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:30:52,661 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:30:52,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:30:52,662 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:30:52,662 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 -> e82362cf624f0e845caa7a60d1834859999824a1181a9b545ac94ec06fd3aa08 [2022-02-21 04:30:52,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:30:52,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:30:52,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:30:52,939 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:30:52,939 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:30:52,941 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.UNBOUNDED.pals.c [2022-02-21 04:30:53,004 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b6b2528/ef077117447847e6825cf9bbec79e9bd/FLAG0d9b71aac [2022-02-21 04:30:53,501 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:30:53,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.UNBOUNDED.pals.c [2022-02-21 04:30:53,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b6b2528/ef077117447847e6825cf9bbec79e9bd/FLAG0d9b71aac [2022-02-21 04:30:54,019 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b6b2528/ef077117447847e6825cf9bbec79e9bd [2022-02-21 04:30:54,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:30:54,023 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:30:54,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:30:54,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:30:54,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:30:54,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@520c64cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54, skipping insertion in model container [2022-02-21 04:30:54,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:30:54,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:30:54,329 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.ufo.UNBOUNDED.pals.c[26481,26494] [2022-02-21 04:30:54,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:30:54,346 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:30:54,406 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.ufo.UNBOUNDED.pals.c[26481,26494] [2022-02-21 04:30:54,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:30:54,436 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:30:54,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54 WrapperNode [2022-02-21 04:30:54,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:30:54,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:30:54,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:30:54,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:30:54,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,510 INFO L137 Inliner]: procedures = 28, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 496 [2022-02-21 04:30:54,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:30:54,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:30:54,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:30:54,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:30:54,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:30:54,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:30:54,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:30:54,548 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:30:54,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:54,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:54,586 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-02-21 04:30:54,596 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-02-21 04:30:54,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:30:54,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:30:54,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:30:54,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:30:54,780 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:30:54,782 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:30:55,446 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:30:55,453 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:30:55,459 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:30:55,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:30:55 BoogieIcfgContainer [2022-02-21 04:30:55,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:30:55,467 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:30:55,468 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:30:55,470 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:30:55,471 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:30:55,471 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:30:54" (1/3) ... [2022-02-21 04:30:55,472 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37946188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:30:55, skipping insertion in model container [2022-02-21 04:30:55,472 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:30:55,473 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (2/3) ... [2022-02-21 04:30:55,473 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37946188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:30:55, skipping insertion in model container [2022-02-21 04:30:55,473 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:30:55,473 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:30:55" (3/3) ... [2022-02-21 04:30:55,475 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals.c [2022-02-21 04:30:55,526 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:30:55,527 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:30:55,527 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:30:55,527 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:30:55,527 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:30:55,527 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:30:55,527 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:30:55,528 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:30:55,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 148 states, 147 states have (on average 1.7551020408163265) internal successors, (258), 147 states have internal predecessors, (258), 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-02-21 04:30:55,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-02-21 04:30:55,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:55,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:55,602 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:55,602 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:55,602 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:30:55,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 148 states, 147 states have (on average 1.7551020408163265) internal successors, (258), 147 states have internal predecessors, (258), 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-02-21 04:30:55,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-02-21 04:30:55,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:55,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:55,624 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:55,624 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:55,631 INFO L791 eck$LassoCheckResult]: Stem: 132#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(32, 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]; 43#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_~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; 30#L298true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 48#L298-1true init_#res#1 := init_~tmp~0#1; 50#L543true 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; 45#L22true assume !(0 == assume_abort_if_not_~cond#1); 108#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; 95#L633-2true [2022-02-21 04:30:55,632 INFO L793 eck$LassoCheckResult]: Loop: 95#L633-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 124#L92true assume !(0 != ~mode1~0 % 256); 123#L109true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 141#L109-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; 61#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; 24#L121true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 83#L124true assume !(node2_~m2~0#1 != ~nomsg~0); 42#L124-1true ~mode2~0 := 0; 9#L121-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; 96#L146true assume !(0 != ~mode3~0 % 256); 76#L159true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 101#L159-2true ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 126#L146-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; 122#L171true assume !(0 != ~mode4~0 % 256); 88#L184true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 80#L184-2true ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 84#L171-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; 65#L196true assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 53#L199true assume !(node5_~m5~0#1 != ~nomsg~0); 148#L199-1true ~mode5~0 := 0; 139#L196-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; 90#L221true assume !(0 != ~mode6~0 % 256); 74#L234true assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 7#L234-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; 59#L221-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; 66#L246true assume !(0 != ~mode7~0 % 256); 72#L259true assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 127#L259-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; 15#L246-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; 33#L271true assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 98#L274true assume !(node8_~m8~0#1 != ~nomsg~0); 81#L274-1true ~mode8~0 := 0; 85#L271-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; 32#L551true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; 20#L551-1true check_#res#1 := check_~tmp~1#1; 135#L571true 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; 130#L671true assume !(0 == assert_~arg#1 % 256); 14#L666true assume { :end_inline_assert } true; 95#L633-2true [2022-02-21 04:30:55,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:55,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2144605008, now seen corresponding path program 1 times [2022-02-21 04:30:55,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:55,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614750204] [2022-02-21 04:30:55,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:55,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:55,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {152#true} 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(32, 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]; {152#true} is VALID [2022-02-21 04:30:55,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#true} 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_~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; {152#true} is VALID [2022-02-21 04:30:55,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {154#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-21 04:30:55,908 INFO L290 TraceCheckUtils]: 3: Hoare triple {154#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {155#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:30:55,908 INFO L290 TraceCheckUtils]: 4: Hoare triple {155#(= |ULTIMATE.start_init_#res#1| 0)} 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; {156#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:30:55,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {153#false} is VALID [2022-02-21 04:30:55,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {153#false} 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; {153#false} is VALID [2022-02-21 04:30:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:55,912 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:55,912 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614750204] [2022-02-21 04:30:55,913 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614750204] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:55,914 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:55,914 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:30:55,916 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104653095] [2022-02-21 04:30:55,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:55,921 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:30:55,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:55,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1609448354, now seen corresponding path program 1 times [2022-02-21 04:30:55,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:55,924 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97385850] [2022-02-21 04:30:55,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:55,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:56,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {157#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {157#true} is VALID [2022-02-21 04:30:56,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#true} assume !(0 != ~mode1~0 % 256); {157#true} is VALID [2022-02-21 04:30:56,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {157#true} is VALID [2022-02-21 04:30:56,117 INFO L290 TraceCheckUtils]: 3: Hoare triple {157#true} ~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; {157#true} is VALID [2022-02-21 04:30:56,118 INFO L290 TraceCheckUtils]: 4: Hoare triple {157#true} 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; {157#true} is VALID [2022-02-21 04:30:56,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {157#true} is VALID [2022-02-21 04:30:56,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {157#true} assume !(node2_~m2~0#1 != ~nomsg~0); {157#true} is VALID [2022-02-21 04:30:56,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {157#true} ~mode2~0 := 0; {157#true} is VALID [2022-02-21 04:30:56,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {157#true} 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; {157#true} is VALID [2022-02-21 04:30:56,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {157#true} assume !(0 != ~mode3~0 % 256); {157#true} is VALID [2022-02-21 04:30:56,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {157#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {157#true} is VALID [2022-02-21 04:30:56,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {157#true} ~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; {157#true} is VALID [2022-02-21 04:30:56,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {157#true} 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; {157#true} is VALID [2022-02-21 04:30:56,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {157#true} assume !(0 != ~mode4~0 % 256); {157#true} is VALID [2022-02-21 04:30:56,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {157#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {157#true} is VALID [2022-02-21 04:30:56,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {157#true} ~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; {157#true} is VALID [2022-02-21 04:30:56,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {157#true} 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; {157#true} is VALID [2022-02-21 04:30:56,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {157#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {157#true} is VALID [2022-02-21 04:30:56,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {157#true} assume !(node5_~m5~0#1 != ~nomsg~0); {157#true} is VALID [2022-02-21 04:30:56,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {157#true} ~mode5~0 := 0; {157#true} is VALID [2022-02-21 04:30:56,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {157#true} 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; {157#true} is VALID [2022-02-21 04:30:56,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {157#true} assume !(0 != ~mode6~0 % 256); {157#true} is VALID [2022-02-21 04:30:56,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {157#true} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {157#true} is VALID [2022-02-21 04:30:56,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {157#true} ~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; {157#true} is VALID [2022-02-21 04:30:56,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {157#true} 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; {157#true} is VALID [2022-02-21 04:30:56,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {157#true} assume !(0 != ~mode7~0 % 256); {157#true} is VALID [2022-02-21 04:30:56,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {157#true} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {157#true} is VALID [2022-02-21 04:30:56,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {157#true} ~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; {157#true} is VALID [2022-02-21 04:30:56,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {157#true} 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; {157#true} is VALID [2022-02-21 04:30:56,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {157#true} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {157#true} is VALID [2022-02-21 04:30:56,126 INFO L290 TraceCheckUtils]: 30: Hoare triple {157#true} assume !(node8_~m8~0#1 != ~nomsg~0); {157#true} is VALID [2022-02-21 04:30:56,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {157#true} ~mode8~0 := 0; {157#true} is VALID [2022-02-21 04:30:56,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {157#true} 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; {157#true} is VALID [2022-02-21 04:30:56,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {157#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {159#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:30:56,128 INFO L290 TraceCheckUtils]: 34: Hoare triple {159#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {160#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:30:56,131 INFO L290 TraceCheckUtils]: 35: Hoare triple {160#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} 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; {161#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:30:56,132 INFO L290 TraceCheckUtils]: 36: Hoare triple {161#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} assume !(0 == assert_~arg#1 % 256); {158#false} is VALID [2022-02-21 04:30:56,132 INFO L290 TraceCheckUtils]: 37: Hoare triple {158#false} assume { :end_inline_assert } true; {158#false} is VALID [2022-02-21 04:30:56,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:56,133 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:56,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97385850] [2022-02-21 04:30:56,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97385850] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:56,137 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:56,137 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:30:56,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101530152] [2022-02-21 04:30:56,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:56,140 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:56,142 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:56,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:30:56,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:30:56,172 INFO L87 Difference]: Start difference. First operand has 148 states, 147 states have (on average 1.7551020408163265) internal successors, (258), 147 states have internal predecessors, (258), 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-02-21 04:30:56,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:56,756 INFO L93 Difference]: Finished difference Result 147 states and 253 transitions. [2022-02-21 04:30:56,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:30:56,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 04:30:56,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:56,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 253 transitions. [2022-02-21 04:30:56,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2022-02-21 04:30:56,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 143 states and 189 transitions. [2022-02-21 04:30:56,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 143 [2022-02-21 04:30:56,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 143 [2022-02-21 04:30:56,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 143 states and 189 transitions. [2022-02-21 04:30:56,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:56,789 INFO L681 BuchiCegarLoop]: Abstraction has 143 states and 189 transitions. [2022-02-21 04:30:56,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states and 189 transitions. [2022-02-21 04:30:56,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-02-21 04:30:56,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:56,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states and 189 transitions. Second operand has 143 states, 143 states have (on average 1.3216783216783217) internal successors, (189), 142 states have internal predecessors, (189), 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-02-21 04:30:56,832 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states and 189 transitions. Second operand has 143 states, 143 states have (on average 1.3216783216783217) internal successors, (189), 142 states have internal predecessors, (189), 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-02-21 04:30:56,834 INFO L87 Difference]: Start difference. First operand 143 states and 189 transitions. Second operand has 143 states, 143 states have (on average 1.3216783216783217) internal successors, (189), 142 states have internal predecessors, (189), 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-02-21 04:30:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:56,840 INFO L93 Difference]: Finished difference Result 143 states and 189 transitions. [2022-02-21 04:30:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 189 transitions. [2022-02-21 04:30:56,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:56,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:56,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 143 states have (on average 1.3216783216783217) internal successors, (189), 142 states have internal predecessors, (189), 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 143 states and 189 transitions. [2022-02-21 04:30:56,843 INFO L87 Difference]: Start difference. First operand has 143 states, 143 states have (on average 1.3216783216783217) internal successors, (189), 142 states have internal predecessors, (189), 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 143 states and 189 transitions. [2022-02-21 04:30:56,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:56,848 INFO L93 Difference]: Finished difference Result 143 states and 189 transitions. [2022-02-21 04:30:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 189 transitions. [2022-02-21 04:30:56,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:56,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:56,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:56,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:56,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 143 states have (on average 1.3216783216783217) internal successors, (189), 142 states have internal predecessors, (189), 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-02-21 04:30:56,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 189 transitions. [2022-02-21 04:30:56,856 INFO L704 BuchiCegarLoop]: Abstraction has 143 states and 189 transitions. [2022-02-21 04:30:56,857 INFO L587 BuchiCegarLoop]: Abstraction has 143 states and 189 transitions. [2022-02-21 04:30:56,857 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:30:56,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 189 transitions. [2022-02-21 04:30:56,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2022-02-21 04:30:56,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:56,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:56,861 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-21 04:30:56,861 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:56,862 INFO L791 eck$LassoCheckResult]: Stem: 454#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(32, 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]; 380#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_~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; 358#L298 assume 0 == ~r1~0 % 256; 359#L299 assume ~id1~0 >= 0; 375#L300 assume 0 == ~st1~0; 412#L301 assume ~send1~0 == ~id1~0; 428#L302 assume 0 == ~mode1~0 % 256; 429#L303 assume ~id2~0 >= 0; 442#L304 assume 0 == ~st2~0; 404#L305 assume ~send2~0 == ~id2~0; 405#L306 assume 0 == ~mode2~0 % 256; 421#L307 assume ~id3~0 >= 0; 331#L308 assume 0 == ~st3~0; 332#L309 assume ~send3~0 == ~id3~0; 417#L310 assume 0 == ~mode3~0 % 256; 392#L311 assume ~id4~0 >= 0; 393#L312 assume 0 == ~st4~0; 349#L313 assume ~send4~0 == ~id4~0; 350#L314 assume 0 == ~mode4~0 % 256; 385#L315 assume ~id5~0 >= 0; 386#L316 assume 0 == ~st5~0; 318#L317 assume ~send5~0 == ~id5~0; 319#L318 assume 0 == ~mode5~0 % 256; 455#L319 assume ~id6~0 >= 0; 427#L320 assume 0 == ~st6~0; 410#L321 assume ~send6~0 == ~id6~0; 411#L322 assume 0 == ~mode6~0 % 256; 316#L323 assume ~id7~0 >= 0; 317#L324 assume 0 == ~st7~0; 339#L325 assume ~send7~0 == ~id7~0; 357#L326 assume 0 == ~mode7~0 % 256; 340#L327 assume ~id8~0 >= 0; 341#L328 assume 0 == ~st8~0; 367#L329 assume ~send8~0 == ~id8~0; 368#L330 assume 0 == ~mode8~0 % 256; 329#L331 assume ~id1~0 != ~id2~0; 330#L332 assume ~id1~0 != ~id3~0; 356#L333 assume ~id1~0 != ~id4~0; 366#L334 assume ~id1~0 != ~id5~0; 345#L335 assume ~id1~0 != ~id6~0; 346#L336 assume ~id1~0 != ~id7~0; 420#L337 assume ~id1~0 != ~id8~0; 396#L338 assume ~id2~0 != ~id3~0; 397#L339 assume ~id2~0 != ~id4~0; 444#L340 assume ~id2~0 != ~id5~0; 439#L341 assume ~id2~0 != ~id6~0; 369#L342 assume ~id2~0 != ~id7~0; 370#L343 assume ~id2~0 != ~id8~0; 360#L344 assume ~id3~0 != ~id4~0; 361#L345 assume ~id3~0 != ~id5~0; 387#L346 assume ~id3~0 != ~id6~0; 388#L347 assume ~id3~0 != ~id7~0; 452#L348 assume ~id3~0 != ~id8~0; 433#L349 assume ~id4~0 != ~id5~0; 434#L350 assume ~id4~0 != ~id6~0; 414#L351 assume ~id4~0 != ~id7~0; 415#L352 assume ~id4~0 != ~id8~0; 441#L353 assume ~id5~0 != ~id6~0; 402#L354 assume ~id5~0 != ~id7~0; 371#L355 assume ~id5~0 != ~id8~0; 372#L356 assume ~id6~0 != ~id7~0; 399#L357 assume ~id6~0 != ~id8~0; 333#L358 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 334#L298-1 init_#res#1 := init_~tmp~0#1; 389#L543 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; 383#L22 assume !(0 == assume_abort_if_not_~cond#1); 384#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; 336#L633-2 [2022-02-21 04:30:56,862 INFO L793 eck$LassoCheckResult]: Loop: 336#L633-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 435#L92 assume !(0 != ~mode1~0 % 256); 450#L109 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 451#L109-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 391#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; 351#L121 assume !(0 != ~mode2~0 % 256); 352#L134 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 406#L134-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; 327#L121-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; 328#L146 assume !(0 != ~mode3~0 % 256); 418#L159 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 419#L159-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; 438#L146-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; 448#L171 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 449#L174 assume !(node4_~m4~0#1 != ~nomsg~0); 314#L174-1 ~mode4~0 := 0; 423#L171-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; 407#L196 assume !(0 != ~mode5~0 % 256); 408#L209 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 445#L209-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 446#L196-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; 431#L221 assume !(0 != ~mode6~0 % 256); 416#L234 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 320#L234-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 321#L221-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; 403#L246 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 322#L249 assume !(node7_~m7~0#1 != ~nomsg~0); 323#L249-1 ~mode7~0 := 0; 337#L246-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; 338#L271 assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 364#L274 assume !(node8_~m8~0#1 != ~nomsg~0); 424#L274-1 ~mode8~0 := 0; 348#L271-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; 362#L551 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; 343#L551-1 check_#res#1 := check_~tmp~1#1; 344#L571 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; 453#L671 assume !(0 == assert_~arg#1 % 256); 335#L666 assume { :end_inline_assert } true; 336#L633-2 [2022-02-21 04:30:56,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:56,863 INFO L85 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 1 times [2022-02-21 04:30:56,863 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:56,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371899840] [2022-02-21 04:30:56,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:56,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:56,929 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:57,003 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:57,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:57,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1894180770, now seen corresponding path program 1 times [2022-02-21 04:30:57,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:57,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143388548] [2022-02-21 04:30:57,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:57,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:57,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {747#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {747#true} is VALID [2022-02-21 04:30:57,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {747#true} assume !(0 != ~mode1~0 % 256); {747#true} is VALID [2022-02-21 04:30:57,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {747#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {747#true} is VALID [2022-02-21 04:30:57,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {747#true} ~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; {747#true} is VALID [2022-02-21 04:30:57,102 INFO L290 TraceCheckUtils]: 4: Hoare triple {747#true} 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; {747#true} is VALID [2022-02-21 04:30:57,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {747#true} assume !(0 != ~mode2~0 % 256); {747#true} is VALID [2022-02-21 04:30:57,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {747#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {747#true} is VALID [2022-02-21 04:30:57,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {747#true} ~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; {747#true} is VALID [2022-02-21 04:30:57,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {747#true} 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; {747#true} is VALID [2022-02-21 04:30:57,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {747#true} assume !(0 != ~mode3~0 % 256); {747#true} is VALID [2022-02-21 04:30:57,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {747#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {747#true} is VALID [2022-02-21 04:30:57,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {747#true} ~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; {747#true} is VALID [2022-02-21 04:30:57,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {747#true} 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; {747#true} is VALID [2022-02-21 04:30:57,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {747#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {747#true} is VALID [2022-02-21 04:30:57,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {747#true} assume !(node4_~m4~0#1 != ~nomsg~0); {747#true} is VALID [2022-02-21 04:30:57,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {747#true} ~mode4~0 := 0; {747#true} is VALID [2022-02-21 04:30:57,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {747#true} 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; {747#true} is VALID [2022-02-21 04:30:57,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {747#true} assume !(0 != ~mode5~0 % 256); {747#true} is VALID [2022-02-21 04:30:57,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {747#true} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {747#true} is VALID [2022-02-21 04:30:57,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {747#true} ~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; {747#true} is VALID [2022-02-21 04:30:57,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {747#true} 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; {747#true} is VALID [2022-02-21 04:30:57,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {747#true} assume !(0 != ~mode6~0 % 256); {747#true} is VALID [2022-02-21 04:30:57,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {747#true} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {747#true} is VALID [2022-02-21 04:30:57,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {747#true} ~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; {747#true} is VALID [2022-02-21 04:30:57,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {747#true} 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; {747#true} is VALID [2022-02-21 04:30:57,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {747#true} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {747#true} is VALID [2022-02-21 04:30:57,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {747#true} assume !(node7_~m7~0#1 != ~nomsg~0); {747#true} is VALID [2022-02-21 04:30:57,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {747#true} ~mode7~0 := 0; {747#true} is VALID [2022-02-21 04:30:57,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {747#true} 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; {747#true} is VALID [2022-02-21 04:30:57,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {747#true} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {747#true} is VALID [2022-02-21 04:30:57,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {747#true} assume !(node8_~m8~0#1 != ~nomsg~0); {747#true} is VALID [2022-02-21 04:30:57,108 INFO L290 TraceCheckUtils]: 31: Hoare triple {747#true} ~mode8~0 := 0; {747#true} is VALID [2022-02-21 04:30:57,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {747#true} 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; {747#true} is VALID [2022-02-21 04:30:57,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {747#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {749#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:30:57,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {749#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {750#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:30:57,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {750#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} 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; {751#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:30:57,111 INFO L290 TraceCheckUtils]: 36: Hoare triple {751#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} assume !(0 == assert_~arg#1 % 256); {748#false} is VALID [2022-02-21 04:30:57,112 INFO L290 TraceCheckUtils]: 37: Hoare triple {748#false} assume { :end_inline_assert } true; {748#false} is VALID [2022-02-21 04:30:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:57,112 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:57,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143388548] [2022-02-21 04:30:57,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143388548] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:57,113 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:57,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:30:57,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453119811] [2022-02-21 04:30:57,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:57,114 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:57,114 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:57,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:30:57,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:30:57,115 INFO L87 Difference]: Start difference. First operand 143 states and 189 transitions. cyclomatic complexity: 47 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-02-21 04:30:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:57,553 INFO L93 Difference]: Finished difference Result 146 states and 191 transitions. [2022-02-21 04:30:57,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:30:57,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 04:30:57,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:57,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 191 transitions. [2022-02-21 04:30:57,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2022-02-21 04:30:57,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 143 states and 186 transitions. [2022-02-21 04:30:57,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 143 [2022-02-21 04:30:57,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 143 [2022-02-21 04:30:57,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 143 states and 186 transitions. [2022-02-21 04:30:57,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:57,597 INFO L681 BuchiCegarLoop]: Abstraction has 143 states and 186 transitions. [2022-02-21 04:30:57,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states and 186 transitions. [2022-02-21 04:30:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-02-21 04:30:57,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:57,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states and 186 transitions. Second operand has 143 states, 143 states have (on average 1.3006993006993006) internal successors, (186), 142 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-02-21 04:30:57,603 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states and 186 transitions. Second operand has 143 states, 143 states have (on average 1.3006993006993006) internal successors, (186), 142 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-02-21 04:30:57,603 INFO L87 Difference]: Start difference. First operand 143 states and 186 transitions. Second operand has 143 states, 143 states have (on average 1.3006993006993006) internal successors, (186), 142 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-02-21 04:30:57,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:57,607 INFO L93 Difference]: Finished difference Result 143 states and 186 transitions. [2022-02-21 04:30:57,607 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 186 transitions. [2022-02-21 04:30:57,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:57,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:57,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 143 states have (on average 1.3006993006993006) internal successors, (186), 142 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) Second operand 143 states and 186 transitions. [2022-02-21 04:30:57,609 INFO L87 Difference]: Start difference. First operand has 143 states, 143 states have (on average 1.3006993006993006) internal successors, (186), 142 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) Second operand 143 states and 186 transitions. [2022-02-21 04:30:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:57,613 INFO L93 Difference]: Finished difference Result 143 states and 186 transitions. [2022-02-21 04:30:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 186 transitions. [2022-02-21 04:30:57,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:57,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:57,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:57,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 143 states have (on average 1.3006993006993006) internal successors, (186), 142 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-02-21 04:30:57,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 186 transitions. [2022-02-21 04:30:57,618 INFO L704 BuchiCegarLoop]: Abstraction has 143 states and 186 transitions. [2022-02-21 04:30:57,618 INFO L587 BuchiCegarLoop]: Abstraction has 143 states and 186 transitions. [2022-02-21 04:30:57,618 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:30:57,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 186 transitions. [2022-02-21 04:30:57,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2022-02-21 04:30:57,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:57,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:57,621 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-21 04:30:57,621 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:57,621 INFO L791 eck$LassoCheckResult]: Stem: 1043#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(32, 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]; 969#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_~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; 949#L298 assume 0 == ~r1~0 % 256; 950#L299 assume ~id1~0 >= 0; 964#L300 assume 0 == ~st1~0; 1001#L301 assume ~send1~0 == ~id1~0; 1017#L302 assume 0 == ~mode1~0 % 256; 1018#L303 assume ~id2~0 >= 0; 1032#L304 assume 0 == ~st2~0; 993#L305 assume ~send2~0 == ~id2~0; 994#L306 assume 0 == ~mode2~0 % 256; 1010#L307 assume ~id3~0 >= 0; 920#L308 assume 0 == ~st3~0; 921#L309 assume ~send3~0 == ~id3~0; 1006#L310 assume 0 == ~mode3~0 % 256; 981#L311 assume ~id4~0 >= 0; 982#L312 assume 0 == ~st4~0; 936#L313 assume ~send4~0 == ~id4~0; 937#L314 assume 0 == ~mode4~0 % 256; 974#L315 assume ~id5~0 >= 0; 975#L316 assume 0 == ~st5~0; 907#L317 assume ~send5~0 == ~id5~0; 908#L318 assume 0 == ~mode5~0 % 256; 1044#L319 assume ~id6~0 >= 0; 1016#L320 assume 0 == ~st6~0; 999#L321 assume ~send6~0 == ~id6~0; 1000#L322 assume 0 == ~mode6~0 % 256; 902#L323 assume ~id7~0 >= 0; 903#L324 assume 0 == ~st7~0; 928#L325 assume ~send7~0 == ~id7~0; 946#L326 assume 0 == ~mode7~0 % 256; 929#L327 assume ~id8~0 >= 0; 930#L328 assume 0 == ~st8~0; 956#L329 assume ~send8~0 == ~id8~0; 957#L330 assume 0 == ~mode8~0 % 256; 918#L331 assume ~id1~0 != ~id2~0; 919#L332 assume ~id1~0 != ~id3~0; 943#L333 assume ~id1~0 != ~id4~0; 953#L334 assume ~id1~0 != ~id5~0; 934#L335 assume ~id1~0 != ~id6~0; 935#L336 assume ~id1~0 != ~id7~0; 1009#L337 assume ~id1~0 != ~id8~0; 985#L338 assume ~id2~0 != ~id3~0; 986#L339 assume ~id2~0 != ~id4~0; 1033#L340 assume ~id2~0 != ~id5~0; 1028#L341 assume ~id2~0 != ~id6~0; 958#L342 assume ~id2~0 != ~id7~0; 959#L343 assume ~id2~0 != ~id8~0; 947#L344 assume ~id3~0 != ~id4~0; 948#L345 assume ~id3~0 != ~id5~0; 976#L346 assume ~id3~0 != ~id6~0; 977#L347 assume ~id3~0 != ~id7~0; 1041#L348 assume ~id3~0 != ~id8~0; 1022#L349 assume ~id4~0 != ~id5~0; 1023#L350 assume ~id4~0 != ~id6~0; 1002#L351 assume ~id4~0 != ~id7~0; 1003#L352 assume ~id4~0 != ~id8~0; 1030#L353 assume ~id5~0 != ~id6~0; 991#L354 assume ~id5~0 != ~id7~0; 960#L355 assume ~id5~0 != ~id8~0; 961#L356 assume ~id6~0 != ~id7~0; 988#L357 assume ~id6~0 != ~id8~0; 922#L358 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 923#L298-1 init_#res#1 := init_~tmp~0#1; 978#L543 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; 972#L22 assume !(0 == assume_abort_if_not_~cond#1); 973#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; 925#L633-2 [2022-02-21 04:30:57,624 INFO L793 eck$LassoCheckResult]: Loop: 925#L633-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 1024#L92 assume !(0 != ~mode1~0 % 256); 1039#L109 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 1040#L109-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 980#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; 940#L121 assume !(0 != ~mode2~0 % 256); 941#L134 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 995#L134-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; 914#L121-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; 915#L146 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1025#L149 assume !(node3_~m3~0#1 != ~nomsg~0); 917#L149-1 ~mode3~0 := 0; 1027#L146-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; 1037#L171 assume !(0 != ~mode4~0 % 256); 1019#L184 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 1011#L184-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; 1012#L171-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; 996#L196 assume !(0 != ~mode5~0 % 256); 997#L209 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 1034#L209-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 1035#L196-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; 1020#L221 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 1014#L224 assume !(node6_~m6~0#1 != ~nomsg~0); 966#L224-1 ~mode6~0 := 0; 910#L221-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; 992#L246 assume !(0 != ~mode7~0 % 256); 998#L259 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 1004#L259-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; 926#L246-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; 927#L271 assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 954#L274 assume !(node8_~m8~0#1 != ~nomsg~0); 1013#L274-1 ~mode8~0 := 0; 939#L271-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; 951#L551 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 952#L552 assume ~r1~0 % 256 >= 8; 970#L556 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 932#L551-1 check_#res#1 := check_~tmp~1#1; 933#L571 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; 1042#L671 assume !(0 == assert_~arg#1 % 256); 924#L666 assume { :end_inline_assert } true; 925#L633-2 [2022-02-21 04:30:57,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:57,625 INFO L85 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 2 times [2022-02-21 04:30:57,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:57,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776050503] [2022-02-21 04:30:57,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:57,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:57,692 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:57,733 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:57,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:57,734 INFO L85 PathProgramCache]: Analyzing trace with hash 949830926, now seen corresponding path program 1 times [2022-02-21 04:30:57,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:57,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028922679] [2022-02-21 04:30:57,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:57,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:57,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {1336#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1336#true} is VALID [2022-02-21 04:30:57,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {1336#true} assume !(0 != ~mode1~0 % 256); {1336#true} is VALID [2022-02-21 04:30:57,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {1336#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {1336#true} is VALID [2022-02-21 04:30:57,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {1336#true} ~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; {1336#true} is VALID [2022-02-21 04:30:57,773 INFO L290 TraceCheckUtils]: 4: Hoare triple {1336#true} 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; {1336#true} is VALID [2022-02-21 04:30:57,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {1336#true} assume !(0 != ~mode2~0 % 256); {1336#true} is VALID [2022-02-21 04:30:57,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {1336#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {1336#true} is VALID [2022-02-21 04:30:57,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {1336#true} ~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; {1336#true} is VALID [2022-02-21 04:30:57,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {1336#true} 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; {1336#true} is VALID [2022-02-21 04:30:57,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {1336#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1336#true} is VALID [2022-02-21 04:30:57,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {1336#true} assume !(node3_~m3~0#1 != ~nomsg~0); {1336#true} is VALID [2022-02-21 04:30:57,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {1336#true} ~mode3~0 := 0; {1336#true} is VALID [2022-02-21 04:30:57,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {1336#true} 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; {1336#true} is VALID [2022-02-21 04:30:57,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {1336#true} assume !(0 != ~mode4~0 % 256); {1336#true} is VALID [2022-02-21 04:30:57,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {1336#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {1336#true} is VALID [2022-02-21 04:30:57,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {1336#true} ~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; {1336#true} is VALID [2022-02-21 04:30:57,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {1336#true} 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; {1336#true} is VALID [2022-02-21 04:30:57,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {1336#true} assume !(0 != ~mode5~0 % 256); {1336#true} is VALID [2022-02-21 04:30:57,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {1336#true} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {1336#true} is VALID [2022-02-21 04:30:57,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {1336#true} ~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; {1336#true} is VALID [2022-02-21 04:30:57,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {1336#true} 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; {1336#true} is VALID [2022-02-21 04:30:57,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {1336#true} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1336#true} is VALID [2022-02-21 04:30:57,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {1336#true} assume !(node6_~m6~0#1 != ~nomsg~0); {1336#true} is VALID [2022-02-21 04:30:57,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {1336#true} ~mode6~0 := 0; {1336#true} is VALID [2022-02-21 04:30:57,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {1336#true} 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; {1336#true} is VALID [2022-02-21 04:30:57,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {1336#true} assume !(0 != ~mode7~0 % 256); {1336#true} is VALID [2022-02-21 04:30:57,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {1336#true} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {1336#true} is VALID [2022-02-21 04:30:57,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {1336#true} ~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; {1336#true} is VALID [2022-02-21 04:30:57,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {1336#true} 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; {1336#true} is VALID [2022-02-21 04:30:57,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {1336#true} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {1336#true} is VALID [2022-02-21 04:30:57,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {1336#true} assume !(node8_~m8~0#1 != ~nomsg~0); {1336#true} is VALID [2022-02-21 04:30:57,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {1336#true} ~mode8~0 := 0; {1336#true} is VALID [2022-02-21 04:30:57,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {1336#true} 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; {1336#true} is VALID [2022-02-21 04:30:57,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {1336#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {1336#true} is VALID [2022-02-21 04:30:57,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {1336#true} assume ~r1~0 % 256 >= 8; {1338#(not (<= ~r1~0 (+ 7 (* (div ~r1~0 256) 256))))} is VALID [2022-02-21 04:30:57,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {1338#(not (<= ~r1~0 (+ 7 (* (div ~r1~0 256) 256))))} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {1337#false} is VALID [2022-02-21 04:30:57,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {1337#false} check_#res#1 := check_~tmp~1#1; {1337#false} is VALID [2022-02-21 04:30:57,779 INFO L290 TraceCheckUtils]: 37: Hoare triple {1337#false} 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; {1337#false} is VALID [2022-02-21 04:30:57,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {1337#false} assume !(0 == assert_~arg#1 % 256); {1337#false} is VALID [2022-02-21 04:30:57,779 INFO L290 TraceCheckUtils]: 39: Hoare triple {1337#false} assume { :end_inline_assert } true; {1337#false} is VALID [2022-02-21 04:30:57,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:57,779 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:57,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028922679] [2022-02-21 04:30:57,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028922679] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:57,780 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:57,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:30:57,780 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92824238] [2022-02-21 04:30:57,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:57,780 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:57,781 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:57,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:30:57,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:30:57,781 INFO L87 Difference]: Start difference. First operand 143 states and 186 transitions. cyclomatic complexity: 44 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-02-21 04:30:58,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:58,055 INFO L93 Difference]: Finished difference Result 213 states and 294 transitions. [2022-02-21 04:30:58,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:30:58,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 04:30:58,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:58,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 213 states and 294 transitions. [2022-02-21 04:30:58,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 146 [2022-02-21 04:30:58,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 213 states to 213 states and 294 transitions. [2022-02-21 04:30:58,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 213 [2022-02-21 04:30:58,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 213 [2022-02-21 04:30:58,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 213 states and 294 transitions. [2022-02-21 04:30:58,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:58,101 INFO L681 BuchiCegarLoop]: Abstraction has 213 states and 294 transitions. [2022-02-21 04:30:58,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states and 294 transitions. [2022-02-21 04:30:58,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2022-02-21 04:30:58,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:58,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states and 294 transitions. Second operand has 211 states, 211 states have (on average 1.3791469194312795) internal successors, (291), 210 states have internal predecessors, (291), 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-02-21 04:30:58,109 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states and 294 transitions. Second operand has 211 states, 211 states have (on average 1.3791469194312795) internal successors, (291), 210 states have internal predecessors, (291), 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-02-21 04:30:58,109 INFO L87 Difference]: Start difference. First operand 213 states and 294 transitions. Second operand has 211 states, 211 states have (on average 1.3791469194312795) internal successors, (291), 210 states have internal predecessors, (291), 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-02-21 04:30:58,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:58,114 INFO L93 Difference]: Finished difference Result 213 states and 294 transitions. [2022-02-21 04:30:58,114 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 294 transitions. [2022-02-21 04:30:58,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:58,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:58,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 211 states have (on average 1.3791469194312795) internal successors, (291), 210 states have internal predecessors, (291), 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 213 states and 294 transitions. [2022-02-21 04:30:58,116 INFO L87 Difference]: Start difference. First operand has 211 states, 211 states have (on average 1.3791469194312795) internal successors, (291), 210 states have internal predecessors, (291), 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 213 states and 294 transitions. [2022-02-21 04:30:58,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:58,122 INFO L93 Difference]: Finished difference Result 213 states and 294 transitions. [2022-02-21 04:30:58,122 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 294 transitions. [2022-02-21 04:30:58,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:58,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:58,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:58,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 211 states have (on average 1.3791469194312795) internal successors, (291), 210 states have internal predecessors, (291), 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-02-21 04:30:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 291 transitions. [2022-02-21 04:30:58,128 INFO L704 BuchiCegarLoop]: Abstraction has 211 states and 291 transitions. [2022-02-21 04:30:58,128 INFO L587 BuchiCegarLoop]: Abstraction has 211 states and 291 transitions. [2022-02-21 04:30:58,128 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:30:58,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 211 states and 291 transitions. [2022-02-21 04:30:58,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 144 [2022-02-21 04:30:58,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:58,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:58,131 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-21 04:30:58,131 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:58,132 INFO L791 eck$LassoCheckResult]: Stem: 1694#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(32, 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]; 1619#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_~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; 1597#L298 assume 0 == ~r1~0 % 256; 1598#L299 assume ~id1~0 >= 0; 1614#L300 assume 0 == ~st1~0; 1651#L301 assume ~send1~0 == ~id1~0; 1667#L302 assume 0 == ~mode1~0 % 256; 1668#L303 assume ~id2~0 >= 0; 1682#L304 assume 0 == ~st2~0; 1642#L305 assume ~send2~0 == ~id2~0; 1643#L306 assume 0 == ~mode2~0 % 256; 1660#L307 assume ~id3~0 >= 0; 1570#L308 assume 0 == ~st3~0; 1571#L309 assume ~send3~0 == ~id3~0; 1656#L310 assume 0 == ~mode3~0 % 256; 1630#L311 assume ~id4~0 >= 0; 1631#L312 assume 0 == ~st4~0; 1588#L313 assume ~send4~0 == ~id4~0; 1589#L314 assume 0 == ~mode4~0 % 256; 1623#L315 assume ~id5~0 >= 0; 1624#L316 assume 0 == ~st5~0; 1557#L317 assume ~send5~0 == ~id5~0; 1558#L318 assume 0 == ~mode5~0 % 256; 1695#L319 assume ~id6~0 >= 0; 1666#L320 assume 0 == ~st6~0; 1649#L321 assume ~send6~0 == ~id6~0; 1650#L322 assume 0 == ~mode6~0 % 256; 1552#L323 assume ~id7~0 >= 0; 1553#L324 assume 0 == ~st7~0; 1578#L325 assume ~send7~0 == ~id7~0; 1596#L326 assume 0 == ~mode7~0 % 256; 1579#L327 assume ~id8~0 >= 0; 1580#L328 assume 0 == ~st8~0; 1606#L329 assume ~send8~0 == ~id8~0; 1607#L330 assume 0 == ~mode8~0 % 256; 1568#L331 assume ~id1~0 != ~id2~0; 1569#L332 assume ~id1~0 != ~id3~0; 1593#L333 assume ~id1~0 != ~id4~0; 1605#L334 assume ~id1~0 != ~id5~0; 1584#L335 assume ~id1~0 != ~id6~0; 1585#L336 assume ~id1~0 != ~id7~0; 1659#L337 assume ~id1~0 != ~id8~0; 1634#L338 assume ~id2~0 != ~id3~0; 1635#L339 assume ~id2~0 != ~id4~0; 1684#L340 assume ~id2~0 != ~id5~0; 1678#L341 assume ~id2~0 != ~id6~0; 1608#L342 assume ~id2~0 != ~id7~0; 1609#L343 assume ~id2~0 != ~id8~0; 1599#L344 assume ~id3~0 != ~id4~0; 1600#L345 assume ~id3~0 != ~id5~0; 1625#L346 assume ~id3~0 != ~id6~0; 1626#L347 assume ~id3~0 != ~id7~0; 1692#L348 assume ~id3~0 != ~id8~0; 1672#L349 assume ~id4~0 != ~id5~0; 1673#L350 assume ~id4~0 != ~id6~0; 1653#L351 assume ~id4~0 != ~id7~0; 1654#L352 assume ~id4~0 != ~id8~0; 1680#L353 assume ~id5~0 != ~id6~0; 1640#L354 assume ~id5~0 != ~id7~0; 1610#L355 assume ~id5~0 != ~id8~0; 1611#L356 assume ~id6~0 != ~id7~0; 1637#L357 assume ~id6~0 != ~id8~0; 1572#L358 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 1573#L298-1 init_#res#1 := init_~tmp~0#1; 1627#L543 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; 1621#L22 assume !(0 == assume_abort_if_not_~cond#1); 1622#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; 1681#L633-2 [2022-02-21 04:30:58,132 INFO L793 eck$LassoCheckResult]: Loop: 1681#L633-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 1758#L92 assume !(0 != ~mode1~0 % 256); 1757#L109 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 1756#L109-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 1629#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; 1755#L121 assume !(0 != ~mode2~0 % 256); 1751#L134 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 1750#L134-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; 1748#L121-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; 1747#L146 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1746#L149 assume !(node3_~m3~0#1 != ~nomsg~0); 1741#L149-1 ~mode3~0 := 0; 1740#L146-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; 1739#L171 assume !(0 != ~mode4~0 % 256); 1735#L184 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 1734#L184-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; 1732#L171-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; 1731#L196 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1728#L199 assume !(node5_~m5~0#1 != ~nomsg~0); 1725#L199-1 ~mode5~0 := 0; 1724#L196-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; 1723#L221 assume !(0 != ~mode6~0 % 256); 1719#L234 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 1718#L234-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 1716#L221-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; 1715#L246 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 1713#L249 assume !(node7_~m7~0#1 != ~nomsg~0); 1709#L249-1 ~mode7~0 := 0; 1708#L246-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; 1707#L271 assume !(0 != ~mode8~0 % 256); 1703#L284 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 1702#L284-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; 1700#L271-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; 1699#L551 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 1698#L552 assume !(~r1~0 % 256 >= 8); 1696#L555 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 1697#L556 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 1762#L551-1 check_#res#1 := check_~tmp~1#1; 1761#L571 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; 1760#L671 assume !(0 == assert_~arg#1 % 256); 1759#L666 assume { :end_inline_assert } true; 1681#L633-2 [2022-02-21 04:30:58,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:58,133 INFO L85 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 3 times [2022-02-21 04:30:58,133 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:58,133 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91057953] [2022-02-21 04:30:58,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:58,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:58,161 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:58,201 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:58,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:58,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1443497567, now seen corresponding path program 1 times [2022-02-21 04:30:58,203 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:58,203 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071956718] [2022-02-21 04:30:58,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:58,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:58,239 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:58,261 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:58,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:58,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2030957026, now seen corresponding path program 1 times [2022-02-21 04:30:58,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:58,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980498973] [2022-02-21 04:30:58,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:58,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:58,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {2196#true} 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(32, 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]; {2196#true} is VALID [2022-02-21 04:30:58,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {2196#true} 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_~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; {2196#true} is VALID [2022-02-21 04:30:58,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {2196#true} assume 0 == ~r1~0 % 256; {2196#true} is VALID [2022-02-21 04:30:58,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {2196#true} assume ~id1~0 >= 0; {2196#true} is VALID [2022-02-21 04:30:58,388 INFO L290 TraceCheckUtils]: 4: Hoare triple {2196#true} assume 0 == ~st1~0; {2196#true} is VALID [2022-02-21 04:30:58,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {2196#true} assume ~send1~0 == ~id1~0; {2196#true} is VALID [2022-02-21 04:30:58,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {2196#true} assume 0 == ~mode1~0 % 256; {2196#true} is VALID [2022-02-21 04:30:58,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {2196#true} assume ~id2~0 >= 0; {2196#true} is VALID [2022-02-21 04:30:58,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {2196#true} assume 0 == ~st2~0; {2196#true} is VALID [2022-02-21 04:30:58,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {2196#true} assume ~send2~0 == ~id2~0; {2196#true} is VALID [2022-02-21 04:30:58,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {2196#true} assume 0 == ~mode2~0 % 256; {2196#true} is VALID [2022-02-21 04:30:58,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {2196#true} assume ~id3~0 >= 0; {2196#true} is VALID [2022-02-21 04:30:58,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {2196#true} assume 0 == ~st3~0; {2196#true} is VALID [2022-02-21 04:30:58,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {2196#true} assume ~send3~0 == ~id3~0; {2196#true} is VALID [2022-02-21 04:30:58,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {2196#true} assume 0 == ~mode3~0 % 256; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,399 INFO L290 TraceCheckUtils]: 27: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,400 INFO L290 TraceCheckUtils]: 28: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id8~0 >= 0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st8~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send8~0 == ~id8~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode8~0 % 256; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,403 INFO L290 TraceCheckUtils]: 35: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,403 INFO L290 TraceCheckUtils]: 36: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,404 INFO L290 TraceCheckUtils]: 37: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,404 INFO L290 TraceCheckUtils]: 38: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,405 INFO L290 TraceCheckUtils]: 40: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,413 INFO L290 TraceCheckUtils]: 41: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id8~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,414 INFO L290 TraceCheckUtils]: 42: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,415 INFO L290 TraceCheckUtils]: 43: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,415 INFO L290 TraceCheckUtils]: 44: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,416 INFO L290 TraceCheckUtils]: 45: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,416 INFO L290 TraceCheckUtils]: 46: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,417 INFO L290 TraceCheckUtils]: 47: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id8~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,417 INFO L290 TraceCheckUtils]: 48: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,419 INFO L290 TraceCheckUtils]: 49: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,419 INFO L290 TraceCheckUtils]: 50: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,419 INFO L290 TraceCheckUtils]: 51: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,421 INFO L290 TraceCheckUtils]: 52: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id8~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,422 INFO L290 TraceCheckUtils]: 54: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,424 INFO L290 TraceCheckUtils]: 55: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,425 INFO L290 TraceCheckUtils]: 56: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id8~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,425 INFO L290 TraceCheckUtils]: 57: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,426 INFO L290 TraceCheckUtils]: 58: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,427 INFO L290 TraceCheckUtils]: 59: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id8~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,427 INFO L290 TraceCheckUtils]: 60: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,428 INFO L290 TraceCheckUtils]: 61: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id8~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,428 INFO L290 TraceCheckUtils]: 62: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,428 INFO L290 TraceCheckUtils]: 63: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,429 INFO L290 TraceCheckUtils]: 64: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} 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; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,429 INFO L290 TraceCheckUtils]: 65: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,430 INFO L290 TraceCheckUtils]: 66: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} 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; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,430 INFO L290 TraceCheckUtils]: 67: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,431 INFO L290 TraceCheckUtils]: 68: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,431 INFO L290 TraceCheckUtils]: 69: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,432 INFO L290 TraceCheckUtils]: 70: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~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; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,432 INFO L290 TraceCheckUtils]: 71: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} 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; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,433 INFO L290 TraceCheckUtils]: 72: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,433 INFO L290 TraceCheckUtils]: 73: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,434 INFO L290 TraceCheckUtils]: 74: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~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; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,434 INFO L290 TraceCheckUtils]: 75: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} 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; {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:30:58,435 INFO L290 TraceCheckUtils]: 76: Hoare triple {2198#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2197#false} is VALID [2022-02-21 04:30:58,435 INFO L290 TraceCheckUtils]: 77: Hoare triple {2197#false} assume !(node3_~m3~0#1 != ~nomsg~0); {2197#false} is VALID [2022-02-21 04:30:58,435 INFO L290 TraceCheckUtils]: 78: Hoare triple {2197#false} ~mode3~0 := 0; {2197#false} is VALID [2022-02-21 04:30:58,439 INFO L290 TraceCheckUtils]: 79: Hoare triple {2197#false} 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; {2197#false} is VALID [2022-02-21 04:30:58,439 INFO L290 TraceCheckUtils]: 80: Hoare triple {2197#false} assume !(0 != ~mode4~0 % 256); {2197#false} is VALID [2022-02-21 04:30:58,439 INFO L290 TraceCheckUtils]: 81: Hoare triple {2197#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {2197#false} is VALID [2022-02-21 04:30:58,440 INFO L290 TraceCheckUtils]: 82: Hoare triple {2197#false} ~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; {2197#false} is VALID [2022-02-21 04:30:58,440 INFO L290 TraceCheckUtils]: 83: Hoare triple {2197#false} 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; {2197#false} is VALID [2022-02-21 04:30:58,441 INFO L290 TraceCheckUtils]: 84: Hoare triple {2197#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2197#false} is VALID [2022-02-21 04:30:58,441 INFO L290 TraceCheckUtils]: 85: Hoare triple {2197#false} assume !(node5_~m5~0#1 != ~nomsg~0); {2197#false} is VALID [2022-02-21 04:30:58,441 INFO L290 TraceCheckUtils]: 86: Hoare triple {2197#false} ~mode5~0 := 0; {2197#false} is VALID [2022-02-21 04:30:58,441 INFO L290 TraceCheckUtils]: 87: Hoare triple {2197#false} 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; {2197#false} is VALID [2022-02-21 04:30:58,442 INFO L290 TraceCheckUtils]: 88: Hoare triple {2197#false} assume !(0 != ~mode6~0 % 256); {2197#false} is VALID [2022-02-21 04:30:58,442 INFO L290 TraceCheckUtils]: 89: Hoare triple {2197#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {2197#false} is VALID [2022-02-21 04:30:58,442 INFO L290 TraceCheckUtils]: 90: Hoare triple {2197#false} ~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; {2197#false} is VALID [2022-02-21 04:30:58,442 INFO L290 TraceCheckUtils]: 91: Hoare triple {2197#false} 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; {2197#false} is VALID [2022-02-21 04:30:58,442 INFO L290 TraceCheckUtils]: 92: Hoare triple {2197#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {2197#false} is VALID [2022-02-21 04:30:58,442 INFO L290 TraceCheckUtils]: 93: Hoare triple {2197#false} assume !(node7_~m7~0#1 != ~nomsg~0); {2197#false} is VALID [2022-02-21 04:30:58,442 INFO L290 TraceCheckUtils]: 94: Hoare triple {2197#false} ~mode7~0 := 0; {2197#false} is VALID [2022-02-21 04:30:58,442 INFO L290 TraceCheckUtils]: 95: Hoare triple {2197#false} 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; {2197#false} is VALID [2022-02-21 04:30:58,442 INFO L290 TraceCheckUtils]: 96: Hoare triple {2197#false} assume !(0 != ~mode8~0 % 256); {2197#false} is VALID [2022-02-21 04:30:58,442 INFO L290 TraceCheckUtils]: 97: Hoare triple {2197#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {2197#false} is VALID [2022-02-21 04:30:58,443 INFO L290 TraceCheckUtils]: 98: Hoare triple {2197#false} ~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; {2197#false} is VALID [2022-02-21 04:30:58,443 INFO L290 TraceCheckUtils]: 99: Hoare triple {2197#false} 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; {2197#false} is VALID [2022-02-21 04:30:58,443 INFO L290 TraceCheckUtils]: 100: Hoare triple {2197#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {2197#false} is VALID [2022-02-21 04:30:58,443 INFO L290 TraceCheckUtils]: 101: Hoare triple {2197#false} assume !(~r1~0 % 256 >= 8); {2197#false} is VALID [2022-02-21 04:30:58,443 INFO L290 TraceCheckUtils]: 102: Hoare triple {2197#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {2197#false} is VALID [2022-02-21 04:30:58,443 INFO L290 TraceCheckUtils]: 103: Hoare triple {2197#false} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {2197#false} is VALID [2022-02-21 04:30:58,443 INFO L290 TraceCheckUtils]: 104: Hoare triple {2197#false} check_#res#1 := check_~tmp~1#1; {2197#false} is VALID [2022-02-21 04:30:58,443 INFO L290 TraceCheckUtils]: 105: Hoare triple {2197#false} 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; {2197#false} is VALID [2022-02-21 04:30:58,443 INFO L290 TraceCheckUtils]: 106: Hoare triple {2197#false} assume !(0 == assert_~arg#1 % 256); {2197#false} is VALID [2022-02-21 04:30:58,444 INFO L290 TraceCheckUtils]: 107: Hoare triple {2197#false} assume { :end_inline_assert } true; {2197#false} is VALID [2022-02-21 04:30:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:58,444 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:58,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980498973] [2022-02-21 04:30:58,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980498973] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:58,445 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:58,445 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:30:58,445 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446048994] [2022-02-21 04:30:58,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:00,515 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:31:00,516 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:31:00,516 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:31:00,516 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:31:00,517 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:31:00,517 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:00,517 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:31:00,517 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:31:00,517 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.8.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-02-21 04:31:00,517 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:31:00,517 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:31:00,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:00,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:01,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:01,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:01,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:01,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:01,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:01,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:01,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:01,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:01,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:01,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:01,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:01,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:01,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:01,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:02,503 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2022-02-21 04:31:02,918 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 7776 conjuctions. This might take some time... [2022-02-21 04:31:11,917 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 7776 conjuctions.