./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c --full-output -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.1.ufo.BOUNDED-16.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 584cb00847e346bcb7b5af30068947c52ce3c4d690063caf12c5ab86dbf7ec89 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:30:34,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:30:34,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:30:34,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:30:34,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:30:34,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:30:34,864 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:30:34,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:30:34,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:30:34,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:30:34,873 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:30:34,874 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:30:34,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:30:34,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:30:34,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:30:34,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:30:34,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:30:34,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:30:34,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:30:34,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:30:34,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:30:34,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:30:34,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:30:34,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:30:34,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:30:34,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:30:34,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:30:34,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:30:34,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:30:34,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:30:34,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:30:34,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:30:34,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:30:34,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:30:34,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:30:34,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:30:34,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:30:34,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:30:34,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:30:34,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:30:34,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:30:34,902 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:34,930 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:30:34,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:30:34,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:30:34,931 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:30:34,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:30:34,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:30:34,932 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:30:34,932 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:30:34,932 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:30:34,932 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:30:34,933 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:30:34,933 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:30:34,933 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:30:34,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:30:34,934 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:30:34,934 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:30:34,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:30:34,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:30:34,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:30:34,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:30:34,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:30:34,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:30:34,935 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:30:34,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:30:34,935 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:30:34,935 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:30:34,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:30:34,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:30:34,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:30:34,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:30:34,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:30:34,937 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:30:34,937 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 584cb00847e346bcb7b5af30068947c52ce3c4d690063caf12c5ab86dbf7ec89 [2022-02-21 04:30:35,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:30:35,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:30:35,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:30:35,163 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:30:35,164 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:30:35,164 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2022-02-21 04:30:35,207 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9d04c1e5/04d401edaccc443093fecd33ecf16421/FLAGef5ce4519 [2022-02-21 04:30:35,584 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:30:35,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2022-02-21 04:30:35,596 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9d04c1e5/04d401edaccc443093fecd33ecf16421/FLAGef5ce4519 [2022-02-21 04:30:35,605 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9d04c1e5/04d401edaccc443093fecd33ecf16421 [2022-02-21 04:30:35,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:30:35,608 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:30:35,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:30:35,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:30:35,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:30:35,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:30:35" (1/1) ... [2022-02-21 04:30:35,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b282bed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:35, skipping insertion in model container [2022-02-21 04:30:35,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:30:35" (1/1) ... [2022-02-21 04:30:35,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:30:35,660 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:30:35,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c[26490,26503] [2022-02-21 04:30:35,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:30:35,873 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:30:35,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c[26490,26503] [2022-02-21 04:30:35,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:30:35,945 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:30:35,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:35 WrapperNode [2022-02-21 04:30:35,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:30:35,946 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:30:35,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:30:35,946 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:30:35,953 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:35" (1/1) ... [2022-02-21 04:30:35,980 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:35" (1/1) ... [2022-02-21 04:30:36,017 INFO L137 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 498 [2022-02-21 04:30:36,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:30:36,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:30:36,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:30:36,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:30:36,033 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:35" (1/1) ... [2022-02-21 04:30:36,034 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:35" (1/1) ... [2022-02-21 04:30:36,037 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:35" (1/1) ... [2022-02-21 04:30:36,037 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:35" (1/1) ... [2022-02-21 04:30:36,045 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:35" (1/1) ... [2022-02-21 04:30:36,056 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:35" (1/1) ... [2022-02-21 04:30:36,058 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:35" (1/1) ... [2022-02-21 04:30:36,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:30:36,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:30:36,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:30:36,067 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:30:36,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:35" (1/1) ... [2022-02-21 04:30:36,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:36,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:36,093 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:36,111 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:36,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:30:36,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:30:36,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:30:36,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:30:36,302 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:30:36,303 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:30:36,771 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:30:36,779 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:30:36,780 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:30:36,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:30:36 BoogieIcfgContainer [2022-02-21 04:30:36,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:30:36,782 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:30:36,782 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:30:36,793 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:30:36,793 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:30:36,793 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:30:35" (1/3) ... [2022-02-21 04:30:36,794 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ada961c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:30:36, skipping insertion in model container [2022-02-21 04:30:36,794 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:30:36,794 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:35" (2/3) ... [2022-02-21 04:30:36,795 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ada961c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:30:36, skipping insertion in model container [2022-02-21 04:30:36,795 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:30:36,795 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:30:36" (3/3) ... [2022-02-21 04:30:36,796 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2022-02-21 04:30:36,829 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:30:36,830 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:30:36,830 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:30:36,830 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:30:36,830 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:30:36,830 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:30:36,830 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:30:36,830 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:30:36,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 146 states, 145 states have (on average 1.7586206896551724) internal successors, (255), 145 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:36,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2022-02-21 04:30:36,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:36,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:36,896 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:36,896 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:36,896 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:30:36,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 146 states, 145 states have (on average 1.7586206896551724) internal successors, (255), 145 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:36,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2022-02-21 04:30:36,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:36,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:36,917 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:36,917 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:36,922 INFO L791 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 46#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_#t~post47#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 36#L297true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 35#L297-1true init_#res#1 := init_~tmp~0#1; 8#L542true main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 47#L22true assume !(0 == assume_abort_if_not_~cond#1); 113#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; 133#L632-2true [2022-02-21 04:30:36,923 INFO L793 eck$LassoCheckResult]: Loop: 133#L632-2true assume !!(main_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 126#L92true assume !(0 != ~mode1~0 % 256); 18#L108true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 108#L108-2true ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 71#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; 51#L120true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 19#L123true assume !(node2_~m2~0#1 != ~nomsg~0); 37#L123-1true ~mode2~0 := 0; 30#L120-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 66#L145true assume !(0 != ~mode3~0 % 256); 15#L158true assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; 12#L158-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; 60#L145-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 80#L170true assume !(0 != ~mode4~0 % 256); 27#L183true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 43#L183-2true ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 54#L170-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 120#L195true assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 84#L198true assume !(node5_~m5~0#1 != ~nomsg~0); 106#L198-1true ~mode5~0 := 0; 87#L195-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 73#L220true assume !(0 != ~mode6~0 % 256); 74#L233true assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 68#L233-2true ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 55#L220-2true assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 26#L245true assume !(0 != ~mode7~0 % 256); 34#L258true assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 86#L258-2true ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 89#L245-2true assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 9#L270true assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 69#L273true assume !(node8_~m8~0#1 != ~nomsg~0); 67#L273-1true ~mode8~0 := 0; 75#L270-2true assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 146#L550true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; 52#L550-1true check_#res#1 := check_~tmp~1#1; 45#L570true main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 132#L671true assume !(0 == assert_~arg#1 % 256); 13#L666true assume { :end_inline_assert } true;main_#t~post47#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post47#1;havoc main_#t~post47#1; 133#L632-2true [2022-02-21 04:30:36,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:36,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2144605008, now seen corresponding path program 1 times [2022-02-21 04:30:36,938 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:36,938 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910576461] [2022-02-21 04:30:36,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:36,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:37,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; {150#true} is VALID [2022-02-21 04:30:37,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#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_#t~post47#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {150#true} is VALID [2022-02-21 04:30:37,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {152#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-21 04:30:37,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {152#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {153#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:30:37,157 INFO L290 TraceCheckUtils]: 4: Hoare triple {153#(= |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; {154#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:30:37,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {151#false} is VALID [2022-02-21 04:30:37,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {151#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; {151#false} is VALID [2022-02-21 04:30:37,159 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:37,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:37,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910576461] [2022-02-21 04:30:37,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910576461] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:37,161 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:37,161 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:30:37,162 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594290260] [2022-02-21 04:30:37,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:37,166 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:30:37,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:37,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1938223829, now seen corresponding path program 1 times [2022-02-21 04:30:37,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:37,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436890637] [2022-02-21 04:30:37,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:37,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:37,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {155#true} assume !!(main_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {155#true} is VALID [2022-02-21 04:30:37,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#true} assume !(0 != ~mode1~0 % 256); {155#true} is VALID [2022-02-21 04:30:37,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {155#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {155#true} is VALID [2022-02-21 04:30:37,359 INFO L290 TraceCheckUtils]: 3: Hoare triple {155#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; {155#true} is VALID [2022-02-21 04:30:37,359 INFO L290 TraceCheckUtils]: 4: Hoare triple {155#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; {155#true} is VALID [2022-02-21 04:30:37,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {155#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {155#true} is VALID [2022-02-21 04:30:37,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {155#true} assume !(node2_~m2~0#1 != ~nomsg~0); {155#true} is VALID [2022-02-21 04:30:37,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {155#true} ~mode2~0 := 0; {155#true} is VALID [2022-02-21 04:30:37,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {155#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; {155#true} is VALID [2022-02-21 04:30:37,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {155#true} assume !(0 != ~mode3~0 % 256); {155#true} is VALID [2022-02-21 04:30:37,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#true} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {155#true} is VALID [2022-02-21 04:30:37,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {155#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; {155#true} is VALID [2022-02-21 04:30:37,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {155#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; {155#true} is VALID [2022-02-21 04:30:37,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {155#true} assume !(0 != ~mode4~0 % 256); {155#true} is VALID [2022-02-21 04:30:37,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {155#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {155#true} is VALID [2022-02-21 04:30:37,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {155#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; {155#true} is VALID [2022-02-21 04:30:37,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {155#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; {155#true} is VALID [2022-02-21 04:30:37,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {155#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {155#true} is VALID [2022-02-21 04:30:37,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {155#true} assume !(node5_~m5~0#1 != ~nomsg~0); {155#true} is VALID [2022-02-21 04:30:37,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {155#true} ~mode5~0 := 0; {155#true} is VALID [2022-02-21 04:30:37,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {155#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; {155#true} is VALID [2022-02-21 04:30:37,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {155#true} assume !(0 != ~mode6~0 % 256); {155#true} is VALID [2022-02-21 04:30:37,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {155#true} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {155#true} is VALID [2022-02-21 04:30:37,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {155#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; {155#true} is VALID [2022-02-21 04:30:37,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {155#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; {155#true} is VALID [2022-02-21 04:30:37,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {155#true} assume !(0 != ~mode7~0 % 256); {155#true} is VALID [2022-02-21 04:30:37,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {155#true} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {155#true} is VALID [2022-02-21 04:30:37,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {155#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; {155#true} is VALID [2022-02-21 04:30:37,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {155#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; {155#true} is VALID [2022-02-21 04:30:37,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {155#true} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {155#true} is VALID [2022-02-21 04:30:37,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {155#true} assume !(node8_~m8~0#1 != ~nomsg~0); {155#true} is VALID [2022-02-21 04:30:37,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {155#true} ~mode8~0 := 0; {155#true} is VALID [2022-02-21 04:30:37,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {155#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; {155#true} is VALID [2022-02-21 04:30:37,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {155#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {157#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:30:37,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {157#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {158#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:30:37,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {158#(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; {159#(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:37,364 INFO L290 TraceCheckUtils]: 36: Hoare triple {159#(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); {156#false} is VALID [2022-02-21 04:30:37,364 INFO L290 TraceCheckUtils]: 37: Hoare triple {156#false} assume { :end_inline_assert } true;main_#t~post47#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post47#1;havoc main_#t~post47#1; {156#false} is VALID [2022-02-21 04:30:37,365 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:37,365 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:37,365 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436890637] [2022-02-21 04:30:37,365 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436890637] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:37,365 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:37,365 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:30:37,365 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707531280] [2022-02-21 04:30:37,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:37,366 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:37,367 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:37,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:30:37,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:30:37,385 INFO L87 Difference]: Start difference. First operand has 146 states, 145 states have (on average 1.7586206896551724) internal successors, (255), 145 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:37,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:37,838 INFO L93 Difference]: Finished difference Result 149 states and 254 transitions. [2022-02-21 04:30:37,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:30:37,839 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:37,845 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:37,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 254 transitions. [2022-02-21 04:30:37,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2022-02-21 04:30:37,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 141 states and 186 transitions. [2022-02-21 04:30:37,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2022-02-21 04:30:37,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2022-02-21 04:30:37,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 186 transitions. [2022-02-21 04:30:37,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:37,869 INFO L681 BuchiCegarLoop]: Abstraction has 141 states and 186 transitions. [2022-02-21 04:30:37,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 186 transitions. [2022-02-21 04:30:37,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-02-21 04:30:37,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:37,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states and 186 transitions. Second operand has 141 states, 141 states have (on average 1.3191489361702127) internal successors, (186), 140 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:37,898 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states and 186 transitions. Second operand has 141 states, 141 states have (on average 1.3191489361702127) internal successors, (186), 140 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:37,899 INFO L87 Difference]: Start difference. First operand 141 states and 186 transitions. Second operand has 141 states, 141 states have (on average 1.3191489361702127) internal successors, (186), 140 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:37,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:37,903 INFO L93 Difference]: Finished difference Result 141 states and 186 transitions. [2022-02-21 04:30:37,903 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 186 transitions. [2022-02-21 04:30:37,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:37,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:37,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 141 states have (on average 1.3191489361702127) internal successors, (186), 140 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 141 states and 186 transitions. [2022-02-21 04:30:37,905 INFO L87 Difference]: Start difference. First operand has 141 states, 141 states have (on average 1.3191489361702127) internal successors, (186), 140 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 141 states and 186 transitions. [2022-02-21 04:30:37,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:37,908 INFO L93 Difference]: Finished difference Result 141 states and 186 transitions. [2022-02-21 04:30:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 186 transitions. [2022-02-21 04:30:37,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:37,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:37,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:37,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:37,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 141 states have (on average 1.3191489361702127) internal successors, (186), 140 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 186 transitions. [2022-02-21 04:30:37,913 INFO L704 BuchiCegarLoop]: Abstraction has 141 states and 186 transitions. [2022-02-21 04:30:37,913 INFO L587 BuchiCegarLoop]: Abstraction has 141 states and 186 transitions. [2022-02-21 04:30:37,913 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:30:37,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 186 transitions. [2022-02-21 04:30:37,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2022-02-21 04:30:37,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:37,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:37,915 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:37,916 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:37,916 INFO L791 eck$LassoCheckResult]: Stem: 452#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 385#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_#t~post47#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 373#L297 assume 0 == ~r1~0; 362#L298 assume ~id1~0 >= 0; 363#L299 assume 0 == ~st1~0; 382#L300 assume ~send1~0 == ~id1~0; 425#L301 assume 0 == ~mode1~0 % 256; 438#L302 assume ~id2~0 >= 0; 439#L303 assume 0 == ~st2~0; 445#L304 assume ~send2~0 == ~id2~0; 415#L305 assume 0 == ~mode2~0 % 256; 416#L306 assume ~id3~0 >= 0; 434#L307 assume 0 == ~st3~0; 329#L308 assume ~send3~0 == ~id3~0; 330#L309 assume 0 == ~mode3~0 % 256; 429#L310 assume ~id4~0 >= 0; 396#L311 assume 0 == ~st4~0; 397#L312 assume ~send4~0 == ~id4~0; 348#L313 assume 0 == ~mode4~0 % 256; 349#L314 assume ~id5~0 >= 0; 389#L315 assume 0 == ~st5~0; 390#L316 assume ~send5~0 == ~id5~0; 317#L317 assume 0 == ~mode5~0 % 256; 318#L318 assume ~id6~0 >= 0; 453#L319 assume 0 == ~st6~0; 437#L320 assume ~send6~0 == ~id6~0; 422#L321 assume 0 == ~mode6~0 % 256; 423#L322 assume ~id7~0 >= 0; 313#L323 assume 0 == ~st7~0; 314#L324 assume ~send7~0 == ~id7~0; 338#L325 assume 0 == ~mode7~0 % 256; 356#L326 assume ~id8~0 >= 0; 339#L327 assume 0 == ~st8~0; 340#L328 assume ~send8~0 == ~id8~0; 375#L329 assume 0 == ~mode8~0 % 256; 376#L330 assume ~id1~0 != ~id2~0; 327#L331 assume ~id1~0 != ~id3~0; 328#L332 assume ~id1~0 != ~id4~0; 352#L333 assume ~id1~0 != ~id5~0; 374#L334 assume ~id1~0 != ~id6~0; 346#L335 assume ~id1~0 != ~id7~0; 347#L336 assume ~id1~0 != ~id8~0; 433#L337 assume ~id2~0 != ~id3~0; 401#L338 assume ~id2~0 != ~id4~0; 402#L339 assume ~id2~0 != ~id5~0; 446#L340 assume ~id2~0 != ~id6~0; 443#L341 assume ~id2~0 != ~id7~0; 377#L342 assume ~id2~0 != ~id8~0; 378#L343 assume ~id3~0 != ~id4~0; 364#L344 assume ~id3~0 != ~id5~0; 365#L345 assume ~id3~0 != ~id6~0; 391#L346 assume ~id3~0 != ~id7~0; 392#L347 assume ~id3~0 != ~id8~0; 451#L348 assume ~id4~0 != ~id5~0; 440#L349 assume ~id4~0 != ~id6~0; 441#L350 assume ~id4~0 != ~id7~0; 426#L351 assume ~id4~0 != ~id8~0; 427#L352 assume ~id5~0 != ~id6~0; 444#L353 assume ~id5~0 != ~id7~0; 411#L354 assume ~id5~0 != ~id8~0; 379#L355 assume ~id6~0 != ~id7~0; 380#L356 assume ~id6~0 != ~id8~0; 408#L357 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 372#L297-1 init_#res#1 := init_~tmp~0#1; 322#L542 main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 323#L22 assume !(0 == assume_abort_if_not_~cond#1); 386#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 334#L632-2 [2022-02-21 04:30:37,917 INFO L793 eck$LassoCheckResult]: Loop: 334#L632-2 assume !!(main_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 449#L92 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 450#L96 assume !(node1_~m1~0#1 != ~nomsg~0); 410#L96-1 ~mode1~0 := 0; 417#L92-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 393#L120 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 343#L123 assume !(node2_~m2~0#1 != ~nomsg~0); 344#L123-1 ~mode2~0 := 0; 351#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 366#L145 assume !(0 != ~mode3~0 % 256); 337#L158 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; 331#L158-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 332#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 403#L170 assume !(0 != ~mode4~0 % 256); 357#L183 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 358#L183-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 381#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 395#L195 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 428#L198 assume !(node5_~m5~0#1 != ~nomsg~0); 399#L198-1 ~mode5~0 := 0; 431#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 418#L220 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 419#L223 assume !(node6_~m6~0#1 != ~nomsg~0); 315#L223-1 ~mode6~0 := 0; 316#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 353#L245 assume !(0 != ~mode7~0 % 256); 354#L258 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 371#L258-2 ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 430#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 324#L270 assume !(0 != ~mode8~0 % 256); 325#L283 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 335#L283-2 ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 336#L270-2 assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 421#L550 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; 388#L550-1 check_#res#1 := check_~tmp~1#1; 383#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 384#L671 assume !(0 == assert_~arg#1 % 256); 333#L666 assume { :end_inline_assert } true;main_#t~post47#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post47#1;havoc main_#t~post47#1; 334#L632-2 [2022-02-21 04:30:37,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:37,918 INFO L85 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 1 times [2022-02-21 04:30:37,918 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:37,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100040060] [2022-02-21 04:30:37,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:37,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:37,979 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:38,073 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:38,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:38,074 INFO L85 PathProgramCache]: Analyzing trace with hash -961480097, now seen corresponding path program 1 times [2022-02-21 04:30:38,074 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:38,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452933766] [2022-02-21 04:30:38,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:38,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:38,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {741#true} assume !!(main_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {741#true} is VALID [2022-02-21 04:30:38,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {741#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {741#true} is VALID [2022-02-21 04:30:38,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {741#true} assume !(node1_~m1~0#1 != ~nomsg~0); {741#true} is VALID [2022-02-21 04:30:38,196 INFO L290 TraceCheckUtils]: 3: Hoare triple {741#true} ~mode1~0 := 0; {741#true} is VALID [2022-02-21 04:30:38,196 INFO L290 TraceCheckUtils]: 4: Hoare triple {741#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; {741#true} is VALID [2022-02-21 04:30:38,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {741#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {741#true} is VALID [2022-02-21 04:30:38,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {741#true} assume !(node2_~m2~0#1 != ~nomsg~0); {741#true} is VALID [2022-02-21 04:30:38,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {741#true} ~mode2~0 := 0; {741#true} is VALID [2022-02-21 04:30:38,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {741#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; {741#true} is VALID [2022-02-21 04:30:38,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {741#true} assume !(0 != ~mode3~0 % 256); {741#true} is VALID [2022-02-21 04:30:38,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {741#true} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {741#true} is VALID [2022-02-21 04:30:38,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {741#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; {741#true} is VALID [2022-02-21 04:30:38,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {741#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; {741#true} is VALID [2022-02-21 04:30:38,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {741#true} assume !(0 != ~mode4~0 % 256); {741#true} is VALID [2022-02-21 04:30:38,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {741#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {741#true} is VALID [2022-02-21 04:30:38,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {741#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; {741#true} is VALID [2022-02-21 04:30:38,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {741#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; {741#true} is VALID [2022-02-21 04:30:38,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {741#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {741#true} is VALID [2022-02-21 04:30:38,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {741#true} assume !(node5_~m5~0#1 != ~nomsg~0); {741#true} is VALID [2022-02-21 04:30:38,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {741#true} ~mode5~0 := 0; {741#true} is VALID [2022-02-21 04:30:38,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {741#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; {741#true} is VALID [2022-02-21 04:30:38,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {741#true} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {741#true} is VALID [2022-02-21 04:30:38,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {741#true} assume !(node6_~m6~0#1 != ~nomsg~0); {741#true} is VALID [2022-02-21 04:30:38,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {741#true} ~mode6~0 := 0; {741#true} is VALID [2022-02-21 04:30:38,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {741#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; {741#true} is VALID [2022-02-21 04:30:38,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {741#true} assume !(0 != ~mode7~0 % 256); {741#true} is VALID [2022-02-21 04:30:38,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {741#true} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {741#true} is VALID [2022-02-21 04:30:38,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {741#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; {741#true} is VALID [2022-02-21 04:30:38,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {741#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; {741#true} is VALID [2022-02-21 04:30:38,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {741#true} assume !(0 != ~mode8~0 % 256); {741#true} is VALID [2022-02-21 04:30:38,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {741#true} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {741#true} is VALID [2022-02-21 04:30:38,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {741#true} ~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; {741#true} is VALID [2022-02-21 04:30:38,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {741#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; {741#true} is VALID [2022-02-21 04:30:38,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {741#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {743#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:30:38,201 INFO L290 TraceCheckUtils]: 34: Hoare triple {743#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {744#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:30:38,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {744#(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; {745#(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:38,203 INFO L290 TraceCheckUtils]: 36: Hoare triple {745#(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); {742#false} is VALID [2022-02-21 04:30:38,203 INFO L290 TraceCheckUtils]: 37: Hoare triple {742#false} assume { :end_inline_assert } true;main_#t~post47#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post47#1;havoc main_#t~post47#1; {742#false} is VALID [2022-02-21 04:30:38,203 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:38,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:38,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452933766] [2022-02-21 04:30:38,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452933766] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:38,204 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:38,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:30:38,205 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400400481] [2022-02-21 04:30:38,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:38,205 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:38,205 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:38,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:30:38,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:30:38,207 INFO L87 Difference]: Start difference. First operand 141 states and 186 transitions. cyclomatic complexity: 46 Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:38,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:38,525 INFO L93 Difference]: Finished difference Result 144 states and 188 transitions. [2022-02-21 04:30:38,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:30:38,525 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:38,552 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:38,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 188 transitions. [2022-02-21 04:30:38,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2022-02-21 04:30:38,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 141 states and 183 transitions. [2022-02-21 04:30:38,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2022-02-21 04:30:38,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2022-02-21 04:30:38,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 183 transitions. [2022-02-21 04:30:38,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:38,559 INFO L681 BuchiCegarLoop]: Abstraction has 141 states and 183 transitions. [2022-02-21 04:30:38,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 183 transitions. [2022-02-21 04:30:38,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-02-21 04:30:38,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:38,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states and 183 transitions. Second operand has 141 states, 141 states have (on average 1.297872340425532) internal successors, (183), 140 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:38,563 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states and 183 transitions. Second operand has 141 states, 141 states have (on average 1.297872340425532) internal successors, (183), 140 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:38,571 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. Second operand has 141 states, 141 states have (on average 1.297872340425532) internal successors, (183), 140 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:38,574 INFO L93 Difference]: Finished difference Result 141 states and 183 transitions. [2022-02-21 04:30:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2022-02-21 04:30:38,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:38,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:38,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 141 states have (on average 1.297872340425532) internal successors, (183), 140 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 141 states and 183 transitions. [2022-02-21 04:30:38,578 INFO L87 Difference]: Start difference. First operand has 141 states, 141 states have (on average 1.297872340425532) internal successors, (183), 140 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 141 states and 183 transitions. [2022-02-21 04:30:38,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:38,580 INFO L93 Difference]: Finished difference Result 141 states and 183 transitions. [2022-02-21 04:30:38,580 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2022-02-21 04:30:38,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:38,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:38,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:38,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 141 states have (on average 1.297872340425532) internal successors, (183), 140 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:38,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2022-02-21 04:30:38,584 INFO L704 BuchiCegarLoop]: Abstraction has 141 states and 183 transitions. [2022-02-21 04:30:38,584 INFO L587 BuchiCegarLoop]: Abstraction has 141 states and 183 transitions. [2022-02-21 04:30:38,584 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:30:38,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 183 transitions. [2022-02-21 04:30:38,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2022-02-21 04:30:38,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:38,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:38,589 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:38,589 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:38,589 INFO L791 eck$LassoCheckResult]: Stem: 1033#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 966#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_#t~post47#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 955#L297 assume 0 == ~r1~0; 946#L298 assume ~id1~0 >= 0; 947#L299 assume 0 == ~st1~0; 963#L300 assume ~send1~0 == ~id1~0; 1006#L301 assume 0 == ~mode1~0 % 256; 1019#L302 assume ~id2~0 >= 0; 1020#L303 assume 0 == ~st2~0; 1026#L304 assume ~send2~0 == ~id2~0; 997#L305 assume 0 == ~mode2~0 % 256; 998#L306 assume ~id3~0 >= 0; 1015#L307 assume 0 == ~st3~0; 910#L308 assume ~send3~0 == ~id3~0; 911#L309 assume 0 == ~mode3~0 % 256; 1010#L310 assume ~id4~0 >= 0; 977#L311 assume 0 == ~st4~0; 978#L312 assume ~send4~0 == ~id4~0; 929#L313 assume 0 == ~mode4~0 % 256; 930#L314 assume ~id5~0 >= 0; 970#L315 assume 0 == ~st5~0; 971#L316 assume ~send5~0 == ~id5~0; 896#L317 assume 0 == ~mode5~0 % 256; 897#L318 assume ~id6~0 >= 0; 1034#L319 assume 0 == ~st6~0; 1018#L320 assume ~send6~0 == ~id6~0; 1003#L321 assume 0 == ~mode6~0 % 256; 1004#L322 assume ~id7~0 >= 0; 894#L323 assume 0 == ~st7~0; 895#L324 assume ~send7~0 == ~id7~0; 919#L325 assume 0 == ~mode7~0 % 256; 934#L326 assume ~id8~0 >= 0; 920#L327 assume 0 == ~st8~0; 921#L328 assume ~send8~0 == ~id8~0; 956#L329 assume 0 == ~mode8~0 % 256; 957#L330 assume ~id1~0 != ~id2~0; 908#L331 assume ~id1~0 != ~id3~0; 909#L332 assume ~id1~0 != ~id4~0; 933#L333 assume ~id1~0 != ~id5~0; 954#L334 assume ~id1~0 != ~id6~0; 927#L335 assume ~id1~0 != ~id7~0; 928#L336 assume ~id1~0 != ~id8~0; 1014#L337 assume ~id2~0 != ~id3~0; 982#L338 assume ~id2~0 != ~id4~0; 983#L339 assume ~id2~0 != ~id5~0; 1027#L340 assume ~id2~0 != ~id6~0; 1024#L341 assume ~id2~0 != ~id7~0; 958#L342 assume ~id2~0 != ~id8~0; 959#L343 assume ~id3~0 != ~id4~0; 943#L344 assume ~id3~0 != ~id5~0; 944#L345 assume ~id3~0 != ~id6~0; 972#L346 assume ~id3~0 != ~id7~0; 973#L347 assume ~id3~0 != ~id8~0; 1032#L348 assume ~id4~0 != ~id5~0; 1021#L349 assume ~id4~0 != ~id6~0; 1022#L350 assume ~id4~0 != ~id7~0; 1007#L351 assume ~id4~0 != ~id8~0; 1008#L352 assume ~id5~0 != ~id6~0; 1025#L353 assume ~id5~0 != ~id7~0; 992#L354 assume ~id5~0 != ~id8~0; 960#L355 assume ~id6~0 != ~id7~0; 961#L356 assume ~id6~0 != ~id8~0; 987#L357 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 953#L297-1 init_#res#1 := init_~tmp~0#1; 903#L542 main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 904#L22 assume !(0 == assume_abort_if_not_~cond#1); 967#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; 915#L632-2 [2022-02-21 04:30:38,590 INFO L793 eck$LassoCheckResult]: Loop: 915#L632-2 assume !!(main_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 1030#L92 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 1031#L96 assume !(node1_~m1~0#1 != ~nomsg~0); 991#L96-1 ~mode1~0 := 0; 996#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; 974#L120 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 924#L123 assume !(node2_~m2~0#1 != ~nomsg~0); 925#L123-1 ~mode2~0 := 0; 932#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 945#L145 assume !(0 != ~mode3~0 % 256); 918#L158 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; 912#L158-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 913#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 984#L170 assume !(0 != ~mode4~0 % 256); 938#L183 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 939#L183-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 962#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 976#L195 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1009#L198 assume !(node5_~m5~0#1 != ~nomsg~0); 980#L198-1 ~mode5~0 := 0; 1012#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 999#L220 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 1000#L223 assume !(node6_~m6~0#1 != ~nomsg~0); 898#L223-1 ~mode6~0 := 0; 899#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 935#L245 assume !(0 != ~mode7~0 % 256); 936#L258 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 952#L258-2 ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 1011#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 905#L270 assume !(0 != ~mode8~0 % 256); 906#L283 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 916#L283-2 ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 917#L270-2 assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1002#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 949#L551 assume ~r1~0 >= 8; 950#L555 assume ~r1~0 < 8;check_~tmp~1#1 := 1; 969#L550-1 check_#res#1 := check_~tmp~1#1; 964#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 965#L671 assume !(0 == assert_~arg#1 % 256); 914#L666 assume { :end_inline_assert } true;main_#t~post47#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post47#1;havoc main_#t~post47#1; 915#L632-2 [2022-02-21 04:30:38,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:38,591 INFO L85 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 2 times [2022-02-21 04:30:38,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:38,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245063408] [2022-02-21 04:30:38,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:38,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:38,638 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:38,685 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:38,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:38,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1980214289, now seen corresponding path program 1 times [2022-02-21 04:30:38,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:38,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257302049] [2022-02-21 04:30:38,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:38,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:38,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {1322#true} assume !!(main_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1322#true} is VALID [2022-02-21 04:30:38,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {1322#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {1322#true} is VALID [2022-02-21 04:30:38,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {1322#true} assume !(node1_~m1~0#1 != ~nomsg~0); {1322#true} is VALID [2022-02-21 04:30:38,723 INFO L290 TraceCheckUtils]: 3: Hoare triple {1322#true} ~mode1~0 := 0; {1322#true} is VALID [2022-02-21 04:30:38,724 INFO L290 TraceCheckUtils]: 4: Hoare triple {1322#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; {1322#true} is VALID [2022-02-21 04:30:38,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {1322#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1322#true} is VALID [2022-02-21 04:30:38,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {1322#true} assume !(node2_~m2~0#1 != ~nomsg~0); {1322#true} is VALID [2022-02-21 04:30:38,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {1322#true} ~mode2~0 := 0; {1322#true} is VALID [2022-02-21 04:30:38,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {1322#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; {1322#true} is VALID [2022-02-21 04:30:38,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {1322#true} assume !(0 != ~mode3~0 % 256); {1322#true} is VALID [2022-02-21 04:30:38,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {1322#true} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {1322#true} is VALID [2022-02-21 04:30:38,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {1322#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; {1322#true} is VALID [2022-02-21 04:30:38,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {1322#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; {1322#true} is VALID [2022-02-21 04:30:38,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {1322#true} assume !(0 != ~mode4~0 % 256); {1322#true} is VALID [2022-02-21 04:30:38,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {1322#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {1322#true} is VALID [2022-02-21 04:30:38,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {1322#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; {1322#true} is VALID [2022-02-21 04:30:38,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {1322#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; {1322#true} is VALID [2022-02-21 04:30:38,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {1322#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1322#true} is VALID [2022-02-21 04:30:38,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {1322#true} assume !(node5_~m5~0#1 != ~nomsg~0); {1322#true} is VALID [2022-02-21 04:30:38,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {1322#true} ~mode5~0 := 0; {1322#true} is VALID [2022-02-21 04:30:38,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {1322#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; {1322#true} is VALID [2022-02-21 04:30:38,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {1322#true} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1322#true} is VALID [2022-02-21 04:30:38,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {1322#true} assume !(node6_~m6~0#1 != ~nomsg~0); {1322#true} is VALID [2022-02-21 04:30:38,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {1322#true} ~mode6~0 := 0; {1322#true} is VALID [2022-02-21 04:30:38,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {1322#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; {1322#true} is VALID [2022-02-21 04:30:38,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {1322#true} assume !(0 != ~mode7~0 % 256); {1322#true} is VALID [2022-02-21 04:30:38,727 INFO L290 TraceCheckUtils]: 26: Hoare triple {1322#true} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {1322#true} is VALID [2022-02-21 04:30:38,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {1322#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; {1322#true} is VALID [2022-02-21 04:30:38,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {1322#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; {1322#true} is VALID [2022-02-21 04:30:38,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {1322#true} assume !(0 != ~mode8~0 % 256); {1322#true} is VALID [2022-02-21 04:30:38,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {1322#true} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {1322#true} is VALID [2022-02-21 04:30:38,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {1322#true} ~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; {1322#true} is VALID [2022-02-21 04:30:38,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {1322#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; {1322#true} is VALID [2022-02-21 04:30:38,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {1322#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {1322#true} is VALID [2022-02-21 04:30:38,729 INFO L290 TraceCheckUtils]: 34: Hoare triple {1322#true} assume ~r1~0 >= 8; {1324#(not (<= ~r1~0 7))} is VALID [2022-02-21 04:30:38,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {1324#(not (<= ~r1~0 7))} assume ~r1~0 < 8;check_~tmp~1#1 := 1; {1323#false} is VALID [2022-02-21 04:30:38,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {1323#false} check_#res#1 := check_~tmp~1#1; {1323#false} is VALID [2022-02-21 04:30:38,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {1323#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; {1323#false} is VALID [2022-02-21 04:30:38,730 INFO L290 TraceCheckUtils]: 38: Hoare triple {1323#false} assume !(0 == assert_~arg#1 % 256); {1323#false} is VALID [2022-02-21 04:30:38,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {1323#false} assume { :end_inline_assert } true;main_#t~post47#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post47#1;havoc main_#t~post47#1; {1323#false} is VALID [2022-02-21 04:30:38,730 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:38,730 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:38,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257302049] [2022-02-21 04:30:38,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257302049] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:38,731 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:38,731 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:30:38,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563307630] [2022-02-21 04:30:38,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:38,731 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:38,731 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:38,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:30:38,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:30:38,732 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. cyclomatic complexity: 43 Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:38,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:38,913 INFO L93 Difference]: Finished difference Result 209 states and 288 transitions. [2022-02-21 04:30:38,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:30:38,914 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:38,939 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:38,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 288 transitions. [2022-02-21 04:30:38,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 142 [2022-02-21 04:30:38,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 209 states and 288 transitions. [2022-02-21 04:30:38,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 209 [2022-02-21 04:30:38,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2022-02-21 04:30:38,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 209 states and 288 transitions. [2022-02-21 04:30:38,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:38,949 INFO L681 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2022-02-21 04:30:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 288 transitions. [2022-02-21 04:30:38,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2022-02-21 04:30:38,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:38,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states and 288 transitions. Second operand has 209 states, 209 states have (on average 1.3779904306220097) internal successors, (288), 208 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:38,955 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states and 288 transitions. Second operand has 209 states, 209 states have (on average 1.3779904306220097) internal successors, (288), 208 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:38,956 INFO L87 Difference]: Start difference. First operand 209 states and 288 transitions. Second operand has 209 states, 209 states have (on average 1.3779904306220097) internal successors, (288), 208 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:38,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:38,960 INFO L93 Difference]: Finished difference Result 209 states and 288 transitions. [2022-02-21 04:30:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 288 transitions. [2022-02-21 04:30:38,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:38,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:38,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 209 states, 209 states have (on average 1.3779904306220097) internal successors, (288), 208 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 209 states and 288 transitions. [2022-02-21 04:30:38,961 INFO L87 Difference]: Start difference. First operand has 209 states, 209 states have (on average 1.3779904306220097) internal successors, (288), 208 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 209 states and 288 transitions. [2022-02-21 04:30:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:38,965 INFO L93 Difference]: Finished difference Result 209 states and 288 transitions. [2022-02-21 04:30:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 288 transitions. [2022-02-21 04:30:38,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:38,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:38,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:38,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 209 states have (on average 1.3779904306220097) internal successors, (288), 208 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:38,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 288 transitions. [2022-02-21 04:30:38,969 INFO L704 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2022-02-21 04:30:38,970 INFO L587 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2022-02-21 04:30:38,970 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:30:38,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 209 states and 288 transitions. [2022-02-21 04:30:38,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 142 [2022-02-21 04:30:38,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:38,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:38,971 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:38,972 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:38,972 INFO L791 eck$LassoCheckResult]: Stem: 1677#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 1605#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_#t~post47#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 1593#L297 assume 0 == ~r1~0; 1583#L298 assume ~id1~0 >= 0; 1584#L299 assume 0 == ~st1~0; 1601#L300 assume ~send1~0 == ~id1~0; 1646#L301 assume 0 == ~mode1~0 % 256; 1661#L302 assume ~id2~0 >= 0; 1662#L303 assume 0 == ~st2~0; 1669#L304 assume ~send2~0 == ~id2~0; 1636#L305 assume 0 == ~mode2~0 % 256; 1637#L306 assume ~id3~0 >= 0; 1657#L307 assume 0 == ~st3~0; 1550#L308 assume ~send3~0 == ~id3~0; 1551#L309 assume 0 == ~mode3~0 % 256; 1651#L310 assume ~id4~0 >= 0; 1616#L311 assume 0 == ~st4~0; 1617#L312 assume ~send4~0 == ~id4~0; 1569#L313 assume 0 == ~mode4~0 % 256; 1570#L314 assume ~id5~0 >= 0; 1607#L315 assume 0 == ~st5~0; 1608#L316 assume ~send5~0 == ~id5~0; 1536#L317 assume 0 == ~mode5~0 % 256; 1537#L318 assume ~id6~0 >= 0; 1678#L319 assume 0 == ~st6~0; 1660#L320 assume ~send6~0 == ~id6~0; 1643#L321 assume 0 == ~mode6~0 % 256; 1644#L322 assume ~id7~0 >= 0; 1534#L323 assume 0 == ~st7~0; 1535#L324 assume ~send7~0 == ~id7~0; 1559#L325 assume 0 == ~mode7~0 % 256; 1574#L326 assume ~id8~0 >= 0; 1560#L327 assume 0 == ~st8~0; 1561#L328 assume ~send8~0 == ~id8~0; 1595#L329 assume 0 == ~mode8~0 % 256; 1596#L330 assume ~id1~0 != ~id2~0; 1548#L331 assume ~id1~0 != ~id3~0; 1549#L332 assume ~id1~0 != ~id4~0; 1573#L333 assume ~id1~0 != ~id5~0; 1594#L334 assume ~id1~0 != ~id6~0; 1567#L335 assume ~id1~0 != ~id7~0; 1568#L336 assume ~id1~0 != ~id8~0; 1656#L337 assume ~id2~0 != ~id3~0; 1622#L338 assume ~id2~0 != ~id4~0; 1623#L339 assume ~id2~0 != ~id5~0; 1670#L340 assume ~id2~0 != ~id6~0; 1666#L341 assume ~id2~0 != ~id7~0; 1597#L342 assume ~id2~0 != ~id8~0; 1598#L343 assume ~id3~0 != ~id4~0; 1585#L344 assume ~id3~0 != ~id5~0; 1586#L345 assume ~id3~0 != ~id6~0; 1611#L346 assume ~id3~0 != ~id7~0; 1612#L347 assume ~id3~0 != ~id8~0; 1675#L348 assume ~id4~0 != ~id5~0; 1663#L349 assume ~id4~0 != ~id6~0; 1664#L350 assume ~id4~0 != ~id7~0; 1647#L351 assume ~id4~0 != ~id8~0; 1648#L352 assume ~id5~0 != ~id6~0; 1667#L353 assume ~id5~0 != ~id7~0; 1632#L354 assume ~id5~0 != ~id8~0; 1599#L355 assume ~id6~0 != ~id7~0; 1600#L356 assume ~id6~0 != ~id8~0; 1627#L357 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 1592#L297-1 init_#res#1 := init_~tmp~0#1; 1543#L542 main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 1544#L22 assume !(0 == assume_abort_if_not_~cond#1); 1606#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; 1668#L632-2 [2022-02-21 04:30:38,972 INFO L793 eck$LassoCheckResult]: Loop: 1668#L632-2 assume !!(main_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 1740#L92 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 1674#L96 assume !(node1_~m1~0#1 != ~nomsg~0); 1631#L96-1 ~mode1~0 := 0; 1649#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; 1737#L120 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1734#L123 assume !(node2_~m2~0#1 != ~nomsg~0); 1732#L123-1 ~mode2~0 := 0; 1730#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 1729#L145 assume !(0 != ~mode3~0 % 256); 1728#L158 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; 1723#L158-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 1722#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 1721#L170 assume !(0 != ~mode4~0 % 256); 1717#L183 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 1715#L183-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 1714#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 1713#L195 assume !(0 != ~mode5~0 % 256); 1712#L208 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 1707#L208-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; 1706#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 1705#L220 assume !(0 != ~mode6~0 % 256); 1701#L233 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 1699#L233-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; 1698#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 1697#L245 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 1696#L248 assume !(node7_~m7~0#1 != ~nomsg~0); 1692#L248-1 ~mode7~0 := 0; 1690#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 1545#L270 assume !(0 != ~mode8~0 % 256); 1546#L283 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 1556#L283-2 ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 1557#L270-2 assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1642#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 1682#L551 assume !(~r1~0 >= 8); 1680#L554 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 1681#L555 assume ~r1~0 < 8;check_~tmp~1#1 := 1; 1615#L550-1 check_#res#1 := check_~tmp~1#1; 1603#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 1604#L671 assume !(0 == assert_~arg#1 % 256); 1676#L666 assume { :end_inline_assert } true;main_#t~post47#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post47#1;havoc main_#t~post47#1; 1668#L632-2 [2022-02-21 04:30:38,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:38,973 INFO L85 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 3 times [2022-02-21 04:30:38,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:38,973 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310039881] [2022-02-21 04:30:38,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:38,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:39,003 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:39,039 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:39,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:39,040 INFO L85 PathProgramCache]: Analyzing trace with hash 631361955, now seen corresponding path program 1 times [2022-02-21 04:30:39,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:39,040 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423861921] [2022-02-21 04:30:39,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:39,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:39,053 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:39,066 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:39,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:39,066 INFO L85 PathProgramCache]: Analyzing trace with hash -189150748, now seen corresponding path program 1 times [2022-02-21 04:30:39,067 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:39,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678472162] [2022-02-21 04:30:39,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:39,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:39,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {2168#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; {2168#true} is VALID [2022-02-21 04:30:39,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {2168#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_#t~post47#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {2168#true} is VALID [2022-02-21 04:30:39,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {2168#true} assume 0 == ~r1~0; {2168#true} is VALID [2022-02-21 04:30:39,166 INFO L290 TraceCheckUtils]: 3: Hoare triple {2168#true} assume ~id1~0 >= 0; {2168#true} is VALID [2022-02-21 04:30:39,166 INFO L290 TraceCheckUtils]: 4: Hoare triple {2168#true} assume 0 == ~st1~0; {2168#true} is VALID [2022-02-21 04:30:39,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {2168#true} assume ~send1~0 == ~id1~0; {2168#true} is VALID [2022-02-21 04:30:39,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {2168#true} assume 0 == ~mode1~0 % 256; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,175 INFO L290 TraceCheckUtils]: 27: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 >= 0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,175 INFO L290 TraceCheckUtils]: 28: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st7~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send7~0 == ~id7~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode7~0 % 256; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id8~0 >= 0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st8~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send8~0 == ~id8~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode8~0 % 256; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,177 INFO L290 TraceCheckUtils]: 35: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id7~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,180 INFO L290 TraceCheckUtils]: 41: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id8~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,180 INFO L290 TraceCheckUtils]: 42: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,188 INFO L290 TraceCheckUtils]: 44: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,189 INFO L290 TraceCheckUtils]: 45: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,189 INFO L290 TraceCheckUtils]: 46: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id7~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,190 INFO L290 TraceCheckUtils]: 47: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id8~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,191 INFO L290 TraceCheckUtils]: 50: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,192 INFO L290 TraceCheckUtils]: 51: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id7~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,192 INFO L290 TraceCheckUtils]: 52: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id8~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,193 INFO L290 TraceCheckUtils]: 53: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,194 INFO L290 TraceCheckUtils]: 54: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,194 INFO L290 TraceCheckUtils]: 55: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id7~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,195 INFO L290 TraceCheckUtils]: 56: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id8~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,195 INFO L290 TraceCheckUtils]: 57: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,196 INFO L290 TraceCheckUtils]: 58: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id7~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,198 INFO L290 TraceCheckUtils]: 59: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id8~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,198 INFO L290 TraceCheckUtils]: 60: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id7~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,198 INFO L290 TraceCheckUtils]: 61: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id8~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,199 INFO L290 TraceCheckUtils]: 62: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,199 INFO L290 TraceCheckUtils]: 63: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,200 INFO L290 TraceCheckUtils]: 66: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,201 INFO L290 TraceCheckUtils]: 67: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:39,201 INFO L290 TraceCheckUtils]: 68: Hoare triple {2170#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {2169#false} is VALID [2022-02-21 04:30:39,202 INFO L290 TraceCheckUtils]: 69: Hoare triple {2169#false} assume !(node1_~m1~0#1 != ~nomsg~0); {2169#false} is VALID [2022-02-21 04:30:39,202 INFO L290 TraceCheckUtils]: 70: Hoare triple {2169#false} ~mode1~0 := 0; {2169#false} is VALID [2022-02-21 04:30:39,202 INFO L290 TraceCheckUtils]: 71: Hoare triple {2169#false} 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; {2169#false} is VALID [2022-02-21 04:30:39,202 INFO L290 TraceCheckUtils]: 72: Hoare triple {2169#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2169#false} is VALID [2022-02-21 04:30:39,202 INFO L290 TraceCheckUtils]: 73: Hoare triple {2169#false} assume !(node2_~m2~0#1 != ~nomsg~0); {2169#false} is VALID [2022-02-21 04:30:39,203 INFO L290 TraceCheckUtils]: 74: Hoare triple {2169#false} ~mode2~0 := 0; {2169#false} is VALID [2022-02-21 04:30:39,203 INFO L290 TraceCheckUtils]: 75: Hoare triple {2169#false} 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; {2169#false} is VALID [2022-02-21 04:30:39,203 INFO L290 TraceCheckUtils]: 76: Hoare triple {2169#false} assume !(0 != ~mode3~0 % 256); {2169#false} is VALID [2022-02-21 04:30:39,203 INFO L290 TraceCheckUtils]: 77: Hoare triple {2169#false} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {2169#false} is VALID [2022-02-21 04:30:39,203 INFO L290 TraceCheckUtils]: 78: Hoare triple {2169#false} ~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; {2169#false} is VALID [2022-02-21 04:30:39,203 INFO L290 TraceCheckUtils]: 79: Hoare triple {2169#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; {2169#false} is VALID [2022-02-21 04:30:39,206 INFO L290 TraceCheckUtils]: 80: Hoare triple {2169#false} assume !(0 != ~mode4~0 % 256); {2169#false} is VALID [2022-02-21 04:30:39,206 INFO L290 TraceCheckUtils]: 81: Hoare triple {2169#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {2169#false} is VALID [2022-02-21 04:30:39,206 INFO L290 TraceCheckUtils]: 82: Hoare triple {2169#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; {2169#false} is VALID [2022-02-21 04:30:39,206 INFO L290 TraceCheckUtils]: 83: Hoare triple {2169#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; {2169#false} is VALID [2022-02-21 04:30:39,206 INFO L290 TraceCheckUtils]: 84: Hoare triple {2169#false} assume !(0 != ~mode5~0 % 256); {2169#false} is VALID [2022-02-21 04:30:39,206 INFO L290 TraceCheckUtils]: 85: Hoare triple {2169#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {2169#false} is VALID [2022-02-21 04:30:39,206 INFO L290 TraceCheckUtils]: 86: Hoare triple {2169#false} ~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; {2169#false} is VALID [2022-02-21 04:30:39,207 INFO L290 TraceCheckUtils]: 87: Hoare triple {2169#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; {2169#false} is VALID [2022-02-21 04:30:39,207 INFO L290 TraceCheckUtils]: 88: Hoare triple {2169#false} assume !(0 != ~mode6~0 % 256); {2169#false} is VALID [2022-02-21 04:30:39,207 INFO L290 TraceCheckUtils]: 89: Hoare triple {2169#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {2169#false} is VALID [2022-02-21 04:30:39,207 INFO L290 TraceCheckUtils]: 90: Hoare triple {2169#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; {2169#false} is VALID [2022-02-21 04:30:39,207 INFO L290 TraceCheckUtils]: 91: Hoare triple {2169#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; {2169#false} is VALID [2022-02-21 04:30:39,207 INFO L290 TraceCheckUtils]: 92: Hoare triple {2169#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {2169#false} is VALID [2022-02-21 04:30:39,207 INFO L290 TraceCheckUtils]: 93: Hoare triple {2169#false} assume !(node7_~m7~0#1 != ~nomsg~0); {2169#false} is VALID [2022-02-21 04:30:39,207 INFO L290 TraceCheckUtils]: 94: Hoare triple {2169#false} ~mode7~0 := 0; {2169#false} is VALID [2022-02-21 04:30:39,208 INFO L290 TraceCheckUtils]: 95: Hoare triple {2169#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; {2169#false} is VALID [2022-02-21 04:30:39,208 INFO L290 TraceCheckUtils]: 96: Hoare triple {2169#false} assume !(0 != ~mode8~0 % 256); {2169#false} is VALID [2022-02-21 04:30:39,208 INFO L290 TraceCheckUtils]: 97: Hoare triple {2169#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {2169#false} is VALID [2022-02-21 04:30:39,208 INFO L290 TraceCheckUtils]: 98: Hoare triple {2169#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; {2169#false} is VALID [2022-02-21 04:30:39,208 INFO L290 TraceCheckUtils]: 99: Hoare triple {2169#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; {2169#false} is VALID [2022-02-21 04:30:39,208 INFO L290 TraceCheckUtils]: 100: Hoare triple {2169#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {2169#false} is VALID [2022-02-21 04:30:39,209 INFO L290 TraceCheckUtils]: 101: Hoare triple {2169#false} assume !(~r1~0 >= 8); {2169#false} is VALID [2022-02-21 04:30:39,209 INFO L290 TraceCheckUtils]: 102: Hoare triple {2169#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {2169#false} is VALID [2022-02-21 04:30:39,209 INFO L290 TraceCheckUtils]: 103: Hoare triple {2169#false} assume ~r1~0 < 8;check_~tmp~1#1 := 1; {2169#false} is VALID [2022-02-21 04:30:39,209 INFO L290 TraceCheckUtils]: 104: Hoare triple {2169#false} check_#res#1 := check_~tmp~1#1; {2169#false} is VALID [2022-02-21 04:30:39,209 INFO L290 TraceCheckUtils]: 105: Hoare triple {2169#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; {2169#false} is VALID [2022-02-21 04:30:39,209 INFO L290 TraceCheckUtils]: 106: Hoare triple {2169#false} assume !(0 == assert_~arg#1 % 256); {2169#false} is VALID [2022-02-21 04:30:39,210 INFO L290 TraceCheckUtils]: 107: Hoare triple {2169#false} assume { :end_inline_assert } true;main_#t~post47#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post47#1;havoc main_#t~post47#1; {2169#false} is VALID [2022-02-21 04:30:39,210 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:39,211 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:39,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678472162] [2022-02-21 04:30:39,211 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678472162] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:39,211 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:39,211 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:30:39,212 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856080499] [2022-02-21 04:30:39,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:41,042 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:30:41,042 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:30:41,042 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:30:41,042 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:30:41,042 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:30:41,042 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:41,042 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:30:41,042 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:30:41,042 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.8.1.ufo.BOUNDED-16.pals.c_Iteration4_Loop [2022-02-21 04:30:41,042 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:30:41,042 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:30:41,072 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:30:41,076 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:30:41,080 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:30:41,082 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:30:41,085 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:30:41,094 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:30:41,097 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:30:41,099 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:30:41,101 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:30:41,102 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:30:41,104 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:30:41,107 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:30:41,109 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:30:41,111 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:30:41,112 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:30:41,114 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:30:41,115 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:30:41,117 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:30:41,121 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:30:41,123 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:30:41,124 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:30:41,127 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:30:41,131 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:30:41,133 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:30:41,135 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:30:41,136 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:30:41,139 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:30:41,140 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:30:41,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:41,496 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:30:41,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:41,504 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:30:41,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:41,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:41,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:41,521 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:30:41,523 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:30:41,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:41,528 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:30:41,531 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:30:42,915 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2022-02-21 04:30:43,269 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 11664 conjuctions. This might take some time... [2022-02-21 04:31:40,635 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 11664 conjuctions.