./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e8985b7b99a6dec53be0ba16cc0e7b241934830d919fef1f601cc1b51084525 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:51:53,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:51:53,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:51:53,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:51:53,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:51:53,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:51:53,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:51:53,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:51:53,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:51:53,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:51:53,570 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:51:53,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:51:53,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:51:53,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:51:53,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:51:53,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:51:53,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:51:53,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:51:53,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:51:53,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:51:53,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:51:53,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:51:53,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:51:53,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:51:53,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:51:53,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:51:53,581 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:51:53,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:51:53,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:51:53,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:51:53,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:51:53,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:51:53,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:51:53,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:51:53,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:51:53,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:51:53,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:51:53,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:51:53,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:51:53,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:51:53,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:51:53,589 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:51:53,601 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:51:53,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:51:53,602 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:51:53,602 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:51:53,603 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:51:53,603 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:51:53,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:51:53,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:51:53,603 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:51:53,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:51:53,604 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:51:53,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:51:53,604 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:51:53,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:51:53,604 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:51:53,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:51:53,605 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:51:53,605 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:51:53,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:51:53,605 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:51:53,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:51:53,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:51:53,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:51:53,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:51:53,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:51:53,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:51:53,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:51:53,606 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:51:53,606 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:51:53,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:51:53,607 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:51:53,607 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:51:53,607 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:51:53,607 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(G ! call(reach_error())) ) 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 -> 8e8985b7b99a6dec53be0ba16cc0e7b241934830d919fef1f601cc1b51084525 [2022-02-20 18:51:53,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:51:53,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:51:53,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:51:53,835 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:51:53,847 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:51:53,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2022-02-20 18:51:53,908 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91b94956c/9343ca46004c4152bb67893f858fbab5/FLAGdaed317c8 [2022-02-20 18:51:54,241 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:51:54,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2022-02-20 18:51:54,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91b94956c/9343ca46004c4152bb67893f858fbab5/FLAGdaed317c8 [2022-02-20 18:51:54,663 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91b94956c/9343ca46004c4152bb67893f858fbab5 [2022-02-20 18:51:54,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:51:54,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:51:54,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:51:54,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:51:54,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:51:54,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:51:54" (1/1) ... [2022-02-20 18:51:54,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e55d8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:54, skipping insertion in model container [2022-02-20 18:51:54,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:51:54" (1/1) ... [2022-02-20 18:51:54,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:51:54,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:51:54,859 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-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[4900,4913] [2022-02-20 18:51:54,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:51:54,890 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:51:54,931 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-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[4900,4913] [2022-02-20 18:51:54,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:51:54,951 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:51:54,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:54 WrapperNode [2022-02-20 18:51:54,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:51:54,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:51:54,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:51:54,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:51:54,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:54" (1/1) ... [2022-02-20 18:51:54,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:54" (1/1) ... [2022-02-20 18:51:55,009 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 342 [2022-02-20 18:51:55,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:51:55,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:51:55,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:51:55,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:51:55,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:54" (1/1) ... [2022-02-20 18:51:55,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:54" (1/1) ... [2022-02-20 18:51:55,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:54" (1/1) ... [2022-02-20 18:51:55,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:54" (1/1) ... [2022-02-20 18:51:55,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:54" (1/1) ... [2022-02-20 18:51:55,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:54" (1/1) ... [2022-02-20 18:51:55,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:54" (1/1) ... [2022-02-20 18:51:55,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:51:55,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:51:55,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:51:55,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:51:55,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:54" (1/1) ... [2022-02-20 18:51:55,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:51:55,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:51:55,088 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:51:55,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:51:55,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:51:55,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:51:55,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:51:55,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:51:55,185 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:51:55,186 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:51:55,569 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:51:55,574 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:51:55,574 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:51:55,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:51:55 BoogieIcfgContainer [2022-02-20 18:51:55,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:51:55,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:51:55,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:51:55,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:51:55,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:51:54" (1/3) ... [2022-02-20 18:51:55,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50bf9acb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:51:55, skipping insertion in model container [2022-02-20 18:51:55,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:54" (2/3) ... [2022-02-20 18:51:55,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50bf9acb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:51:55, skipping insertion in model container [2022-02-20 18:51:55,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:51:55" (3/3) ... [2022-02-20 18:51:55,589 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2022-02-20 18:51:55,592 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:51:55,593 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:51:55,639 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:51:55,644 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:51:55,644 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:51:55,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 77 states have (on average 1.7272727272727273) internal successors, (133), 78 states have internal predecessors, (133), 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-20 18:51:55,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 18:51:55,671 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:55,672 INFO L514 BasicCegarLoop]: trace 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] [2022-02-20 18:51:55,672 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:55,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:55,676 INFO L85 PathProgramCache]: Analyzing trace with hash -347547403, now seen corresponding path program 1 times [2022-02-20 18:51:55,683 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:55,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476516821] [2022-02-20 18:51:55,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:55,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:56,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {82#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~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];~__return_2928~0 := 0;~__return_3023~0 := 0;~__return_3091~0 := 0; {82#true} is VALID [2022-02-20 18:51:56,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {82#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {82#true} is VALID [2022-02-20 18:51:56,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {82#true} assume 0 == ~r1~0; {82#true} is VALID [2022-02-20 18:51:56,008 INFO L290 TraceCheckUtils]: 3: Hoare triple {82#true} assume ~id1~0 >= 0; {82#true} is VALID [2022-02-20 18:51:56,009 INFO L290 TraceCheckUtils]: 4: Hoare triple {82#true} assume 0 == ~st1~0; {82#true} is VALID [2022-02-20 18:51:56,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {82#true} assume ~send1~0 == ~id1~0; {82#true} is VALID [2022-02-20 18:51:56,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {82#true} assume 0 == ~mode1~0 % 256; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {84#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:56,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {84#(= (+ (* (- 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);main_~node1__m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:51:56,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {83#false} assume !(main_~node1__m1~0#1 != ~nomsg~0); {83#false} is VALID [2022-02-20 18:51:56,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {83#false} ~mode1~0 := 0; {83#false} is VALID [2022-02-20 18:51:56,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {83#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:51:56,034 INFO L290 TraceCheckUtils]: 31: Hoare triple {83#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:51:56,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {83#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {83#false} is VALID [2022-02-20 18:51:56,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {83#false} ~mode2~0 := 0; {83#false} is VALID [2022-02-20 18:51:56,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {83#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:51:56,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {83#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:51:56,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {83#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {83#false} is VALID [2022-02-20 18:51:56,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {83#false} ~mode3~0 := 0; {83#false} is VALID [2022-02-20 18:51:56,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {83#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:51:56,037 INFO L290 TraceCheckUtils]: 39: Hoare triple {83#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {83#false} is VALID [2022-02-20 18:51:56,037 INFO L290 TraceCheckUtils]: 40: Hoare triple {83#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {83#false} is VALID [2022-02-20 18:51:56,037 INFO L290 TraceCheckUtils]: 41: Hoare triple {83#false} ~mode4~0 := 0; {83#false} is VALID [2022-02-20 18:51:56,038 INFO L290 TraceCheckUtils]: 42: Hoare triple {83#false} ~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;havoc main_~check__tmp~0#1; {83#false} is VALID [2022-02-20 18:51:56,038 INFO L290 TraceCheckUtils]: 43: Hoare triple {83#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {83#false} is VALID [2022-02-20 18:51:56,038 INFO L290 TraceCheckUtils]: 44: Hoare triple {83#false} ~__return_3023~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3023~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {83#false} is VALID [2022-02-20 18:51:56,039 INFO L290 TraceCheckUtils]: 45: Hoare triple {83#false} assume 0 == main_~assert__arg~0#1 % 256; {83#false} is VALID [2022-02-20 18:51:56,039 INFO L290 TraceCheckUtils]: 46: Hoare triple {83#false} assume !false; {83#false} is VALID [2022-02-20 18:51:56,042 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-20 18:51:56,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:56,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476516821] [2022-02-20 18:51:56,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476516821] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:56,045 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:56,045 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:51:56,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854895368] [2022-02-20 18:51:56,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:56,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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) Word has length 47 [2022-02-20 18:51:56,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:56,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-20 18:51:56,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:56,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:51:56,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:56,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:51:56,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:56,130 INFO L87 Difference]: Start difference. First operand has 79 states, 77 states have (on average 1.7272727272727273) internal successors, (133), 78 states have internal predecessors, (133), 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 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-20 18:51:56,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:56,364 INFO L93 Difference]: Finished difference Result 177 states and 286 transitions. [2022-02-20 18:51:56,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:51:56,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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) Word has length 47 [2022-02-20 18:51:56,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-20 18:51:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2022-02-20 18:51:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-20 18:51:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2022-02-20 18:51:56,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 286 transitions. [2022-02-20 18:51:56,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:56,631 INFO L225 Difference]: With dead ends: 177 [2022-02-20 18:51:56,632 INFO L226 Difference]: Without dead ends: 118 [2022-02-20 18:51:56,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:56,639 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 91 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:56,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 277 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:56,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-02-20 18:51:56,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2022-02-20 18:51:56,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:56,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 116 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 115 states have internal predecessors, (169), 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-20 18:51:56,669 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 116 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 115 states have internal predecessors, (169), 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-20 18:51:56,669 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 116 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 115 states have internal predecessors, (169), 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-20 18:51:56,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:56,673 INFO L93 Difference]: Finished difference Result 118 states and 170 transitions. [2022-02-20 18:51:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2022-02-20 18:51:56,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:56,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:56,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 115 states have internal predecessors, (169), 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 118 states. [2022-02-20 18:51:56,675 INFO L87 Difference]: Start difference. First operand has 116 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 115 states have internal predecessors, (169), 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 118 states. [2022-02-20 18:51:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:56,679 INFO L93 Difference]: Finished difference Result 118 states and 170 transitions. [2022-02-20 18:51:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2022-02-20 18:51:56,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:56,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:56,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:56,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:56,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 115 states have internal predecessors, (169), 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-20 18:51:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 169 transitions. [2022-02-20 18:51:56,684 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 169 transitions. Word has length 47 [2022-02-20 18:51:56,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:56,684 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 169 transitions. [2022-02-20 18:51:56,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-20 18:51:56,685 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 169 transitions. [2022-02-20 18:51:56,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:51:56,686 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:56,686 INFO L514 BasicCegarLoop]: trace 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] [2022-02-20 18:51:56,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:51:56,686 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:56,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:56,687 INFO L85 PathProgramCache]: Analyzing trace with hash -391185874, now seen corresponding path program 1 times [2022-02-20 18:51:56,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:56,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582194166] [2022-02-20 18:51:56,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:56,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:56,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {708#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~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];~__return_2928~0 := 0;~__return_3023~0 := 0;~__return_3091~0 := 0; {708#true} is VALID [2022-02-20 18:51:56,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {708#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {708#true} is VALID [2022-02-20 18:51:56,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {708#true} assume 0 == ~r1~0; {708#true} is VALID [2022-02-20 18:51:56,757 INFO L290 TraceCheckUtils]: 3: Hoare triple {708#true} assume ~id1~0 >= 0; {708#true} is VALID [2022-02-20 18:51:56,757 INFO L290 TraceCheckUtils]: 4: Hoare triple {708#true} assume 0 == ~st1~0; {708#true} is VALID [2022-02-20 18:51:56,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {708#true} assume ~send1~0 == ~id1~0; {708#true} is VALID [2022-02-20 18:51:56,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {708#true} assume 0 == ~mode1~0 % 256; {708#true} is VALID [2022-02-20 18:51:56,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {708#true} assume ~id2~0 >= 0; {708#true} is VALID [2022-02-20 18:51:56,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {708#true} assume 0 == ~st2~0; {708#true} is VALID [2022-02-20 18:51:56,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {708#true} assume ~send2~0 == ~id2~0; {708#true} is VALID [2022-02-20 18:51:56,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {708#true} assume 0 == ~mode2~0 % 256; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~nomsg~0); {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,768 INFO L290 TraceCheckUtils]: 31: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:51:56,769 INFO L290 TraceCheckUtils]: 32: Hoare triple {710#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {709#false} is VALID [2022-02-20 18:51:56,769 INFO L290 TraceCheckUtils]: 33: Hoare triple {709#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {709#false} is VALID [2022-02-20 18:51:56,769 INFO L290 TraceCheckUtils]: 34: Hoare triple {709#false} ~mode2~0 := 0; {709#false} is VALID [2022-02-20 18:51:56,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {709#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {709#false} is VALID [2022-02-20 18:51:56,770 INFO L290 TraceCheckUtils]: 36: Hoare triple {709#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {709#false} is VALID [2022-02-20 18:51:56,770 INFO L290 TraceCheckUtils]: 37: Hoare triple {709#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {709#false} is VALID [2022-02-20 18:51:56,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {709#false} ~mode3~0 := 0; {709#false} is VALID [2022-02-20 18:51:56,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {709#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {709#false} is VALID [2022-02-20 18:51:56,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {709#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {709#false} is VALID [2022-02-20 18:51:56,770 INFO L290 TraceCheckUtils]: 41: Hoare triple {709#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {709#false} is VALID [2022-02-20 18:51:56,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {709#false} ~mode4~0 := 0; {709#false} is VALID [2022-02-20 18:51:56,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {709#false} ~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;havoc main_~check__tmp~0#1; {709#false} is VALID [2022-02-20 18:51:56,771 INFO L290 TraceCheckUtils]: 44: Hoare triple {709#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {709#false} is VALID [2022-02-20 18:51:56,771 INFO L290 TraceCheckUtils]: 45: Hoare triple {709#false} ~__return_3023~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3023~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {709#false} is VALID [2022-02-20 18:51:56,771 INFO L290 TraceCheckUtils]: 46: Hoare triple {709#false} assume 0 == main_~assert__arg~0#1 % 256; {709#false} is VALID [2022-02-20 18:51:56,772 INFO L290 TraceCheckUtils]: 47: Hoare triple {709#false} assume !false; {709#false} is VALID [2022-02-20 18:51:56,772 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-20 18:51:56,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:56,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582194166] [2022-02-20 18:51:56,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582194166] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:56,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:56,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:51:56,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009911088] [2022-02-20 18:51:56,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:56,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) Word has length 48 [2022-02-20 18:51:56,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:56,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-20 18:51:56,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:56,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:51:56,812 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:56,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:51:56,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:56,813 INFO L87 Difference]: Start difference. First operand 116 states and 169 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-20 18:51:56,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:56,957 INFO L93 Difference]: Finished difference Result 280 states and 429 transitions. [2022-02-20 18:51:56,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:51:56,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) Word has length 48 [2022-02-20 18:51:56,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-20 18:51:56,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2022-02-20 18:51:56,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-20 18:51:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2022-02-20 18:51:56,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 250 transitions. [2022-02-20 18:51:57,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:57,136 INFO L225 Difference]: With dead ends: 280 [2022-02-20 18:51:57,137 INFO L226 Difference]: Without dead ends: 190 [2022-02-20 18:51:57,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:57,138 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 64 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:57,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 237 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:57,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-02-20 18:51:57,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2022-02-20 18:51:57,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:57,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand has 188 states, 187 states have (on average 1.5133689839572193) internal successors, (283), 187 states have internal predecessors, (283), 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-20 18:51:57,151 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand has 188 states, 187 states have (on average 1.5133689839572193) internal successors, (283), 187 states have internal predecessors, (283), 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-20 18:51:57,151 INFO L87 Difference]: Start difference. First operand 190 states. Second operand has 188 states, 187 states have (on average 1.5133689839572193) internal successors, (283), 187 states have internal predecessors, (283), 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-20 18:51:57,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:57,156 INFO L93 Difference]: Finished difference Result 190 states and 284 transitions. [2022-02-20 18:51:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 284 transitions. [2022-02-20 18:51:57,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:57,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:57,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 187 states have (on average 1.5133689839572193) internal successors, (283), 187 states have internal predecessors, (283), 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 190 states. [2022-02-20 18:51:57,158 INFO L87 Difference]: Start difference. First operand has 188 states, 187 states have (on average 1.5133689839572193) internal successors, (283), 187 states have internal predecessors, (283), 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 190 states. [2022-02-20 18:51:57,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:57,162 INFO L93 Difference]: Finished difference Result 190 states and 284 transitions. [2022-02-20 18:51:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 284 transitions. [2022-02-20 18:51:57,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:57,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:57,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:57,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.5133689839572193) internal successors, (283), 187 states have internal predecessors, (283), 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-20 18:51:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 283 transitions. [2022-02-20 18:51:57,169 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 283 transitions. Word has length 48 [2022-02-20 18:51:57,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:57,169 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 283 transitions. [2022-02-20 18:51:57,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-20 18:51:57,170 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 283 transitions. [2022-02-20 18:51:57,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:51:57,170 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:57,170 INFO L514 BasicCegarLoop]: trace 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] [2022-02-20 18:51:57,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:51:57,171 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:57,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:57,171 INFO L85 PathProgramCache]: Analyzing trace with hash -2047730124, now seen corresponding path program 1 times [2022-02-20 18:51:57,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:57,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014676310] [2022-02-20 18:51:57,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:57,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:57,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {1724#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~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];~__return_2928~0 := 0;~__return_3023~0 := 0;~__return_3091~0 := 0; {1724#true} is VALID [2022-02-20 18:51:57,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {1724#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {1724#true} is VALID [2022-02-20 18:51:57,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {1724#true} assume 0 == ~r1~0; {1724#true} is VALID [2022-02-20 18:51:57,232 INFO L290 TraceCheckUtils]: 3: Hoare triple {1724#true} assume ~id1~0 >= 0; {1724#true} is VALID [2022-02-20 18:51:57,232 INFO L290 TraceCheckUtils]: 4: Hoare triple {1724#true} assume 0 == ~st1~0; {1724#true} is VALID [2022-02-20 18:51:57,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {1724#true} assume ~send1~0 == ~id1~0; {1724#true} is VALID [2022-02-20 18:51:57,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {1724#true} assume 0 == ~mode1~0 % 256; {1724#true} is VALID [2022-02-20 18:51:57,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {1724#true} assume ~id2~0 >= 0; {1724#true} is VALID [2022-02-20 18:51:57,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {1724#true} assume 0 == ~st2~0; {1724#true} is VALID [2022-02-20 18:51:57,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {1724#true} assume ~send2~0 == ~id2~0; {1724#true} is VALID [2022-02-20 18:51:57,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {1724#true} assume 0 == ~mode2~0 % 256; {1724#true} is VALID [2022-02-20 18:51:57,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {1724#true} assume ~id3~0 >= 0; {1724#true} is VALID [2022-02-20 18:51:57,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {1724#true} assume 0 == ~st3~0; {1724#true} is VALID [2022-02-20 18:51:57,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {1724#true} assume ~send3~0 == ~id3~0; {1724#true} is VALID [2022-02-20 18:51:57,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {1724#true} assume 0 == ~mode3~0 % 256; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~nomsg~0); {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~nomsg~0); {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,244 INFO L290 TraceCheckUtils]: 35: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:51:57,245 INFO L290 TraceCheckUtils]: 37: Hoare triple {1726#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1725#false} is VALID [2022-02-20 18:51:57,245 INFO L290 TraceCheckUtils]: 38: Hoare triple {1725#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {1725#false} is VALID [2022-02-20 18:51:57,245 INFO L290 TraceCheckUtils]: 39: Hoare triple {1725#false} ~mode3~0 := 0; {1725#false} is VALID [2022-02-20 18:51:57,245 INFO L290 TraceCheckUtils]: 40: Hoare triple {1725#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {1725#false} is VALID [2022-02-20 18:51:57,245 INFO L290 TraceCheckUtils]: 41: Hoare triple {1725#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1725#false} is VALID [2022-02-20 18:51:57,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {1725#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {1725#false} is VALID [2022-02-20 18:51:57,246 INFO L290 TraceCheckUtils]: 43: Hoare triple {1725#false} ~mode4~0 := 0; {1725#false} is VALID [2022-02-20 18:51:57,246 INFO L290 TraceCheckUtils]: 44: Hoare triple {1725#false} ~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;havoc main_~check__tmp~0#1; {1725#false} is VALID [2022-02-20 18:51:57,246 INFO L290 TraceCheckUtils]: 45: Hoare triple {1725#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {1725#false} is VALID [2022-02-20 18:51:57,246 INFO L290 TraceCheckUtils]: 46: Hoare triple {1725#false} ~__return_3023~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3023~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {1725#false} is VALID [2022-02-20 18:51:57,246 INFO L290 TraceCheckUtils]: 47: Hoare triple {1725#false} assume 0 == main_~assert__arg~0#1 % 256; {1725#false} is VALID [2022-02-20 18:51:57,247 INFO L290 TraceCheckUtils]: 48: Hoare triple {1725#false} assume !false; {1725#false} is VALID [2022-02-20 18:51:57,247 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-20 18:51:57,247 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:57,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014676310] [2022-02-20 18:51:57,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014676310] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:57,248 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:57,248 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:51:57,248 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76164808] [2022-02-20 18:51:57,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:57,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) Word has length 49 [2022-02-20 18:51:57,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:57,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-20 18:51:57,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:57,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:51:57,277 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:57,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:51:57,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:57,278 INFO L87 Difference]: Start difference. First operand 188 states and 283 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-20 18:51:57,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:57,403 INFO L93 Difference]: Finished difference Result 480 states and 745 transitions. [2022-02-20 18:51:57,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:51:57,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) Word has length 49 [2022-02-20 18:51:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-20 18:51:57,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2022-02-20 18:51:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-20 18:51:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2022-02-20 18:51:57,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 250 transitions. [2022-02-20 18:51:57,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:57,558 INFO L225 Difference]: With dead ends: 480 [2022-02-20 18:51:57,558 INFO L226 Difference]: Without dead ends: 318 [2022-02-20 18:51:57,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:57,566 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 59 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:57,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 233 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:57,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-02-20 18:51:57,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316. [2022-02-20 18:51:57,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:57,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 318 states. Second operand has 316 states, 315 states have (on average 1.5333333333333334) internal successors, (483), 315 states have internal predecessors, (483), 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-20 18:51:57,601 INFO L74 IsIncluded]: Start isIncluded. First operand 318 states. Second operand has 316 states, 315 states have (on average 1.5333333333333334) internal successors, (483), 315 states have internal predecessors, (483), 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-20 18:51:57,602 INFO L87 Difference]: Start difference. First operand 318 states. Second operand has 316 states, 315 states have (on average 1.5333333333333334) internal successors, (483), 315 states have internal predecessors, (483), 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-20 18:51:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:57,609 INFO L93 Difference]: Finished difference Result 318 states and 484 transitions. [2022-02-20 18:51:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 484 transitions. [2022-02-20 18:51:57,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:57,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:57,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 316 states, 315 states have (on average 1.5333333333333334) internal successors, (483), 315 states have internal predecessors, (483), 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 318 states. [2022-02-20 18:51:57,612 INFO L87 Difference]: Start difference. First operand has 316 states, 315 states have (on average 1.5333333333333334) internal successors, (483), 315 states have internal predecessors, (483), 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 318 states. [2022-02-20 18:51:57,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:57,622 INFO L93 Difference]: Finished difference Result 318 states and 484 transitions. [2022-02-20 18:51:57,622 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 484 transitions. [2022-02-20 18:51:57,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:57,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:57,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:57,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:57,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.5333333333333334) internal successors, (483), 315 states have internal predecessors, (483), 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-20 18:51:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 483 transitions. [2022-02-20 18:51:57,634 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 483 transitions. Word has length 49 [2022-02-20 18:51:57,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:57,639 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 483 transitions. [2022-02-20 18:51:57,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-20 18:51:57,639 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 483 transitions. [2022-02-20 18:51:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:51:57,641 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:57,641 INFO L514 BasicCegarLoop]: trace 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] [2022-02-20 18:51:57,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:51:57,642 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:57,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:57,643 INFO L85 PathProgramCache]: Analyzing trace with hash -415311335, now seen corresponding path program 1 times [2022-02-20 18:51:57,643 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:57,643 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560929360] [2022-02-20 18:51:57,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:57,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:57,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {3457#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~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];~__return_2928~0 := 0;~__return_3023~0 := 0;~__return_3091~0 := 0; {3457#true} is VALID [2022-02-20 18:51:57,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {3457#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {3457#true} is VALID [2022-02-20 18:51:57,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {3457#true} assume 0 == ~r1~0; {3457#true} is VALID [2022-02-20 18:51:57,748 INFO L290 TraceCheckUtils]: 3: Hoare triple {3457#true} assume ~id1~0 >= 0; {3457#true} is VALID [2022-02-20 18:51:57,749 INFO L290 TraceCheckUtils]: 4: Hoare triple {3457#true} assume 0 == ~st1~0; {3457#true} is VALID [2022-02-20 18:51:57,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {3457#true} assume ~send1~0 == ~id1~0; {3457#true} is VALID [2022-02-20 18:51:57,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {3457#true} assume 0 == ~mode1~0 % 256; {3457#true} is VALID [2022-02-20 18:51:57,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {3457#true} assume ~id2~0 >= 0; {3457#true} is VALID [2022-02-20 18:51:57,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {3457#true} assume 0 == ~st2~0; {3457#true} is VALID [2022-02-20 18:51:57,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {3457#true} assume ~send2~0 == ~id2~0; {3457#true} is VALID [2022-02-20 18:51:57,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {3457#true} assume 0 == ~mode2~0 % 256; {3457#true} is VALID [2022-02-20 18:51:57,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {3457#true} assume ~id3~0 >= 0; {3457#true} is VALID [2022-02-20 18:51:57,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {3457#true} assume 0 == ~st3~0; {3457#true} is VALID [2022-02-20 18:51:57,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {3457#true} assume ~send3~0 == ~id3~0; {3457#true} is VALID [2022-02-20 18:51:57,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {3457#true} assume 0 == ~mode3~0 % 256; {3457#true} is VALID [2022-02-20 18:51:57,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {3457#true} assume ~id4~0 >= 0; {3457#true} is VALID [2022-02-20 18:51:57,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {3457#true} assume 0 == ~st4~0; {3457#true} is VALID [2022-02-20 18:51:57,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {3457#true} assume ~send4~0 == ~id4~0; {3457#true} is VALID [2022-02-20 18:51:57,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {3457#true} assume 0 == ~mode4~0 % 256; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,757 INFO L290 TraceCheckUtils]: 27: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~nomsg~0); {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,759 INFO L290 TraceCheckUtils]: 31: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~nomsg~0); {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,760 INFO L290 TraceCheckUtils]: 34: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,761 INFO L290 TraceCheckUtils]: 36: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,762 INFO L290 TraceCheckUtils]: 38: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0); {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,762 INFO L290 TraceCheckUtils]: 39: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:51:57,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {3459#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3458#false} is VALID [2022-02-20 18:51:57,766 INFO L290 TraceCheckUtils]: 43: Hoare triple {3458#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {3458#false} is VALID [2022-02-20 18:51:57,766 INFO L290 TraceCheckUtils]: 44: Hoare triple {3458#false} ~mode4~0 := 0; {3458#false} is VALID [2022-02-20 18:51:57,766 INFO L290 TraceCheckUtils]: 45: Hoare triple {3458#false} ~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;havoc main_~check__tmp~0#1; {3458#false} is VALID [2022-02-20 18:51:57,767 INFO L290 TraceCheckUtils]: 46: Hoare triple {3458#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {3458#false} is VALID [2022-02-20 18:51:57,767 INFO L290 TraceCheckUtils]: 47: Hoare triple {3458#false} ~__return_3023~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3023~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {3458#false} is VALID [2022-02-20 18:51:57,767 INFO L290 TraceCheckUtils]: 48: Hoare triple {3458#false} assume 0 == main_~assert__arg~0#1 % 256; {3458#false} is VALID [2022-02-20 18:51:57,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {3458#false} assume !false; {3458#false} is VALID [2022-02-20 18:51:57,769 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-20 18:51:57,769 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:57,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560929360] [2022-02-20 18:51:57,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560929360] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:57,770 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:57,770 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:51:57,770 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465592997] [2022-02-20 18:51:57,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:57,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) Word has length 50 [2022-02-20 18:51:57,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:57,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-20 18:51:57,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:57,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:51:57,799 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:57,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:51:57,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:57,801 INFO L87 Difference]: Start difference. First operand 316 states and 483 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-20 18:51:57,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:57,985 INFO L93 Difference]: Finished difference Result 832 states and 1293 transitions. [2022-02-20 18:51:57,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:51:57,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) Word has length 50 [2022-02-20 18:51:57,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:57,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-20 18:51:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2022-02-20 18:51:57,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-20 18:51:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2022-02-20 18:51:57,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 250 transitions. [2022-02-20 18:51:58,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:58,132 INFO L225 Difference]: With dead ends: 832 [2022-02-20 18:51:58,133 INFO L226 Difference]: Without dead ends: 542 [2022-02-20 18:51:58,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:58,134 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 54 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:58,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 229 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-02-20 18:51:58,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 540. [2022-02-20 18:51:58,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:58,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 542 states. Second operand has 540 states, 539 states have (on average 1.5343228200371057) internal successors, (827), 539 states have internal predecessors, (827), 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-20 18:51:58,171 INFO L74 IsIncluded]: Start isIncluded. First operand 542 states. Second operand has 540 states, 539 states have (on average 1.5343228200371057) internal successors, (827), 539 states have internal predecessors, (827), 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-20 18:51:58,172 INFO L87 Difference]: Start difference. First operand 542 states. Second operand has 540 states, 539 states have (on average 1.5343228200371057) internal successors, (827), 539 states have internal predecessors, (827), 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-20 18:51:58,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:58,184 INFO L93 Difference]: Finished difference Result 542 states and 828 transitions. [2022-02-20 18:51:58,184 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 828 transitions. [2022-02-20 18:51:58,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:58,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:58,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 540 states, 539 states have (on average 1.5343228200371057) internal successors, (827), 539 states have internal predecessors, (827), 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 542 states. [2022-02-20 18:51:58,187 INFO L87 Difference]: Start difference. First operand has 540 states, 539 states have (on average 1.5343228200371057) internal successors, (827), 539 states have internal predecessors, (827), 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 542 states. [2022-02-20 18:51:58,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:58,199 INFO L93 Difference]: Finished difference Result 542 states and 828 transitions. [2022-02-20 18:51:58,199 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 828 transitions. [2022-02-20 18:51:58,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:58,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:58,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:58,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 539 states have (on average 1.5343228200371057) internal successors, (827), 539 states have internal predecessors, (827), 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-20 18:51:58,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 827 transitions. [2022-02-20 18:51:58,215 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 827 transitions. Word has length 50 [2022-02-20 18:51:58,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:58,215 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 827 transitions. [2022-02-20 18:51:58,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-20 18:51:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 827 transitions. [2022-02-20 18:51:58,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:51:58,216 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:58,216 INFO L514 BasicCegarLoop]: trace 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] [2022-02-20 18:51:58,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:51:58,216 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:58,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:58,217 INFO L85 PathProgramCache]: Analyzing trace with hash -103942672, now seen corresponding path program 1 times [2022-02-20 18:51:58,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:58,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625084882] [2022-02-20 18:51:58,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:58,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:58,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {6450#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~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];~__return_2928~0 := 0;~__return_3023~0 := 0;~__return_3091~0 := 0; {6450#true} is VALID [2022-02-20 18:51:58,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {6450#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {6450#true} is VALID [2022-02-20 18:51:58,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {6450#true} assume 0 == ~r1~0; {6450#true} is VALID [2022-02-20 18:51:58,316 INFO L290 TraceCheckUtils]: 3: Hoare triple {6450#true} assume ~id1~0 >= 0; {6450#true} is VALID [2022-02-20 18:51:58,316 INFO L290 TraceCheckUtils]: 4: Hoare triple {6450#true} assume 0 == ~st1~0; {6452#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:58,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {6452#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {6452#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:58,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {6452#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {6452#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:58,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {6452#(<= ~st1~0 0)} assume ~id2~0 >= 0; {6452#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:58,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {6452#(<= ~st1~0 0)} assume 0 == ~st2~0; {6453#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {6453#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {6453#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {6453#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6453#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {6453#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {6453#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {6453#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6454#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {6454#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {6454#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {6454#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {6454#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {6454#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {6454#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {6454#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0); {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,329 INFO L290 TraceCheckUtils]: 31: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,329 INFO L290 TraceCheckUtils]: 32: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0); {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,330 INFO L290 TraceCheckUtils]: 34: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,330 INFO L290 TraceCheckUtils]: 35: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,331 INFO L290 TraceCheckUtils]: 36: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,331 INFO L290 TraceCheckUtils]: 37: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,331 INFO L290 TraceCheckUtils]: 38: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0); {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,332 INFO L290 TraceCheckUtils]: 39: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,332 INFO L290 TraceCheckUtils]: 40: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,332 INFO L290 TraceCheckUtils]: 41: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,333 INFO L290 TraceCheckUtils]: 42: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,333 INFO L290 TraceCheckUtils]: 43: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,334 INFO L290 TraceCheckUtils]: 44: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,334 INFO L290 TraceCheckUtils]: 45: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~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;havoc main_~check__tmp~0#1; {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:58,335 INFO L290 TraceCheckUtils]: 47: Hoare triple {6455#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {6451#false} is VALID [2022-02-20 18:51:58,335 INFO L290 TraceCheckUtils]: 48: Hoare triple {6451#false} ~__return_3023~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3023~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {6451#false} is VALID [2022-02-20 18:51:58,335 INFO L290 TraceCheckUtils]: 49: Hoare triple {6451#false} assume 0 == main_~assert__arg~0#1 % 256; {6451#false} is VALID [2022-02-20 18:51:58,335 INFO L290 TraceCheckUtils]: 50: Hoare triple {6451#false} assume !false; {6451#false} is VALID [2022-02-20 18:51:58,336 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-20 18:51:58,336 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:58,336 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625084882] [2022-02-20 18:51:58,336 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625084882] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:58,336 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:58,336 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:51:58,336 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538461765] [2022-02-20 18:51:58,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:58,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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) Word has length 51 [2022-02-20 18:51:58,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:58,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-20 18:51:58,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:58,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:51:58,367 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:58,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:51:58,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:51:58,368 INFO L87 Difference]: Start difference. First operand 540 states and 827 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-20 18:52:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:01,589 INFO L93 Difference]: Finished difference Result 4652 states and 7235 transitions. [2022-02-20 18:52:01,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 18:52:01,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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) Word has length 51 [2022-02-20 18:52:01,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:01,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-20 18:52:01,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 737 transitions. [2022-02-20 18:52:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-20 18:52:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 737 transitions. [2022-02-20 18:52:01,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 737 transitions. [2022-02-20 18:52:02,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 737 edges. 737 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:02,780 INFO L225 Difference]: With dead ends: 4652 [2022-02-20 18:52:02,780 INFO L226 Difference]: Without dead ends: 4138 [2022-02-20 18:52:02,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:52:02,782 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 784 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:02,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [784 Valid, 993 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:02,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2022-02-20 18:52:03,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 1052. [2022-02-20 18:52:03,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:03,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4138 states. Second operand has 1052 states, 1051 states have (on average 1.5176022835394862) internal successors, (1595), 1051 states have internal predecessors, (1595), 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-20 18:52:03,437 INFO L74 IsIncluded]: Start isIncluded. First operand 4138 states. Second operand has 1052 states, 1051 states have (on average 1.5176022835394862) internal successors, (1595), 1051 states have internal predecessors, (1595), 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-20 18:52:03,439 INFO L87 Difference]: Start difference. First operand 4138 states. Second operand has 1052 states, 1051 states have (on average 1.5176022835394862) internal successors, (1595), 1051 states have internal predecessors, (1595), 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-20 18:52:04,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:04,004 INFO L93 Difference]: Finished difference Result 4138 states and 6306 transitions. [2022-02-20 18:52:04,004 INFO L276 IsEmpty]: Start isEmpty. Operand 4138 states and 6306 transitions. [2022-02-20 18:52:04,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:04,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:04,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 1052 states, 1051 states have (on average 1.5176022835394862) internal successors, (1595), 1051 states have internal predecessors, (1595), 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 4138 states. [2022-02-20 18:52:04,015 INFO L87 Difference]: Start difference. First operand has 1052 states, 1051 states have (on average 1.5176022835394862) internal successors, (1595), 1051 states have internal predecessors, (1595), 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 4138 states. [2022-02-20 18:52:04,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:04,552 INFO L93 Difference]: Finished difference Result 4138 states and 6306 transitions. [2022-02-20 18:52:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 4138 states and 6306 transitions. [2022-02-20 18:52:04,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:04,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:04,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:04,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:04,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.5176022835394862) internal successors, (1595), 1051 states have internal predecessors, (1595), 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-20 18:52:04,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1595 transitions. [2022-02-20 18:52:04,606 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1595 transitions. Word has length 51 [2022-02-20 18:52:04,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:04,606 INFO L470 AbstractCegarLoop]: Abstraction has 1052 states and 1595 transitions. [2022-02-20 18:52:04,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-20 18:52:04,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1595 transitions. [2022-02-20 18:52:04,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:52:04,607 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:04,607 INFO L514 BasicCegarLoop]: trace 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] [2022-02-20 18:52:04,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:52:04,607 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:04,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:04,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2026482100, now seen corresponding path program 1 times [2022-02-20 18:52:04,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:04,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772228336] [2022-02-20 18:52:04,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:04,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:04,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {22737#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~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];~__return_2928~0 := 0;~__return_3023~0 := 0;~__return_3091~0 := 0; {22737#true} is VALID [2022-02-20 18:52:04,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {22737#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {22737#true} is VALID [2022-02-20 18:52:04,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {22737#true} assume 0 == ~r1~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,653 INFO L290 TraceCheckUtils]: 3: Hoare triple {22739#(<= ~r1~0 0)} assume ~id1~0 >= 0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,654 INFO L290 TraceCheckUtils]: 4: Hoare triple {22739#(<= ~r1~0 0)} assume 0 == ~st1~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {22739#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {22739#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {22739#(<= ~r1~0 0)} assume ~id2~0 >= 0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {22739#(<= ~r1~0 0)} assume 0 == ~st2~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {22739#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {22739#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {22739#(<= ~r1~0 0)} assume ~id3~0 >= 0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {22739#(<= ~r1~0 0)} assume 0 == ~st3~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {22739#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {22739#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {22739#(<= ~r1~0 0)} assume ~id4~0 >= 0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {22739#(<= ~r1~0 0)} assume 0 == ~st4~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {22739#(<= ~r1~0 0)} assume ~send4~0 == ~id4~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {22739#(<= ~r1~0 0)} assume 0 == ~mode4~0 % 256; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {22739#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {22739#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {22739#(<= ~r1~0 0)} assume ~id1~0 != ~id4~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {22739#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {22739#(<= ~r1~0 0)} assume ~id2~0 != ~id4~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {22739#(<= ~r1~0 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {22739#(<= ~r1~0 0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {22739#(<= ~r1~0 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,663 INFO L290 TraceCheckUtils]: 27: Hoare triple {22739#(<= ~r1~0 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,663 INFO L290 TraceCheckUtils]: 28: Hoare triple {22739#(<= ~r1~0 0)} assume !(~send1~0 != ~nomsg~0); {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {22739#(<= ~r1~0 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,664 INFO L290 TraceCheckUtils]: 30: Hoare triple {22739#(<= ~r1~0 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,664 INFO L290 TraceCheckUtils]: 31: Hoare triple {22739#(<= ~r1~0 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,664 INFO L290 TraceCheckUtils]: 32: Hoare triple {22739#(<= ~r1~0 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,664 INFO L290 TraceCheckUtils]: 33: Hoare triple {22739#(<= ~r1~0 0)} assume !(~send2~0 != ~nomsg~0); {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,665 INFO L290 TraceCheckUtils]: 34: Hoare triple {22739#(<= ~r1~0 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,665 INFO L290 TraceCheckUtils]: 35: Hoare triple {22739#(<= ~r1~0 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,666 INFO L290 TraceCheckUtils]: 36: Hoare triple {22739#(<= ~r1~0 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,666 INFO L290 TraceCheckUtils]: 37: Hoare triple {22739#(<= ~r1~0 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,666 INFO L290 TraceCheckUtils]: 38: Hoare triple {22739#(<= ~r1~0 0)} assume !(~send3~0 != ~nomsg~0); {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,667 INFO L290 TraceCheckUtils]: 39: Hoare triple {22739#(<= ~r1~0 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,667 INFO L290 TraceCheckUtils]: 40: Hoare triple {22739#(<= ~r1~0 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,667 INFO L290 TraceCheckUtils]: 41: Hoare triple {22739#(<= ~r1~0 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,668 INFO L290 TraceCheckUtils]: 42: Hoare triple {22739#(<= ~r1~0 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,668 INFO L290 TraceCheckUtils]: 43: Hoare triple {22739#(<= ~r1~0 0)} assume ~send4~0 != ~nomsg~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,668 INFO L290 TraceCheckUtils]: 44: Hoare triple {22739#(<= ~r1~0 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,669 INFO L290 TraceCheckUtils]: 45: Hoare triple {22739#(<= ~r1~0 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,669 INFO L290 TraceCheckUtils]: 46: Hoare triple {22739#(<= ~r1~0 0)} ~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;havoc main_~check__tmp~0#1; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,669 INFO L290 TraceCheckUtils]: 47: Hoare triple {22739#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {22739#(<= ~r1~0 0)} is VALID [2022-02-20 18:52:04,670 INFO L290 TraceCheckUtils]: 48: Hoare triple {22739#(<= ~r1~0 0)} assume ~r1~0 >= 4; {22738#false} is VALID [2022-02-20 18:52:04,670 INFO L290 TraceCheckUtils]: 49: Hoare triple {22738#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1; {22738#false} is VALID [2022-02-20 18:52:04,670 INFO L290 TraceCheckUtils]: 50: Hoare triple {22738#false} ~__return_3023~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3023~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {22738#false} is VALID [2022-02-20 18:52:04,670 INFO L290 TraceCheckUtils]: 51: Hoare triple {22738#false} assume 0 == main_~assert__arg~0#1 % 256; {22738#false} is VALID [2022-02-20 18:52:04,670 INFO L290 TraceCheckUtils]: 52: Hoare triple {22738#false} assume !false; {22738#false} is VALID [2022-02-20 18:52:04,670 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-20 18:52:04,671 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:04,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772228336] [2022-02-20 18:52:04,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772228336] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:04,671 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:04,671 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:52:04,671 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428394617] [2022-02-20 18:52:04,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:04,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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) Word has length 53 [2022-02-20 18:52:04,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:04,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-20 18:52:04,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:04,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:52:04,700 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:04,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:52:04,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:52:04,701 INFO L87 Difference]: Start difference. First operand 1052 states and 1595 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-20 18:52:06,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:06,101 INFO L93 Difference]: Finished difference Result 2570 states and 3911 transitions. [2022-02-20 18:52:06,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:52:06,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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) Word has length 53 [2022-02-20 18:52:06,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-20 18:52:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2022-02-20 18:52:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-20 18:52:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2022-02-20 18:52:06,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 254 transitions. [2022-02-20 18:52:06,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:06,339 INFO L225 Difference]: With dead ends: 2570 [2022-02-20 18:52:06,339 INFO L226 Difference]: Without dead ends: 1544 [2022-02-20 18:52:06,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:52:06,342 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 45 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:06,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 201 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:06,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2022-02-20 18:52:07,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1542. [2022-02-20 18:52:07,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:07,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1544 states. Second operand has 1542 states, 1541 states have (on average 1.5035691109669047) internal successors, (2317), 1541 states have internal predecessors, (2317), 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-20 18:52:07,368 INFO L74 IsIncluded]: Start isIncluded. First operand 1544 states. Second operand has 1542 states, 1541 states have (on average 1.5035691109669047) internal successors, (2317), 1541 states have internal predecessors, (2317), 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-20 18:52:07,370 INFO L87 Difference]: Start difference. First operand 1544 states. Second operand has 1542 states, 1541 states have (on average 1.5035691109669047) internal successors, (2317), 1541 states have internal predecessors, (2317), 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-20 18:52:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:07,444 INFO L93 Difference]: Finished difference Result 1544 states and 2318 transitions. [2022-02-20 18:52:07,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2318 transitions. [2022-02-20 18:52:07,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:07,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:07,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 1542 states, 1541 states have (on average 1.5035691109669047) internal successors, (2317), 1541 states have internal predecessors, (2317), 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 1544 states. [2022-02-20 18:52:07,450 INFO L87 Difference]: Start difference. First operand has 1542 states, 1541 states have (on average 1.5035691109669047) internal successors, (2317), 1541 states have internal predecessors, (2317), 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 1544 states. [2022-02-20 18:52:07,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:07,525 INFO L93 Difference]: Finished difference Result 1544 states and 2318 transitions. [2022-02-20 18:52:07,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2318 transitions. [2022-02-20 18:52:07,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:07,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:07,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:07,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 1.5035691109669047) internal successors, (2317), 1541 states have internal predecessors, (2317), 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-20 18:52:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2317 transitions. [2022-02-20 18:52:07,627 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2317 transitions. Word has length 53 [2022-02-20 18:52:07,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:07,627 INFO L470 AbstractCegarLoop]: Abstraction has 1542 states and 2317 transitions. [2022-02-20 18:52:07,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-20 18:52:07,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2317 transitions. [2022-02-20 18:52:07,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:52:07,628 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:07,628 INFO L514 BasicCegarLoop]: trace 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] [2022-02-20 18:52:07,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:52:07,629 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:07,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:07,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2005479445, now seen corresponding path program 1 times [2022-02-20 18:52:07,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:07,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428902334] [2022-02-20 18:52:07,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:07,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:07,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {31608#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~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];~__return_2928~0 := 0;~__return_3023~0 := 0;~__return_3091~0 := 0; {31608#true} is VALID [2022-02-20 18:52:07,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {31608#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {31608#true} is VALID [2022-02-20 18:52:07,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {31608#true} assume 0 == ~r1~0; {31608#true} is VALID [2022-02-20 18:52:07,879 INFO L290 TraceCheckUtils]: 3: Hoare triple {31608#true} assume ~id1~0 >= 0; {31608#true} is VALID [2022-02-20 18:52:07,880 INFO L290 TraceCheckUtils]: 4: Hoare triple {31608#true} assume 0 == ~st1~0; {31610#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:52:07,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {31610#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~send1~0 == ~id1~0; {31610#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:52:07,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {31610#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~mode1~0 % 256; {31610#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:52:07,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {31610#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~id2~0 >= 0; {31610#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:52:07,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {31610#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~st2~0; {31611#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:52:07,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {31611#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {31611#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:52:07,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {31611#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {31611#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:52:07,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {31611#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {31611#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:52:07,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {31611#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {31612#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:52:07,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {31612#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {31612#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:52:07,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {31612#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {31612#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:52:07,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {31612#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {31612#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:52:07,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {31612#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 == ~id4~0; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 == ~mode4~0 % 256; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id2~0; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id3~0; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id4~0; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id3~0; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id4~0; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send1~0 != ~nomsg~0); {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,900 INFO L290 TraceCheckUtils]: 32: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send2~0 != ~nomsg~0); {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,903 INFO L290 TraceCheckUtils]: 35: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,903 INFO L290 TraceCheckUtils]: 36: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send3~0 != ~nomsg~0); {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,904 INFO L290 TraceCheckUtils]: 39: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,905 INFO L290 TraceCheckUtils]: 40: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,905 INFO L290 TraceCheckUtils]: 41: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,905 INFO L290 TraceCheckUtils]: 42: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,908 INFO L290 TraceCheckUtils]: 43: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 != ~nomsg~0; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,908 INFO L290 TraceCheckUtils]: 44: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,909 INFO L290 TraceCheckUtils]: 46: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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;havoc main_~check__tmp~0#1; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,910 INFO L290 TraceCheckUtils]: 47: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,910 INFO L290 TraceCheckUtils]: 48: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 >= 4); {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:52:07,910 INFO L290 TraceCheckUtils]: 49: Hoare triple {31613#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~0#1 := 0; {31609#false} is VALID [2022-02-20 18:52:07,911 INFO L290 TraceCheckUtils]: 50: Hoare triple {31609#false} ~__return_3023~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3023~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {31609#false} is VALID [2022-02-20 18:52:07,911 INFO L290 TraceCheckUtils]: 51: Hoare triple {31609#false} assume 0 == main_~assert__arg~0#1 % 256; {31609#false} is VALID [2022-02-20 18:52:07,911 INFO L290 TraceCheckUtils]: 52: Hoare triple {31609#false} assume !false; {31609#false} is VALID [2022-02-20 18:52:07,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:07,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:07,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428902334] [2022-02-20 18:52:07,920 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428902334] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:07,920 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:07,920 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:52:07,920 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364195676] [2022-02-20 18:52:07,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:07,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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) Word has length 53 [2022-02-20 18:52:07,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:07,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-20 18:52:07,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:07,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:52:07,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:07,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:52:07,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:07,966 INFO L87 Difference]: Start difference. First operand 1542 states and 2317 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-20 18:52:09,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:09,953 INFO L93 Difference]: Finished difference Result 3058 states and 4607 transitions. [2022-02-20 18:52:09,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:52:09,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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) Word has length 53 [2022-02-20 18:52:09,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:09,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-20 18:52:09,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 261 transitions. [2022-02-20 18:52:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-20 18:52:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 261 transitions. [2022-02-20 18:52:09,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 261 transitions. [2022-02-20 18:52:10,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:10,218 INFO L225 Difference]: With dead ends: 3058 [2022-02-20 18:52:10,219 INFO L226 Difference]: Without dead ends: 1544 [2022-02-20 18:52:10,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:52:10,224 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 209 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:10,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 330 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:10,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2022-02-20 18:52:11,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1542. [2022-02-20 18:52:11,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:11,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1544 states. Second operand has 1542 states, 1541 states have (on average 1.4879948085658663) internal successors, (2293), 1541 states have internal predecessors, (2293), 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-20 18:52:11,429 INFO L74 IsIncluded]: Start isIncluded. First operand 1544 states. Second operand has 1542 states, 1541 states have (on average 1.4879948085658663) internal successors, (2293), 1541 states have internal predecessors, (2293), 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-20 18:52:11,430 INFO L87 Difference]: Start difference. First operand 1544 states. Second operand has 1542 states, 1541 states have (on average 1.4879948085658663) internal successors, (2293), 1541 states have internal predecessors, (2293), 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-20 18:52:11,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:11,503 INFO L93 Difference]: Finished difference Result 1544 states and 2294 transitions. [2022-02-20 18:52:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2294 transitions. [2022-02-20 18:52:11,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:11,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:11,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 1542 states, 1541 states have (on average 1.4879948085658663) internal successors, (2293), 1541 states have internal predecessors, (2293), 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 1544 states. [2022-02-20 18:52:11,508 INFO L87 Difference]: Start difference. First operand has 1542 states, 1541 states have (on average 1.4879948085658663) internal successors, (2293), 1541 states have internal predecessors, (2293), 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 1544 states. [2022-02-20 18:52:11,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:11,579 INFO L93 Difference]: Finished difference Result 1544 states and 2294 transitions. [2022-02-20 18:52:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2294 transitions. [2022-02-20 18:52:11,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:11,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:11,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:11,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:11,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 1.4879948085658663) internal successors, (2293), 1541 states have internal predecessors, (2293), 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-20 18:52:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2293 transitions. [2022-02-20 18:52:11,682 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2293 transitions. Word has length 53 [2022-02-20 18:52:11,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:11,682 INFO L470 AbstractCegarLoop]: Abstraction has 1542 states and 2293 transitions. [2022-02-20 18:52:11,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-20 18:52:11,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2293 transitions. [2022-02-20 18:52:11,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:52:11,683 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:11,683 INFO L514 BasicCegarLoop]: trace 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] [2022-02-20 18:52:11,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:52:11,683 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:11,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2042230043, now seen corresponding path program 1 times [2022-02-20 18:52:11,685 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:11,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3077563] [2022-02-20 18:52:11,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:11,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:11,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {41182#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~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];~__return_2928~0 := 0;~__return_3023~0 := 0;~__return_3091~0 := 0; {41184#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:11,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {41184#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {41184#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:11,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {41184#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {41184#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:11,757 INFO L290 TraceCheckUtils]: 3: Hoare triple {41184#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {41185#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:52:11,757 INFO L290 TraceCheckUtils]: 4: Hoare triple {41185#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {41185#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:52:11,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {41185#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {41186#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:11,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {41186#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0); {41183#false} is VALID [2022-02-20 18:52:11,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {41183#false} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {41183#false} is VALID [2022-02-20 18:52:11,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {41183#false} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {41183#false} is VALID [2022-02-20 18:52:11,771 INFO L290 TraceCheckUtils]: 31: Hoare triple {41183#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {41183#false} is VALID [2022-02-20 18:52:11,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {41183#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {41183#false} is VALID [2022-02-20 18:52:11,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {41183#false} assume !(~send2~0 != ~nomsg~0); {41183#false} is VALID [2022-02-20 18:52:11,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {41183#false} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {41183#false} is VALID [2022-02-20 18:52:11,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {41183#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {41183#false} is VALID [2022-02-20 18:52:11,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {41183#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {41183#false} is VALID [2022-02-20 18:52:11,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {41183#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {41183#false} is VALID [2022-02-20 18:52:11,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {41183#false} assume !(~send3~0 != ~nomsg~0); {41183#false} is VALID [2022-02-20 18:52:11,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {41183#false} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {41183#false} is VALID [2022-02-20 18:52:11,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {41183#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {41183#false} is VALID [2022-02-20 18:52:11,774 INFO L290 TraceCheckUtils]: 41: Hoare triple {41183#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {41183#false} is VALID [2022-02-20 18:52:11,774 INFO L290 TraceCheckUtils]: 42: Hoare triple {41183#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {41183#false} is VALID [2022-02-20 18:52:11,774 INFO L290 TraceCheckUtils]: 43: Hoare triple {41183#false} assume ~send4~0 != ~nomsg~0; {41183#false} is VALID [2022-02-20 18:52:11,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {41183#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {41183#false} is VALID [2022-02-20 18:52:11,774 INFO L290 TraceCheckUtils]: 45: Hoare triple {41183#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {41183#false} is VALID [2022-02-20 18:52:11,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {41183#false} ~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;havoc main_~check__tmp~0#1; {41183#false} is VALID [2022-02-20 18:52:11,774 INFO L290 TraceCheckUtils]: 47: Hoare triple {41183#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {41183#false} is VALID [2022-02-20 18:52:11,774 INFO L290 TraceCheckUtils]: 48: Hoare triple {41183#false} assume !(~r1~0 >= 4); {41183#false} is VALID [2022-02-20 18:52:11,775 INFO L290 TraceCheckUtils]: 49: Hoare triple {41183#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {41183#false} is VALID [2022-02-20 18:52:11,775 INFO L290 TraceCheckUtils]: 50: Hoare triple {41183#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1; {41183#false} is VALID [2022-02-20 18:52:11,775 INFO L290 TraceCheckUtils]: 51: Hoare triple {41183#false} ~__return_3023~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3023~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {41183#false} is VALID [2022-02-20 18:52:11,775 INFO L290 TraceCheckUtils]: 52: Hoare triple {41183#false} assume 0 == main_~assert__arg~0#1 % 256; {41183#false} is VALID [2022-02-20 18:52:11,775 INFO L290 TraceCheckUtils]: 53: Hoare triple {41183#false} assume !false; {41183#false} is VALID [2022-02-20 18:52:11,775 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-20 18:52:11,776 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:11,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3077563] [2022-02-20 18:52:11,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3077563] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:11,776 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:11,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:11,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296994411] [2022-02-20 18:52:11,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:11,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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) Word has length 54 [2022-02-20 18:52:11,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:11,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-20 18:52:11,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:11,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:11,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:11,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:11,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:11,805 INFO L87 Difference]: Start difference. First operand 1542 states and 2293 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-20 18:52:14,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:14,423 INFO L93 Difference]: Finished difference Result 3056 states and 4558 transitions. [2022-02-20 18:52:14,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:14,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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) Word has length 54 [2022-02-20 18:52:14,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-20 18:52:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2022-02-20 18:52:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-20 18:52:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2022-02-20 18:52:14,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 184 transitions. [2022-02-20 18:52:14,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:14,635 INFO L225 Difference]: With dead ends: 3056 [2022-02-20 18:52:14,636 INFO L226 Difference]: Without dead ends: 1542 [2022-02-20 18:52:14,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:14,642 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 273 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:14,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 67 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:14,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2022-02-20 18:52:16,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1542. [2022-02-20 18:52:16,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:16,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1542 states. Second operand has 1542 states, 1541 states have (on average 1.4672290720311485) internal successors, (2261), 1541 states have internal predecessors, (2261), 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-20 18:52:16,764 INFO L74 IsIncluded]: Start isIncluded. First operand 1542 states. Second operand has 1542 states, 1541 states have (on average 1.4672290720311485) internal successors, (2261), 1541 states have internal predecessors, (2261), 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-20 18:52:16,766 INFO L87 Difference]: Start difference. First operand 1542 states. Second operand has 1542 states, 1541 states have (on average 1.4672290720311485) internal successors, (2261), 1541 states have internal predecessors, (2261), 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-20 18:52:16,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:16,839 INFO L93 Difference]: Finished difference Result 1542 states and 2261 transitions. [2022-02-20 18:52:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2261 transitions. [2022-02-20 18:52:16,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:16,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:16,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 1542 states, 1541 states have (on average 1.4672290720311485) internal successors, (2261), 1541 states have internal predecessors, (2261), 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 1542 states. [2022-02-20 18:52:16,843 INFO L87 Difference]: Start difference. First operand has 1542 states, 1541 states have (on average 1.4672290720311485) internal successors, (2261), 1541 states have internal predecessors, (2261), 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 1542 states. [2022-02-20 18:52:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:16,913 INFO L93 Difference]: Finished difference Result 1542 states and 2261 transitions. [2022-02-20 18:52:16,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2261 transitions. [2022-02-20 18:52:16,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:16,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:16,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:16,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:16,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 1.4672290720311485) internal successors, (2261), 1541 states have internal predecessors, (2261), 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-20 18:52:17,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2261 transitions. [2022-02-20 18:52:17,021 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2261 transitions. Word has length 54 [2022-02-20 18:52:17,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:17,021 INFO L470 AbstractCegarLoop]: Abstraction has 1542 states and 2261 transitions. [2022-02-20 18:52:17,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-20 18:52:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2261 transitions. [2022-02-20 18:52:17,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:52:17,022 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:17,022 INFO L514 BasicCegarLoop]: trace 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] [2022-02-20 18:52:17,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:52:17,022 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:17,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:17,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1489873546, now seen corresponding path program 1 times [2022-02-20 18:52:17,023 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:17,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418831002] [2022-02-20 18:52:17,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:17,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:17,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {50749#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~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];~__return_2928~0 := 0;~__return_3023~0 := 0;~__return_3091~0 := 0; {50751#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {50751#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {50751#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {50751#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {50751#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,074 INFO L290 TraceCheckUtils]: 3: Hoare triple {50751#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {50751#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,074 INFO L290 TraceCheckUtils]: 4: Hoare triple {50751#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {50751#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {50751#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {50751#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {50751#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {50751#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {50751#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {50752#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:52:17,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {50752#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {50752#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:52:17,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {50752#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,081 INFO L290 TraceCheckUtils]: 27: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,081 INFO L290 TraceCheckUtils]: 28: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,082 INFO L290 TraceCheckUtils]: 30: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {50753#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:17,083 INFO L290 TraceCheckUtils]: 33: Hoare triple {50753#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0); {50750#false} is VALID [2022-02-20 18:52:17,083 INFO L290 TraceCheckUtils]: 34: Hoare triple {50750#false} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {50750#false} is VALID [2022-02-20 18:52:17,083 INFO L290 TraceCheckUtils]: 35: Hoare triple {50750#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {50750#false} is VALID [2022-02-20 18:52:17,083 INFO L290 TraceCheckUtils]: 36: Hoare triple {50750#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {50750#false} is VALID [2022-02-20 18:52:17,083 INFO L290 TraceCheckUtils]: 37: Hoare triple {50750#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {50750#false} is VALID [2022-02-20 18:52:17,083 INFO L290 TraceCheckUtils]: 38: Hoare triple {50750#false} assume !(~send3~0 != ~nomsg~0); {50750#false} is VALID [2022-02-20 18:52:17,084 INFO L290 TraceCheckUtils]: 39: Hoare triple {50750#false} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {50750#false} is VALID [2022-02-20 18:52:17,084 INFO L290 TraceCheckUtils]: 40: Hoare triple {50750#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {50750#false} is VALID [2022-02-20 18:52:17,084 INFO L290 TraceCheckUtils]: 41: Hoare triple {50750#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {50750#false} is VALID [2022-02-20 18:52:17,084 INFO L290 TraceCheckUtils]: 42: Hoare triple {50750#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {50750#false} is VALID [2022-02-20 18:52:17,084 INFO L290 TraceCheckUtils]: 43: Hoare triple {50750#false} assume ~send4~0 != ~nomsg~0; {50750#false} is VALID [2022-02-20 18:52:17,084 INFO L290 TraceCheckUtils]: 44: Hoare triple {50750#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {50750#false} is VALID [2022-02-20 18:52:17,084 INFO L290 TraceCheckUtils]: 45: Hoare triple {50750#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {50750#false} is VALID [2022-02-20 18:52:17,084 INFO L290 TraceCheckUtils]: 46: Hoare triple {50750#false} ~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;havoc main_~check__tmp~0#1; {50750#false} is VALID [2022-02-20 18:52:17,085 INFO L290 TraceCheckUtils]: 47: Hoare triple {50750#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {50750#false} is VALID [2022-02-20 18:52:17,085 INFO L290 TraceCheckUtils]: 48: Hoare triple {50750#false} assume !(~r1~0 >= 4); {50750#false} is VALID [2022-02-20 18:52:17,085 INFO L290 TraceCheckUtils]: 49: Hoare triple {50750#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {50750#false} is VALID [2022-02-20 18:52:17,085 INFO L290 TraceCheckUtils]: 50: Hoare triple {50750#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1; {50750#false} is VALID [2022-02-20 18:52:17,085 INFO L290 TraceCheckUtils]: 51: Hoare triple {50750#false} ~__return_3023~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3023~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {50750#false} is VALID [2022-02-20 18:52:17,085 INFO L290 TraceCheckUtils]: 52: Hoare triple {50750#false} assume 0 == main_~assert__arg~0#1 % 256; {50750#false} is VALID [2022-02-20 18:52:17,085 INFO L290 TraceCheckUtils]: 53: Hoare triple {50750#false} assume !false; {50750#false} is VALID [2022-02-20 18:52:17,085 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-20 18:52:17,086 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:17,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418831002] [2022-02-20 18:52:17,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418831002] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:17,086 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:17,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:17,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132664315] [2022-02-20 18:52:17,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:17,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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) Word has length 54 [2022-02-20 18:52:17,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:17,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-20 18:52:17,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:17,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:17,120 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:17,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:17,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:17,120 INFO L87 Difference]: Start difference. First operand 1542 states and 2261 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-20 18:52:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:19,457 INFO L93 Difference]: Finished difference Result 3056 states and 4494 transitions. [2022-02-20 18:52:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:19,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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) Word has length 54 [2022-02-20 18:52:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-20 18:52:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2022-02-20 18:52:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-20 18:52:19,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2022-02-20 18:52:19,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 182 transitions. [2022-02-20 18:52:19,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:19,669 INFO L225 Difference]: With dead ends: 3056 [2022-02-20 18:52:19,669 INFO L226 Difference]: Without dead ends: 1542 [2022-02-20 18:52:19,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:19,685 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 257 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:19,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:19,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2022-02-20 18:52:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1542. [2022-02-20 18:52:22,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:22,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1542 states. Second operand has 1542 states, 1541 states have (on average 1.4516547696301103) internal successors, (2237), 1541 states have internal predecessors, (2237), 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-20 18:52:22,421 INFO L74 IsIncluded]: Start isIncluded. First operand 1542 states. Second operand has 1542 states, 1541 states have (on average 1.4516547696301103) internal successors, (2237), 1541 states have internal predecessors, (2237), 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-20 18:52:22,422 INFO L87 Difference]: Start difference. First operand 1542 states. Second operand has 1542 states, 1541 states have (on average 1.4516547696301103) internal successors, (2237), 1541 states have internal predecessors, (2237), 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-20 18:52:22,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:22,491 INFO L93 Difference]: Finished difference Result 1542 states and 2237 transitions. [2022-02-20 18:52:22,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2237 transitions. [2022-02-20 18:52:22,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:22,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:22,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 1542 states, 1541 states have (on average 1.4516547696301103) internal successors, (2237), 1541 states have internal predecessors, (2237), 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 1542 states. [2022-02-20 18:52:22,495 INFO L87 Difference]: Start difference. First operand has 1542 states, 1541 states have (on average 1.4516547696301103) internal successors, (2237), 1541 states have internal predecessors, (2237), 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 1542 states. [2022-02-20 18:52:22,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:22,575 INFO L93 Difference]: Finished difference Result 1542 states and 2237 transitions. [2022-02-20 18:52:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2237 transitions. [2022-02-20 18:52:22,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:22,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:22,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:22,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:22,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 1.4516547696301103) internal successors, (2237), 1541 states have internal predecessors, (2237), 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-20 18:52:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2237 transitions. [2022-02-20 18:52:22,671 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2237 transitions. Word has length 54 [2022-02-20 18:52:22,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:22,671 INFO L470 AbstractCegarLoop]: Abstraction has 1542 states and 2237 transitions. [2022-02-20 18:52:22,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-20 18:52:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2237 transitions. [2022-02-20 18:52:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:52:22,672 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:22,672 INFO L514 BasicCegarLoop]: trace 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] [2022-02-20 18:52:22,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:52:22,672 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:22,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:22,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1617958853, now seen corresponding path program 1 times [2022-02-20 18:52:22,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:22,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769656200] [2022-02-20 18:52:22,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:22,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:22,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {60316#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~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];~__return_2928~0 := 0;~__return_3023~0 := 0;~__return_3091~0 := 0; {60318#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {60318#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {60318#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {60318#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {60318#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {60318#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {60318#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,716 INFO L290 TraceCheckUtils]: 4: Hoare triple {60318#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {60318#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {60318#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {60318#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {60318#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {60318#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {60318#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {60318#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {60318#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {60318#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {60318#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {60318#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {60318#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {60318#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {60318#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {60319#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:52:22,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {60319#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {60319#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:52:22,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {60319#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,724 INFO L290 TraceCheckUtils]: 33: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,725 INFO L290 TraceCheckUtils]: 34: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,726 INFO L290 TraceCheckUtils]: 37: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {60320#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:22,726 INFO L290 TraceCheckUtils]: 38: Hoare triple {60320#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0); {60317#false} is VALID [2022-02-20 18:52:22,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {60317#false} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {60317#false} is VALID [2022-02-20 18:52:22,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {60317#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {60317#false} is VALID [2022-02-20 18:52:22,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {60317#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {60317#false} is VALID [2022-02-20 18:52:22,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {60317#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {60317#false} is VALID [2022-02-20 18:52:22,727 INFO L290 TraceCheckUtils]: 43: Hoare triple {60317#false} assume ~send4~0 != ~nomsg~0; {60317#false} is VALID [2022-02-20 18:52:22,727 INFO L290 TraceCheckUtils]: 44: Hoare triple {60317#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {60317#false} is VALID [2022-02-20 18:52:22,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {60317#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {60317#false} is VALID [2022-02-20 18:52:22,727 INFO L290 TraceCheckUtils]: 46: Hoare triple {60317#false} ~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;havoc main_~check__tmp~0#1; {60317#false} is VALID [2022-02-20 18:52:22,727 INFO L290 TraceCheckUtils]: 47: Hoare triple {60317#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {60317#false} is VALID [2022-02-20 18:52:22,727 INFO L290 TraceCheckUtils]: 48: Hoare triple {60317#false} assume !(~r1~0 >= 4); {60317#false} is VALID [2022-02-20 18:52:22,727 INFO L290 TraceCheckUtils]: 49: Hoare triple {60317#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {60317#false} is VALID [2022-02-20 18:52:22,727 INFO L290 TraceCheckUtils]: 50: Hoare triple {60317#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1; {60317#false} is VALID [2022-02-20 18:52:22,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {60317#false} ~__return_3023~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3023~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {60317#false} is VALID [2022-02-20 18:52:22,728 INFO L290 TraceCheckUtils]: 52: Hoare triple {60317#false} assume 0 == main_~assert__arg~0#1 % 256; {60317#false} is VALID [2022-02-20 18:52:22,728 INFO L290 TraceCheckUtils]: 53: Hoare triple {60317#false} assume !false; {60317#false} is VALID [2022-02-20 18:52:22,728 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-20 18:52:22,728 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:22,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769656200] [2022-02-20 18:52:22,728 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769656200] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:22,729 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:22,729 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:22,729 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064684005] [2022-02-20 18:52:22,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:22,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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) Word has length 54 [2022-02-20 18:52:22,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:22,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-20 18:52:22,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:22,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:22,764 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:22,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:22,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:22,764 INFO L87 Difference]: Start difference. First operand 1542 states and 2237 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-20 18:52:26,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:26,322 INFO L93 Difference]: Finished difference Result 3056 states and 4446 transitions. [2022-02-20 18:52:26,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:26,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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) Word has length 54 [2022-02-20 18:52:26,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-20 18:52:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2022-02-20 18:52:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-20 18:52:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2022-02-20 18:52:26,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 180 transitions. [2022-02-20 18:52:26,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:26,528 INFO L225 Difference]: With dead ends: 3056 [2022-02-20 18:52:26,529 INFO L226 Difference]: Without dead ends: 1542 [2022-02-20 18:52:26,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:26,531 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 241 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:26,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 83 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:26,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2022-02-20 18:52:29,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1542. [2022-02-20 18:52:29,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:29,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1542 states. Second operand has 1542 states, 1541 states have (on average 1.4360804672290721) internal successors, (2213), 1541 states have internal predecessors, (2213), 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-20 18:52:29,566 INFO L74 IsIncluded]: Start isIncluded. First operand 1542 states. Second operand has 1542 states, 1541 states have (on average 1.4360804672290721) internal successors, (2213), 1541 states have internal predecessors, (2213), 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-20 18:52:29,567 INFO L87 Difference]: Start difference. First operand 1542 states. Second operand has 1542 states, 1541 states have (on average 1.4360804672290721) internal successors, (2213), 1541 states have internal predecessors, (2213), 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-20 18:52:29,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:29,645 INFO L93 Difference]: Finished difference Result 1542 states and 2213 transitions. [2022-02-20 18:52:29,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2213 transitions. [2022-02-20 18:52:29,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:29,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:29,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 1542 states, 1541 states have (on average 1.4360804672290721) internal successors, (2213), 1541 states have internal predecessors, (2213), 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 1542 states. [2022-02-20 18:52:29,649 INFO L87 Difference]: Start difference. First operand has 1542 states, 1541 states have (on average 1.4360804672290721) internal successors, (2213), 1541 states have internal predecessors, (2213), 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 1542 states. [2022-02-20 18:52:29,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:29,724 INFO L93 Difference]: Finished difference Result 1542 states and 2213 transitions. [2022-02-20 18:52:29,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2213 transitions. [2022-02-20 18:52:29,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:29,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:29,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:29,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:29,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 1.4360804672290721) internal successors, (2213), 1541 states have internal predecessors, (2213), 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-20 18:52:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2213 transitions. [2022-02-20 18:52:29,825 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2213 transitions. Word has length 54 [2022-02-20 18:52:29,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:29,825 INFO L470 AbstractCegarLoop]: Abstraction has 1542 states and 2213 transitions. [2022-02-20 18:52:29,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-20 18:52:29,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2213 transitions. [2022-02-20 18:52:29,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:52:29,826 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:29,826 INFO L514 BasicCegarLoop]: trace 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] [2022-02-20 18:52:29,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:52:29,826 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:29,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:29,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1811476054, now seen corresponding path program 1 times [2022-02-20 18:52:29,827 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:29,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530241526] [2022-02-20 18:52:29,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:29,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:29,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {69883#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~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];~__return_2928~0 := 0;~__return_3023~0 := 0;~__return_3091~0 := 0; {69883#true} is VALID [2022-02-20 18:52:29,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {69883#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {69883#true} is VALID [2022-02-20 18:52:29,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {69883#true} assume 0 == ~r1~0; {69883#true} is VALID [2022-02-20 18:52:29,899 INFO L290 TraceCheckUtils]: 3: Hoare triple {69883#true} assume ~id1~0 >= 0; {69883#true} is VALID [2022-02-20 18:52:29,899 INFO L290 TraceCheckUtils]: 4: Hoare triple {69883#true} assume 0 == ~st1~0; {69883#true} is VALID [2022-02-20 18:52:29,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {69883#true} assume ~send1~0 == ~id1~0; {69883#true} is VALID [2022-02-20 18:52:29,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {69883#true} assume 0 == ~mode1~0 % 256; {69883#true} is VALID [2022-02-20 18:52:29,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {69883#true} assume ~id2~0 >= 0; {69883#true} is VALID [2022-02-20 18:52:29,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {69883#true} assume 0 == ~st2~0; {69883#true} is VALID [2022-02-20 18:52:29,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {69883#true} assume ~send2~0 == ~id2~0; {69883#true} is VALID [2022-02-20 18:52:29,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {69883#true} assume 0 == ~mode2~0 % 256; {69883#true} is VALID [2022-02-20 18:52:29,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {69883#true} assume ~id3~0 >= 0; {69883#true} is VALID [2022-02-20 18:52:29,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {69883#true} assume 0 == ~st3~0; {69883#true} is VALID [2022-02-20 18:52:29,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {69883#true} assume ~send3~0 == ~id3~0; {69883#true} is VALID [2022-02-20 18:52:29,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {69883#true} assume 0 == ~mode3~0 % 256; {69883#true} is VALID [2022-02-20 18:52:29,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {69883#true} assume ~id4~0 >= 0; {69883#true} is VALID [2022-02-20 18:52:29,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {69883#true} assume 0 == ~st4~0; {69883#true} is VALID [2022-02-20 18:52:29,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {69883#true} assume ~send4~0 == ~id4~0; {69883#true} is VALID [2022-02-20 18:52:29,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {69883#true} assume 0 == ~mode4~0 % 256; {69883#true} is VALID [2022-02-20 18:52:29,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {69883#true} assume ~id1~0 != ~id2~0; {69883#true} is VALID [2022-02-20 18:52:29,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {69883#true} assume ~id1~0 != ~id3~0; {69883#true} is VALID [2022-02-20 18:52:29,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {69883#true} assume ~id1~0 != ~id4~0; {69883#true} is VALID [2022-02-20 18:52:29,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {69883#true} assume ~id2~0 != ~id3~0; {69883#true} is VALID [2022-02-20 18:52:29,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {69883#true} assume ~id2~0 != ~id4~0; {69883#true} is VALID [2022-02-20 18:52:29,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {69883#true} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {69885#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} is VALID [2022-02-20 18:52:29,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {69885#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0; {69883#true} is VALID [2022-02-20 18:52:29,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {69883#true} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {69883#true} is VALID [2022-02-20 18:52:29,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {69883#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {69883#true} is VALID [2022-02-20 18:52:29,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {69883#true} assume ~send1~0 != ~nomsg~0; {69883#true} is VALID [2022-02-20 18:52:29,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {69883#true} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {69883#true} is VALID [2022-02-20 18:52:29,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {69883#true} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {69883#true} is VALID [2022-02-20 18:52:29,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {69883#true} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {69883#true} is VALID [2022-02-20 18:52:29,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {69883#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {69883#true} is VALID [2022-02-20 18:52:29,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {69883#true} assume ~send2~0 != ~nomsg~0; {69883#true} is VALID [2022-02-20 18:52:29,903 INFO L290 TraceCheckUtils]: 34: Hoare triple {69883#true} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {69883#true} is VALID [2022-02-20 18:52:29,903 INFO L290 TraceCheckUtils]: 35: Hoare triple {69883#true} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {69883#true} is VALID [2022-02-20 18:52:29,903 INFO L290 TraceCheckUtils]: 36: Hoare triple {69883#true} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {69883#true} is VALID [2022-02-20 18:52:29,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {69883#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {69883#true} is VALID [2022-02-20 18:52:29,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {69883#true} assume ~send3~0 != ~nomsg~0; {69883#true} is VALID [2022-02-20 18:52:29,903 INFO L290 TraceCheckUtils]: 39: Hoare triple {69883#true} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {69883#true} is VALID [2022-02-20 18:52:29,903 INFO L290 TraceCheckUtils]: 40: Hoare triple {69883#true} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {69883#true} is VALID [2022-02-20 18:52:29,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {69883#true} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {69883#true} is VALID [2022-02-20 18:52:29,904 INFO L290 TraceCheckUtils]: 42: Hoare triple {69883#true} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {69883#true} is VALID [2022-02-20 18:52:29,904 INFO L290 TraceCheckUtils]: 43: Hoare triple {69883#true} assume ~send4~0 != ~nomsg~0; {69883#true} is VALID [2022-02-20 18:52:29,904 INFO L290 TraceCheckUtils]: 44: Hoare triple {69883#true} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {69883#true} is VALID [2022-02-20 18:52:29,904 INFO L290 TraceCheckUtils]: 45: Hoare triple {69883#true} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {69883#true} is VALID [2022-02-20 18:52:29,904 INFO L290 TraceCheckUtils]: 46: Hoare triple {69883#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;havoc main_~check__tmp~0#1; {69883#true} is VALID [2022-02-20 18:52:29,904 INFO L290 TraceCheckUtils]: 47: Hoare triple {69883#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {69883#true} is VALID [2022-02-20 18:52:29,904 INFO L290 TraceCheckUtils]: 48: Hoare triple {69883#true} assume !(~r1~0 >= 4); {69883#true} is VALID [2022-02-20 18:52:29,904 INFO L290 TraceCheckUtils]: 49: Hoare triple {69883#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {69883#true} is VALID [2022-02-20 18:52:29,905 INFO L290 TraceCheckUtils]: 50: Hoare triple {69883#true} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1; {69886#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} is VALID [2022-02-20 18:52:29,905 INFO L290 TraceCheckUtils]: 51: Hoare triple {69886#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} ~__return_3023~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3023~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {69887#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} is VALID [2022-02-20 18:52:29,906 INFO L290 TraceCheckUtils]: 52: Hoare triple {69887#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} assume 0 == main_~assert__arg~0#1 % 256; {69884#false} is VALID [2022-02-20 18:52:29,906 INFO L290 TraceCheckUtils]: 53: Hoare triple {69884#false} assume !false; {69884#false} is VALID [2022-02-20 18:52:29,906 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-20 18:52:29,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:29,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530241526] [2022-02-20 18:52:29,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530241526] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:29,906 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:29,907 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:52:29,907 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466069777] [2022-02-20 18:52:29,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:29,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) Word has length 54 [2022-02-20 18:52:29,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:29,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-20 18:52:29,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:29,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:29,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:29,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:29,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:29,935 INFO L87 Difference]: Start difference. First operand 1542 states and 2213 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-20 18:52:34,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:34,661 INFO L93 Difference]: Finished difference Result 2776 states and 3973 transitions. [2022-02-20 18:52:34,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:52:34,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) Word has length 54 [2022-02-20 18:52:34,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-20 18:52:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2022-02-20 18:52:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-20 18:52:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2022-02-20 18:52:34,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 180 transitions. [2022-02-20 18:52:34,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:35,051 INFO L225 Difference]: With dead ends: 2776 [2022-02-20 18:52:35,051 INFO L226 Difference]: Without dead ends: 2774 [2022-02-20 18:52:35,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:35,053 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 136 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:35,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 457 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:35,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2022-02-20 18:52:37,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 1606. [2022-02-20 18:52:37,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:37,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2774 states. Second operand has 1606 states, 1605 states have (on average 1.4137071651090343) internal successors, (2269), 1605 states have internal predecessors, (2269), 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-20 18:52:37,458 INFO L74 IsIncluded]: Start isIncluded. First operand 2774 states. Second operand has 1606 states, 1605 states have (on average 1.4137071651090343) internal successors, (2269), 1605 states have internal predecessors, (2269), 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-20 18:52:37,459 INFO L87 Difference]: Start difference. First operand 2774 states. Second operand has 1606 states, 1605 states have (on average 1.4137071651090343) internal successors, (2269), 1605 states have internal predecessors, (2269), 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-20 18:52:37,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:37,669 INFO L93 Difference]: Finished difference Result 2774 states and 3932 transitions. [2022-02-20 18:52:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 3932 transitions. [2022-02-20 18:52:37,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:37,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:37,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 1606 states, 1605 states have (on average 1.4137071651090343) internal successors, (2269), 1605 states have internal predecessors, (2269), 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 2774 states. [2022-02-20 18:52:37,675 INFO L87 Difference]: Start difference. First operand has 1606 states, 1605 states have (on average 1.4137071651090343) internal successors, (2269), 1605 states have internal predecessors, (2269), 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 2774 states. [2022-02-20 18:52:37,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:37,905 INFO L93 Difference]: Finished difference Result 2774 states and 3932 transitions. [2022-02-20 18:52:37,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 3932 transitions. [2022-02-20 18:52:37,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:37,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:37,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:37,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:37,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.4137071651090343) internal successors, (2269), 1605 states have internal predecessors, (2269), 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-20 18:52:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2269 transitions. [2022-02-20 18:52:38,022 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2269 transitions. Word has length 54 [2022-02-20 18:52:38,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:38,022 INFO L470 AbstractCegarLoop]: Abstraction has 1606 states and 2269 transitions. [2022-02-20 18:52:38,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-20 18:52:38,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2269 transitions. [2022-02-20 18:52:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:52:38,026 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:38,026 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 18:52:38,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:52:38,027 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:38,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:38,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1690284398, now seen corresponding path program 1 times [2022-02-20 18:52:38,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:38,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405679135] [2022-02-20 18:52:38,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:38,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:38,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {81659#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~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];~__return_2928~0 := 0;~__return_3023~0 := 0;~__return_3091~0 := 0; {81659#true} is VALID [2022-02-20 18:52:38,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {81659#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {81659#true} is VALID [2022-02-20 18:52:38,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {81659#true} assume 0 == ~r1~0; {81659#true} is VALID [2022-02-20 18:52:38,179 INFO L290 TraceCheckUtils]: 3: Hoare triple {81659#true} assume ~id1~0 >= 0; {81659#true} is VALID [2022-02-20 18:52:38,179 INFO L290 TraceCheckUtils]: 4: Hoare triple {81659#true} assume 0 == ~st1~0; {81659#true} is VALID [2022-02-20 18:52:38,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {81659#true} assume ~send1~0 == ~id1~0; {81659#true} is VALID [2022-02-20 18:52:38,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {81659#true} assume 0 == ~mode1~0 % 256; {81659#true} is VALID [2022-02-20 18:52:38,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {81659#true} assume ~id2~0 >= 0; {81659#true} is VALID [2022-02-20 18:52:38,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {81659#true} assume 0 == ~st2~0; {81661#(<= ~st2~0 0)} is VALID [2022-02-20 18:52:38,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {81661#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {81661#(<= ~st2~0 0)} is VALID [2022-02-20 18:52:38,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {81661#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {81661#(<= ~st2~0 0)} is VALID [2022-02-20 18:52:38,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {81661#(<= ~st2~0 0)} assume ~id3~0 >= 0; {81661#(<= ~st2~0 0)} is VALID [2022-02-20 18:52:38,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {81661#(<= ~st2~0 0)} assume 0 == ~st3~0; {81662#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {81662#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {81662#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {81662#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {81662#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {81662#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id4~0 >= 0; {81662#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {81662#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~st4~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~send4~0 == ~id4~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~mode4~0 % 256; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id4~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id4~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~send1~0 != ~nomsg~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,187 INFO L290 TraceCheckUtils]: 31: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~send2~0 != ~nomsg~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,188 INFO L290 TraceCheckUtils]: 34: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,189 INFO L290 TraceCheckUtils]: 38: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~send3~0 != ~nomsg~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,190 INFO L290 TraceCheckUtils]: 39: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~send4~0 != ~nomsg~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,192 INFO L290 TraceCheckUtils]: 46: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} ~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;havoc main_~check__tmp~0#1; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,192 INFO L290 TraceCheckUtils]: 47: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,192 INFO L290 TraceCheckUtils]: 48: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~r1~0 >= 4); {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,193 INFO L290 TraceCheckUtils]: 49: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,193 INFO L290 TraceCheckUtils]: 50: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,193 INFO L290 TraceCheckUtils]: 51: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} ~__return_3023~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3023~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,194 INFO L290 TraceCheckUtils]: 52: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,194 INFO L290 TraceCheckUtils]: 53: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,194 INFO L290 TraceCheckUtils]: 54: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~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);main_~node1__m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,195 INFO L290 TraceCheckUtils]: 55: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~node1__m1~0#1 != ~nomsg~0; {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,195 INFO L290 TraceCheckUtils]: 56: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~0#1 > ~id1~0); {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:38,195 INFO L290 TraceCheckUtils]: 57: Hoare triple {81663#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~node1__m1~0#1 == ~id1~0;~st1~0 := 1; {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:38,196 INFO L290 TraceCheckUtils]: 58: Hoare triple {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~mode1~0 := 0; {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:38,196 INFO L290 TraceCheckUtils]: 59: Hoare triple {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:38,196 INFO L290 TraceCheckUtils]: 60: Hoare triple {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:38,197 INFO L290 TraceCheckUtils]: 61: Hoare triple {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~0#1 != ~nomsg~0); {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:38,197 INFO L290 TraceCheckUtils]: 62: Hoare triple {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~mode2~0 := 0; {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:38,197 INFO L290 TraceCheckUtils]: 63: Hoare triple {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:38,198 INFO L290 TraceCheckUtils]: 64: Hoare triple {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:38,198 INFO L290 TraceCheckUtils]: 65: Hoare triple {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~0#1 != ~nomsg~0); {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:38,198 INFO L290 TraceCheckUtils]: 66: Hoare triple {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~mode3~0 := 0; {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:38,199 INFO L290 TraceCheckUtils]: 67: Hoare triple {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:38,199 INFO L290 TraceCheckUtils]: 68: Hoare triple {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:38,199 INFO L290 TraceCheckUtils]: 69: Hoare triple {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node4__m4~0#1 != ~nomsg~0); {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:38,200 INFO L290 TraceCheckUtils]: 70: Hoare triple {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~mode4~0 := 0; {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:38,200 INFO L290 TraceCheckUtils]: 71: Hoare triple {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~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;havoc main_~check__tmp~0#1; {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:38,201 INFO L290 TraceCheckUtils]: 72: Hoare triple {81664#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {81660#false} is VALID [2022-02-20 18:52:38,201 INFO L290 TraceCheckUtils]: 73: Hoare triple {81660#false} ~__return_3023~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3023~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {81660#false} is VALID [2022-02-20 18:52:38,201 INFO L290 TraceCheckUtils]: 74: Hoare triple {81660#false} assume 0 == main_~assert__arg~0#1 % 256; {81660#false} is VALID [2022-02-20 18:52:38,201 INFO L290 TraceCheckUtils]: 75: Hoare triple {81660#false} assume !false; {81660#false} is VALID [2022-02-20 18:52:38,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:52:38,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:38,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405679135] [2022-02-20 18:52:38,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405679135] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:38,202 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:38,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:52:38,202 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542429634] [2022-02-20 18:52:38,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:38,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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) Word has length 76 [2022-02-20 18:52:38,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:38,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-20 18:52:38,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:38,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:52:38,251 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:38,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:52:38,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:38,252 INFO L87 Difference]: Start difference. First operand 1606 states and 2269 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-20 18:52:52,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:52,731 INFO L93 Difference]: Finished difference Result 7736 states and 10978 transitions. [2022-02-20 18:52:52,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:52:52,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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) Word has length 76 [2022-02-20 18:52:52,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-20 18:52:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 479 transitions. [2022-02-20 18:52:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-20 18:52:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 479 transitions. [2022-02-20 18:52:52,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 479 transitions. [2022-02-20 18:52:52,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:54,791 INFO L225 Difference]: With dead ends: 7736 [2022-02-20 18:52:54,791 INFO L226 Difference]: Without dead ends: 6646 [2022-02-20 18:52:54,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:54,793 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 472 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:54,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 530 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:54,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6646 states. [2022-02-20 18:52:59,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6646 to 2942. [2022-02-20 18:52:59,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:59,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6646 states. Second operand has 2942 states, 2941 states have (on average 1.4107446446786807) internal successors, (4149), 2941 states have internal predecessors, (4149), 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-20 18:52:59,953 INFO L74 IsIncluded]: Start isIncluded. First operand 6646 states. Second operand has 2942 states, 2941 states have (on average 1.4107446446786807) internal successors, (4149), 2941 states have internal predecessors, (4149), 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-20 18:52:59,955 INFO L87 Difference]: Start difference. First operand 6646 states. Second operand has 2942 states, 2941 states have (on average 1.4107446446786807) internal successors, (4149), 2941 states have internal predecessors, (4149), 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-20 18:53:01,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:01,325 INFO L93 Difference]: Finished difference Result 6646 states and 9393 transitions. [2022-02-20 18:53:01,325 INFO L276 IsEmpty]: Start isEmpty. Operand 6646 states and 9393 transitions. [2022-02-20 18:53:01,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:01,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:01,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 2942 states, 2941 states have (on average 1.4107446446786807) internal successors, (4149), 2941 states have internal predecessors, (4149), 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 6646 states. [2022-02-20 18:53:01,336 INFO L87 Difference]: Start difference. First operand has 2942 states, 2941 states have (on average 1.4107446446786807) internal successors, (4149), 2941 states have internal predecessors, (4149), 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 6646 states. [2022-02-20 18:53:02,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:02,719 INFO L93 Difference]: Finished difference Result 6646 states and 9393 transitions. [2022-02-20 18:53:02,719 INFO L276 IsEmpty]: Start isEmpty. Operand 6646 states and 9393 transitions. [2022-02-20 18:53:02,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:02,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:02,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:02,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:02,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2942 states, 2941 states have (on average 1.4107446446786807) internal successors, (4149), 2941 states have internal predecessors, (4149), 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-20 18:53:03,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2942 states and 4149 transitions. [2022-02-20 18:53:03,089 INFO L78 Accepts]: Start accepts. Automaton has 2942 states and 4149 transitions. Word has length 76 [2022-02-20 18:53:03,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:03,090 INFO L470 AbstractCegarLoop]: Abstraction has 2942 states and 4149 transitions. [2022-02-20 18:53:03,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-20 18:53:03,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2942 states and 4149 transitions. [2022-02-20 18:53:03,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:53:03,091 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:03,091 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 18:53:03,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:53:03,091 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:03,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:03,092 INFO L85 PathProgramCache]: Analyzing trace with hash -34257664, now seen corresponding path program 1 times [2022-02-20 18:53:03,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:03,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501717326] [2022-02-20 18:53:03,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:03,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:03,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {110054#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~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];~__return_2928~0 := 0;~__return_3023~0 := 0;~__return_3091~0 := 0; {110054#true} is VALID [2022-02-20 18:53:03,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {110054#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {110054#true} is VALID [2022-02-20 18:53:03,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {110054#true} assume 0 == ~r1~0; {110054#true} is VALID [2022-02-20 18:53:03,145 INFO L290 TraceCheckUtils]: 3: Hoare triple {110054#true} assume ~id1~0 >= 0; {110054#true} is VALID [2022-02-20 18:53:03,145 INFO L290 TraceCheckUtils]: 4: Hoare triple {110054#true} assume 0 == ~st1~0; {110056#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:03,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {110056#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {110056#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:03,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {110056#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {110056#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:03,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {110056#(<= ~st1~0 0)} assume ~id2~0 >= 0; {110056#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:03,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {110056#(<= ~st1~0 0)} assume 0 == ~st2~0; {110057#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {110057#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {110057#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {110057#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {110057#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {110057#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {110057#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {110057#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,154 INFO L290 TraceCheckUtils]: 35: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,158 INFO L290 TraceCheckUtils]: 40: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,158 INFO L290 TraceCheckUtils]: 41: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,158 INFO L290 TraceCheckUtils]: 42: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,158 INFO L290 TraceCheckUtils]: 43: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,159 INFO L290 TraceCheckUtils]: 45: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,159 INFO L290 TraceCheckUtils]: 46: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~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;havoc main_~check__tmp~0#1; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,159 INFO L290 TraceCheckUtils]: 47: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,160 INFO L290 TraceCheckUtils]: 48: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 4); {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,160 INFO L290 TraceCheckUtils]: 49: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,160 INFO L290 TraceCheckUtils]: 50: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,161 INFO L290 TraceCheckUtils]: 51: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~__return_3023~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3023~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,161 INFO L290 TraceCheckUtils]: 52: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,161 INFO L290 TraceCheckUtils]: 53: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,161 INFO L290 TraceCheckUtils]: 54: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~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);main_~node1__m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,162 INFO L290 TraceCheckUtils]: 55: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~0#1 != ~nomsg~0); {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,162 INFO L290 TraceCheckUtils]: 56: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,162 INFO L290 TraceCheckUtils]: 57: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,162 INFO L290 TraceCheckUtils]: 58: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,163 INFO L290 TraceCheckUtils]: 59: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~0#1 != ~nomsg~0); {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,163 INFO L290 TraceCheckUtils]: 60: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,163 INFO L290 TraceCheckUtils]: 61: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,164 INFO L290 TraceCheckUtils]: 62: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,164 INFO L290 TraceCheckUtils]: 63: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~0#1 != ~nomsg~0); {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,164 INFO L290 TraceCheckUtils]: 64: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,164 INFO L290 TraceCheckUtils]: 65: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,165 INFO L290 TraceCheckUtils]: 66: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,165 INFO L290 TraceCheckUtils]: 67: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node4__m4~0#1 != ~nomsg~0; {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,165 INFO L290 TraceCheckUtils]: 68: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~0#1 > ~id4~0); {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:03,166 INFO L290 TraceCheckUtils]: 69: Hoare triple {110058#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node4__m4~0#1 == ~id4~0;~st4~0 := 1; {110059#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:03,166 INFO L290 TraceCheckUtils]: 70: Hoare triple {110059#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} ~mode4~0 := 0; {110059#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:03,166 INFO L290 TraceCheckUtils]: 71: Hoare triple {110059#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} ~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;havoc main_~check__tmp~0#1; {110059#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:03,167 INFO L290 TraceCheckUtils]: 72: Hoare triple {110059#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {110055#false} is VALID [2022-02-20 18:53:03,167 INFO L290 TraceCheckUtils]: 73: Hoare triple {110055#false} ~__return_3023~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3023~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {110055#false} is VALID [2022-02-20 18:53:03,167 INFO L290 TraceCheckUtils]: 74: Hoare triple {110055#false} assume 0 == main_~assert__arg~0#1 % 256; {110055#false} is VALID [2022-02-20 18:53:03,167 INFO L290 TraceCheckUtils]: 75: Hoare triple {110055#false} assume !false; {110055#false} is VALID [2022-02-20 18:53:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 18:53:03,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:03,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501717326] [2022-02-20 18:53:03,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501717326] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:03,168 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:03,168 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:53:03,168 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543986211] [2022-02-20 18:53:03,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:03,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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) Word has length 76 [2022-02-20 18:53:03,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:03,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-20 18:53:03,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:03,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:53:03,214 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:03,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:53:03,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:53:03,215 INFO L87 Difference]: Start difference. First operand 2942 states and 4149 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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)