./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.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/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.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 c5be25d34b5f565c0e61b447a9da3cd9d228084b5ddd898e062981f46972caa8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:27:28,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:27:28,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:27:28,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:27:28,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:27:28,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:27:28,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:27:28,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:27:28,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:27:28,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:27:28,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:27:28,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:27:28,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:27:28,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:27:28,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:27:28,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:27:28,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:27:28,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:27:28,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:27:28,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:27:28,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:27:28,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:27:28,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:27:28,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:27:28,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:27:28,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:27:28,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:27:28,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:27:28,375 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:27:28,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:27:28,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:27:28,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:27:28,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:27:28,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:27:28,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:27:28,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:27:28,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:27:28,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:27:28,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:27:28,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:27:28,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:27:28,382 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:27:28,403 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:27:28,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:27:28,403 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:27:28,404 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:27:28,404 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:27:28,404 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:27:28,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:27:28,405 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:27:28,405 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:27:28,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:27:28,406 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:27:28,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:27:28,406 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:27:28,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:27:28,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:27:28,407 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:27:28,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:27:28,407 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:27:28,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:27:28,407 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:27:28,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:27:28,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:27:28,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:27:28,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:27:28,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:27:28,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:27:28,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:27:28,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:27:28,409 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:27:28,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:27:28,409 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:27:28,409 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:27:28,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:27:28,410 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 -> c5be25d34b5f565c0e61b447a9da3cd9d228084b5ddd898e062981f46972caa8 [2022-02-20 18:27:28,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:27:28,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:27:28,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:27:28,658 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:27:28,658 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:27:28,659 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c [2022-02-20 18:27:28,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8c564a7b/049f80e275a94e26b8e9a9000dce5566/FLAG0db25c4ab [2022-02-20 18:27:29,060 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:27:29,060 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c [2022-02-20 18:27:29,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8c564a7b/049f80e275a94e26b8e9a9000dce5566/FLAG0db25c4ab [2022-02-20 18:27:29,459 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8c564a7b/049f80e275a94e26b8e9a9000dce5566 [2022-02-20 18:27:29,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:27:29,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:27:29,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:27:29,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:27:29,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:27:29,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:27:29" (1/1) ... [2022-02-20 18:27:29,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b38fc97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:29, skipping insertion in model container [2022-02-20 18:27:29,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:27:29" (1/1) ... [2022-02-20 18:27:29,474 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:27:29,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:27:29,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c[9280,9293] [2022-02-20 18:27:29,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:27:29,666 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:27:29,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c[9280,9293] [2022-02-20 18:27:29,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:27:29,706 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:27:29,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:29 WrapperNode [2022-02-20 18:27:29,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:27:29,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:27:29,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:27:29,708 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:27:29,712 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:27:29" (1/1) ... [2022-02-20 18:27:29,718 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:27:29" (1/1) ... [2022-02-20 18:27:29,744 INFO L137 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 313 [2022-02-20 18:27:29,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:27:29,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:27:29,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:27:29,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:27:29,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:29" (1/1) ... [2022-02-20 18:27:29,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:29" (1/1) ... [2022-02-20 18:27:29,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:29" (1/1) ... [2022-02-20 18:27:29,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:29" (1/1) ... [2022-02-20 18:27:29,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:29" (1/1) ... [2022-02-20 18:27:29,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:29" (1/1) ... [2022-02-20 18:27:29,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:29" (1/1) ... [2022-02-20 18:27:29,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:27:29,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:27:29,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:27:29,765 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:27:29,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:29" (1/1) ... [2022-02-20 18:27:29,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:27:29,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:27:29,787 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:27:29,789 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:27:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:27:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:27:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:27:29,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:27:29,869 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:27:29,870 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:27:30,214 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:27:30,219 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:27:30,219 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:27:30,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:27:30 BoogieIcfgContainer [2022-02-20 18:27:30,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:27:30,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:27:30,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:27:30,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:27:30,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:27:29" (1/3) ... [2022-02-20 18:27:30,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b1594a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:27:30, skipping insertion in model container [2022-02-20 18:27:30,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:29" (2/3) ... [2022-02-20 18:27:30,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b1594a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:27:30, skipping insertion in model container [2022-02-20 18:27:30,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:27:30" (3/3) ... [2022-02-20 18:27:30,226 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c [2022-02-20 18:27:30,229 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:27:30,229 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:27:30,256 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:27:30,260 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:27:30,261 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:27:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 95 states have (on average 1.694736842105263) internal successors, (161), 96 states have internal predecessors, (161), 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:27:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 18:27:30,277 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:30,277 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] [2022-02-20 18:27:30,278 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:30,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:30,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1799424214, now seen corresponding path program 1 times [2022-02-20 18:27:30,287 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:30,287 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259097053] [2022-02-20 18:27:30,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:30,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:30,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {100#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0; {100#true} is VALID [2022-02-20 18:27:30,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_#t~post34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {100#true} is VALID [2022-02-20 18:27:30,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {100#true} is VALID [2022-02-20 18:27:30,462 INFO L290 TraceCheckUtils]: 3: Hoare triple {100#true} init_#res#1 := init_~tmp~0#1; {100#true} is VALID [2022-02-20 18:27:30,463 INFO L290 TraceCheckUtils]: 4: Hoare triple {100#true} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {100#true} is VALID [2022-02-20 18:27:30,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {100#true} assume 0 == main_~i2~0#1;assume false; {101#false} is VALID [2022-02-20 18:27:30,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {101#false} ~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_~i2~0#1 := 0; {101#false} is VALID [2022-02-20 18:27:30,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {101#false} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {101#false} is VALID [2022-02-20 18:27:30,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {101#false} assume !(0 != ~mode1~0 % 256); {101#false} is VALID [2022-02-20 18:27:30,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {101#false} assume !(0 != ~alive1~0 % 256); {101#false} is VALID [2022-02-20 18:27:30,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {101#false} ~mode1~0 := 1; {101#false} is VALID [2022-02-20 18:27:30,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {101#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {101#false} is VALID [2022-02-20 18:27:30,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {101#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {101#false} is VALID [2022-02-20 18:27:30,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {101#false} assume !(node2_~m2~0#1 != ~nomsg~0); {101#false} is VALID [2022-02-20 18:27:30,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {101#false} ~mode2~0 := 0; {101#false} is VALID [2022-02-20 18:27:30,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {101#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {101#false} is VALID [2022-02-20 18:27:30,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {101#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {101#false} is VALID [2022-02-20 18:27:30,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {101#false} assume !(node3_~m3~0#1 != ~nomsg~0); {101#false} is VALID [2022-02-20 18:27:30,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {101#false} ~mode3~0 := 0; {101#false} is VALID [2022-02-20 18:27:30,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {101#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {101#false} is VALID [2022-02-20 18:27:30,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {101#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {101#false} is VALID [2022-02-20 18:27:30,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {101#false} assume !(node4_~m4~0#1 != ~nomsg~0); {101#false} is VALID [2022-02-20 18:27:30,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {101#false} ~mode4~0 := 0; {101#false} is VALID [2022-02-20 18:27:30,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {101#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {101#false} is VALID [2022-02-20 18:27:30,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {101#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {101#false} is VALID [2022-02-20 18:27:30,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {101#false} check_#res#1 := check_~tmp~1#1; {101#false} is VALID [2022-02-20 18:27:30,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {101#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {101#false} is VALID [2022-02-20 18:27:30,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {101#false} assume 0 == assert_~arg#1 % 256; {101#false} is VALID [2022-02-20 18:27:30,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {101#false} assume !false; {101#false} is VALID [2022-02-20 18:27:30,474 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:27:30,475 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:30,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259097053] [2022-02-20 18:27:30,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259097053] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:30,476 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:30,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:27:30,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053111519] [2022-02-20 18:27:30,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:30,481 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 29 [2022-02-20 18:27:30,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:30,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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:27:30,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:30,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:27:30,512 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:30,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:27:30,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:27:30,532 INFO L87 Difference]: Start difference. First operand has 97 states, 95 states have (on average 1.694736842105263) internal successors, (161), 96 states have internal predecessors, (161), 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 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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:27:30,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:30,649 INFO L93 Difference]: Finished difference Result 165 states and 268 transitions. [2022-02-20 18:27:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:27:30,649 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 29 [2022-02-20 18:27:30,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:30,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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:27:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 268 transitions. [2022-02-20 18:27:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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:27:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 268 transitions. [2022-02-20 18:27:30,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 268 transitions. [2022-02-20 18:27:30,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:30,838 INFO L225 Difference]: With dead ends: 165 [2022-02-20 18:27:30,838 INFO L226 Difference]: Without dead ends: 93 [2022-02-20 18:27:30,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:27:30,842 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:30,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:30,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-20 18:27:30,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-02-20 18:27:30,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:30,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 92 states have (on average 1.673913043478261) internal successors, (154), 92 states have internal predecessors, (154), 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:27:30,865 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 92 states have (on average 1.673913043478261) internal successors, (154), 92 states have internal predecessors, (154), 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:27:30,865 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 92 states have (on average 1.673913043478261) internal successors, (154), 92 states have internal predecessors, (154), 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:27:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:30,870 INFO L93 Difference]: Finished difference Result 93 states and 154 transitions. [2022-02-20 18:27:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 154 transitions. [2022-02-20 18:27:30,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:30,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:30,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 92 states have (on average 1.673913043478261) internal successors, (154), 92 states have internal predecessors, (154), 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 93 states. [2022-02-20 18:27:30,872 INFO L87 Difference]: Start difference. First operand has 93 states, 92 states have (on average 1.673913043478261) internal successors, (154), 92 states have internal predecessors, (154), 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 93 states. [2022-02-20 18:27:30,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:30,877 INFO L93 Difference]: Finished difference Result 93 states and 154 transitions. [2022-02-20 18:27:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 154 transitions. [2022-02-20 18:27:30,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:30,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:30,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:30,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:30,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.673913043478261) internal successors, (154), 92 states have internal predecessors, (154), 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:27:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 154 transitions. [2022-02-20 18:27:30,882 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 154 transitions. Word has length 29 [2022-02-20 18:27:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:30,882 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 154 transitions. [2022-02-20 18:27:30,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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:27:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 154 transitions. [2022-02-20 18:27:30,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 18:27:30,884 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:30,884 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] [2022-02-20 18:27:30,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:27:30,884 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:30,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:30,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1665410708, now seen corresponding path program 1 times [2022-02-20 18:27:30,885 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:30,885 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022375630] [2022-02-20 18:27:30,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:30,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:30,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {570#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0; {570#true} is VALID [2022-02-20 18:27:30,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {570#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_#t~post34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {570#true} is VALID [2022-02-20 18:27:30,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {570#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {572#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:27:30,960 INFO L290 TraceCheckUtils]: 3: Hoare triple {572#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {573#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:27:30,961 INFO L290 TraceCheckUtils]: 4: Hoare triple {573#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {574#(= |ULTIMATE.start_main_~i2~0#1| 0)} is VALID [2022-02-20 18:27:30,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {574#(= |ULTIMATE.start_main_~i2~0#1| 0)} assume !(0 == main_~i2~0#1); {571#false} is VALID [2022-02-20 18:27:30,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {571#false} ~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_~i2~0#1 := 0; {571#false} is VALID [2022-02-20 18:27:30,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {571#false} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {571#false} is VALID [2022-02-20 18:27:30,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {571#false} assume !(0 != ~mode1~0 % 256); {571#false} is VALID [2022-02-20 18:27:30,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#false} assume !(0 != ~alive1~0 % 256); {571#false} is VALID [2022-02-20 18:27:30,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {571#false} ~mode1~0 := 1; {571#false} is VALID [2022-02-20 18:27:30,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {571#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {571#false} is VALID [2022-02-20 18:27:30,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {571#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {571#false} is VALID [2022-02-20 18:27:30,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {571#false} assume !(node2_~m2~0#1 != ~nomsg~0); {571#false} is VALID [2022-02-20 18:27:30,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {571#false} ~mode2~0 := 0; {571#false} is VALID [2022-02-20 18:27:30,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {571#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {571#false} is VALID [2022-02-20 18:27:30,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {571#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {571#false} is VALID [2022-02-20 18:27:30,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {571#false} assume !(node3_~m3~0#1 != ~nomsg~0); {571#false} is VALID [2022-02-20 18:27:30,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {571#false} ~mode3~0 := 0; {571#false} is VALID [2022-02-20 18:27:30,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {571#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {571#false} is VALID [2022-02-20 18:27:30,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {571#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {571#false} is VALID [2022-02-20 18:27:30,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {571#false} assume !(node4_~m4~0#1 != ~nomsg~0); {571#false} is VALID [2022-02-20 18:27:30,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {571#false} ~mode4~0 := 0; {571#false} is VALID [2022-02-20 18:27:30,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {571#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {571#false} is VALID [2022-02-20 18:27:30,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {571#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {571#false} is VALID [2022-02-20 18:27:30,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {571#false} check_#res#1 := check_~tmp~1#1; {571#false} is VALID [2022-02-20 18:27:30,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {571#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {571#false} is VALID [2022-02-20 18:27:30,979 INFO L290 TraceCheckUtils]: 27: Hoare triple {571#false} assume 0 == assert_~arg#1 % 256; {571#false} is VALID [2022-02-20 18:27:30,979 INFO L290 TraceCheckUtils]: 28: Hoare triple {571#false} assume !false; {571#false} is VALID [2022-02-20 18:27:30,979 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:27:30,979 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:30,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022375630] [2022-02-20 18:27:30,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022375630] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:30,980 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:30,980 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:27:30,980 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768062832] [2022-02-20 18:27:30,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:30,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 29 [2022-02-20 18:27:30,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:30,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:27:31,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:31,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:27:31,002 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:31,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:27:31,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:27:31,003 INFO L87 Difference]: Start difference. First operand 93 states and 154 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:27:31,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:31,303 INFO L93 Difference]: Finished difference Result 223 states and 358 transitions. [2022-02-20 18:27:31,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:27:31,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 29 [2022-02-20 18:27:31,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:27:31,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 358 transitions. [2022-02-20 18:27:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:27:31,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 358 transitions. [2022-02-20 18:27:31,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 358 transitions. [2022-02-20 18:27:31,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 358 edges. 358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:31,539 INFO L225 Difference]: With dead ends: 223 [2022-02-20 18:27:31,539 INFO L226 Difference]: Without dead ends: 156 [2022-02-20 18:27:31,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:27:31,541 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 102 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:31,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 571 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:31,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-02-20 18:27:31,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 93. [2022-02-20 18:27:31,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:31,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 93 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 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:27:31,547 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 93 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 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:27:31,548 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 93 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 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:27:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:31,551 INFO L93 Difference]: Finished difference Result 156 states and 230 transitions. [2022-02-20 18:27:31,552 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 230 transitions. [2022-02-20 18:27:31,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:31,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:31,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 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 156 states. [2022-02-20 18:27:31,553 INFO L87 Difference]: Start difference. First operand has 93 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 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 156 states. [2022-02-20 18:27:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:31,557 INFO L93 Difference]: Finished difference Result 156 states and 230 transitions. [2022-02-20 18:27:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 230 transitions. [2022-02-20 18:27:31,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:31,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:31,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:31,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 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:27:31,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2022-02-20 18:27:31,560 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 29 [2022-02-20 18:27:31,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:31,560 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2022-02-20 18:27:31,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:27:31,561 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2022-02-20 18:27:31,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:27:31,562 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:31,562 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] [2022-02-20 18:27:31,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:27:31,562 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:31,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:31,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1640520051, now seen corresponding path program 1 times [2022-02-20 18:27:31,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:31,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862339231] [2022-02-20 18:27:31,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:31,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:31,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {1236#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0; {1236#true} is VALID [2022-02-20 18:27:31,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {1236#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_#t~post34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1236#true} is VALID [2022-02-20 18:27:31,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {1236#true} assume 0 == ~r1~0; {1236#true} is VALID [2022-02-20 18:27:31,636 INFO L290 TraceCheckUtils]: 3: Hoare triple {1236#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {1236#true} is VALID [2022-02-20 18:27:31,636 INFO L290 TraceCheckUtils]: 4: Hoare triple {1236#true} assume ~id1~0 >= 0; {1236#true} is VALID [2022-02-20 18:27:31,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {1236#true} assume 0 == ~st1~0; {1236#true} is VALID [2022-02-20 18:27:31,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {1236#true} assume ~send1~0 == ~id1~0; {1236#true} is VALID [2022-02-20 18:27:31,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {1236#true} assume 0 == ~mode1~0 % 256; {1236#true} is VALID [2022-02-20 18:27:31,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {1236#true} assume ~id2~0 >= 0; {1236#true} is VALID [2022-02-20 18:27:31,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {1236#true} assume 0 == ~st2~0; {1236#true} is VALID [2022-02-20 18:27:31,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {1236#true} assume ~send2~0 == ~id2~0; {1236#true} is VALID [2022-02-20 18:27:31,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {1236#true} assume 0 == ~mode2~0 % 256; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == main_~i2~0#1); {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~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_~i2~0#1 := 0; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,648 INFO L290 TraceCheckUtils]: 32: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~alive1~0 % 256); {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,648 INFO L290 TraceCheckUtils]: 33: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:31,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {1238#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1237#false} is VALID [2022-02-20 18:27:31,649 INFO L290 TraceCheckUtils]: 36: Hoare triple {1237#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1237#false} is VALID [2022-02-20 18:27:31,649 INFO L290 TraceCheckUtils]: 37: Hoare triple {1237#false} ~mode2~0 := 0; {1237#false} is VALID [2022-02-20 18:27:31,650 INFO L290 TraceCheckUtils]: 38: Hoare triple {1237#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1237#false} is VALID [2022-02-20 18:27:31,650 INFO L290 TraceCheckUtils]: 39: Hoare triple {1237#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1237#false} is VALID [2022-02-20 18:27:31,650 INFO L290 TraceCheckUtils]: 40: Hoare triple {1237#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1237#false} is VALID [2022-02-20 18:27:31,650 INFO L290 TraceCheckUtils]: 41: Hoare triple {1237#false} ~mode3~0 := 0; {1237#false} is VALID [2022-02-20 18:27:31,650 INFO L290 TraceCheckUtils]: 42: Hoare triple {1237#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1237#false} is VALID [2022-02-20 18:27:31,650 INFO L290 TraceCheckUtils]: 43: Hoare triple {1237#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1237#false} is VALID [2022-02-20 18:27:31,651 INFO L290 TraceCheckUtils]: 44: Hoare triple {1237#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1237#false} is VALID [2022-02-20 18:27:31,651 INFO L290 TraceCheckUtils]: 45: Hoare triple {1237#false} ~mode4~0 := 0; {1237#false} is VALID [2022-02-20 18:27:31,651 INFO L290 TraceCheckUtils]: 46: Hoare triple {1237#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1237#false} is VALID [2022-02-20 18:27:31,651 INFO L290 TraceCheckUtils]: 47: Hoare triple {1237#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {1237#false} is VALID [2022-02-20 18:27:31,651 INFO L290 TraceCheckUtils]: 48: Hoare triple {1237#false} check_#res#1 := check_~tmp~1#1; {1237#false} is VALID [2022-02-20 18:27:31,652 INFO L290 TraceCheckUtils]: 49: Hoare triple {1237#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1237#false} is VALID [2022-02-20 18:27:31,652 INFO L290 TraceCheckUtils]: 50: Hoare triple {1237#false} assume 0 == assert_~arg#1 % 256; {1237#false} is VALID [2022-02-20 18:27:31,652 INFO L290 TraceCheckUtils]: 51: Hoare triple {1237#false} assume !false; {1237#false} is VALID [2022-02-20 18:27:31,653 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:27:31,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:31,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862339231] [2022-02-20 18:27:31,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862339231] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:31,653 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:31,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:31,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009631627] [2022-02-20 18:27:31,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:31,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2022-02-20 18:27:31,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:31,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:27:31,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:31,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:31,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:31,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:31,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:31,691 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:27:31,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:31,852 INFO L93 Difference]: Finished difference Result 207 states and 310 transitions. [2022-02-20 18:27:31,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:31,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2022-02-20 18:27:31,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:27:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2022-02-20 18:27:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:27:31,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2022-02-20 18:27:31,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 310 transitions. [2022-02-20 18:27:32,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 310 edges. 310 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:32,052 INFO L225 Difference]: With dead ends: 207 [2022-02-20 18:27:32,053 INFO L226 Difference]: Without dead ends: 144 [2022-02-20 18:27:32,053 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:27:32,054 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 84 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 283 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:27:32,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 283 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-02-20 18:27:32,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2022-02-20 18:27:32,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:32,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 142 states, 141 states have (on average 1.475177304964539) internal successors, (208), 141 states have internal predecessors, (208), 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:27:32,061 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 142 states, 141 states have (on average 1.475177304964539) internal successors, (208), 141 states have internal predecessors, (208), 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:27:32,061 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 142 states, 141 states have (on average 1.475177304964539) internal successors, (208), 141 states have internal predecessors, (208), 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:27:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:32,064 INFO L93 Difference]: Finished difference Result 144 states and 209 transitions. [2022-02-20 18:27:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2022-02-20 18:27:32,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:32,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:32,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 141 states have (on average 1.475177304964539) internal successors, (208), 141 states have internal predecessors, (208), 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 144 states. [2022-02-20 18:27:32,065 INFO L87 Difference]: Start difference. First operand has 142 states, 141 states have (on average 1.475177304964539) internal successors, (208), 141 states have internal predecessors, (208), 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 144 states. [2022-02-20 18:27:32,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:32,068 INFO L93 Difference]: Finished difference Result 144 states and 209 transitions. [2022-02-20 18:27:32,068 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2022-02-20 18:27:32,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:32,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:32,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:32,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:32,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.475177304964539) internal successors, (208), 141 states have internal predecessors, (208), 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:27:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 208 transitions. [2022-02-20 18:27:32,072 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 208 transitions. Word has length 52 [2022-02-20 18:27:32,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:32,072 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 208 transitions. [2022-02-20 18:27:32,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:27:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 208 transitions. [2022-02-20 18:27:32,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:27:32,073 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:32,073 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:27:32,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:27:32,073 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:32,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:32,074 INFO L85 PathProgramCache]: Analyzing trace with hash -609394571, now seen corresponding path program 1 times [2022-02-20 18:27:32,074 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:32,074 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267988976] [2022-02-20 18:27:32,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:32,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:32,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {1910#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0; {1910#true} is VALID [2022-02-20 18:27:32,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {1910#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_#t~post34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1910#true} is VALID [2022-02-20 18:27:32,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {1910#true} assume 0 == ~r1~0; {1910#true} is VALID [2022-02-20 18:27:32,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {1910#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {1910#true} is VALID [2022-02-20 18:27:32,130 INFO L290 TraceCheckUtils]: 4: Hoare triple {1910#true} assume ~id1~0 >= 0; {1910#true} is VALID [2022-02-20 18:27:32,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {1910#true} assume 0 == ~st1~0; {1910#true} is VALID [2022-02-20 18:27:32,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {1910#true} assume ~send1~0 == ~id1~0; {1910#true} is VALID [2022-02-20 18:27:32,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {1910#true} assume 0 == ~mode1~0 % 256; {1910#true} is VALID [2022-02-20 18:27:32,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {1910#true} assume ~id2~0 >= 0; {1910#true} is VALID [2022-02-20 18:27:32,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {1910#true} assume 0 == ~st2~0; {1910#true} is VALID [2022-02-20 18:27:32,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {1910#true} assume ~send2~0 == ~id2~0; {1910#true} is VALID [2022-02-20 18:27:32,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {1910#true} assume 0 == ~mode2~0 % 256; {1910#true} is VALID [2022-02-20 18:27:32,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {1910#true} assume ~id3~0 >= 0; {1910#true} is VALID [2022-02-20 18:27:32,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {1910#true} assume 0 == ~st3~0; {1910#true} is VALID [2022-02-20 18:27:32,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {1910#true} assume ~send3~0 == ~id3~0; {1910#true} is VALID [2022-02-20 18:27:32,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {1910#true} assume 0 == ~mode3~0 % 256; {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == main_~i2~0#1); {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~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_~i2~0#1 := 0; {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive1~0 % 256); {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,140 INFO L290 TraceCheckUtils]: 34: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,141 INFO L290 TraceCheckUtils]: 35: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,141 INFO L290 TraceCheckUtils]: 36: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive2~0 % 256); {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,142 INFO L290 TraceCheckUtils]: 37: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,142 INFO L290 TraceCheckUtils]: 38: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:32,143 INFO L290 TraceCheckUtils]: 40: Hoare triple {1912#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1911#false} is VALID [2022-02-20 18:27:32,143 INFO L290 TraceCheckUtils]: 41: Hoare triple {1911#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1911#false} is VALID [2022-02-20 18:27:32,143 INFO L290 TraceCheckUtils]: 42: Hoare triple {1911#false} ~mode3~0 := 0; {1911#false} is VALID [2022-02-20 18:27:32,143 INFO L290 TraceCheckUtils]: 43: Hoare triple {1911#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1911#false} is VALID [2022-02-20 18:27:32,144 INFO L290 TraceCheckUtils]: 44: Hoare triple {1911#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1911#false} is VALID [2022-02-20 18:27:32,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {1911#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1911#false} is VALID [2022-02-20 18:27:32,144 INFO L290 TraceCheckUtils]: 46: Hoare triple {1911#false} ~mode4~0 := 0; {1911#false} is VALID [2022-02-20 18:27:32,144 INFO L290 TraceCheckUtils]: 47: Hoare triple {1911#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1911#false} is VALID [2022-02-20 18:27:32,144 INFO L290 TraceCheckUtils]: 48: Hoare triple {1911#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {1911#false} is VALID [2022-02-20 18:27:32,144 INFO L290 TraceCheckUtils]: 49: Hoare triple {1911#false} check_#res#1 := check_~tmp~1#1; {1911#false} is VALID [2022-02-20 18:27:32,145 INFO L290 TraceCheckUtils]: 50: Hoare triple {1911#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1911#false} is VALID [2022-02-20 18:27:32,145 INFO L290 TraceCheckUtils]: 51: Hoare triple {1911#false} assume 0 == assert_~arg#1 % 256; {1911#false} is VALID [2022-02-20 18:27:32,145 INFO L290 TraceCheckUtils]: 52: Hoare triple {1911#false} assume !false; {1911#false} is VALID [2022-02-20 18:27:32,145 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:27:32,146 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:32,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267988976] [2022-02-20 18:27:32,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267988976] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:32,146 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:32,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:32,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708076125] [2022-02-20 18:27:32,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:32,147 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:27:32,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:32,147 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:27:32,180 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:27:32,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:32,180 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:32,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:32,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:32,181 INFO L87 Difference]: Start difference. First operand 142 states and 208 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:27:32,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:32,324 INFO L93 Difference]: Finished difference Result 342 states and 524 transitions. [2022-02-20 18:27:32,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:32,324 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:27:32,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:32,325 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:27:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2022-02-20 18:27:32,327 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:27:32,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2022-02-20 18:27:32,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 310 transitions. [2022-02-20 18:27:32,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 310 edges. 310 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:32,521 INFO L225 Difference]: With dead ends: 342 [2022-02-20 18:27:32,521 INFO L226 Difference]: Without dead ends: 230 [2022-02-20 18:27:32,522 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:27:32,523 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 79 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 274 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:27:32,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 274 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:32,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-02-20 18:27:32,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2022-02-20 18:27:32,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:32,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand has 228 states, 227 states have (on average 1.5110132158590308) internal successors, (343), 227 states have internal predecessors, (343), 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:27:32,532 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand has 228 states, 227 states have (on average 1.5110132158590308) internal successors, (343), 227 states have internal predecessors, (343), 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:27:32,532 INFO L87 Difference]: Start difference. First operand 230 states. Second operand has 228 states, 227 states have (on average 1.5110132158590308) internal successors, (343), 227 states have internal predecessors, (343), 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:27:32,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:32,537 INFO L93 Difference]: Finished difference Result 230 states and 344 transitions. [2022-02-20 18:27:32,537 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 344 transitions. [2022-02-20 18:27:32,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:32,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:32,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 228 states, 227 states have (on average 1.5110132158590308) internal successors, (343), 227 states have internal predecessors, (343), 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 230 states. [2022-02-20 18:27:32,538 INFO L87 Difference]: Start difference. First operand has 228 states, 227 states have (on average 1.5110132158590308) internal successors, (343), 227 states have internal predecessors, (343), 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 230 states. [2022-02-20 18:27:32,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:32,543 INFO L93 Difference]: Finished difference Result 230 states and 344 transitions. [2022-02-20 18:27:32,543 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 344 transitions. [2022-02-20 18:27:32,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:32,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:32,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:32,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.5110132158590308) internal successors, (343), 227 states have internal predecessors, (343), 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:27:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 343 transitions. [2022-02-20 18:27:32,548 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 343 transitions. Word has length 53 [2022-02-20 18:27:32,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:32,549 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 343 transitions. [2022-02-20 18:27:32,549 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:27:32,549 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 343 transitions. [2022-02-20 18:27:32,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:27:32,550 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:32,550 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:27:32,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:27:32,551 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:32,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:32,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1908001763, now seen corresponding path program 1 times [2022-02-20 18:27:32,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:32,561 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062790371] [2022-02-20 18:27:32,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:32,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:32,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {3007#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0; {3007#true} is VALID [2022-02-20 18:27:32,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {3007#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_#t~post34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {3007#true} is VALID [2022-02-20 18:27:32,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {3007#true} assume 0 == ~r1~0; {3007#true} is VALID [2022-02-20 18:27:32,627 INFO L290 TraceCheckUtils]: 3: Hoare triple {3007#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {3007#true} is VALID [2022-02-20 18:27:32,627 INFO L290 TraceCheckUtils]: 4: Hoare triple {3007#true} assume ~id1~0 >= 0; {3007#true} is VALID [2022-02-20 18:27:32,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {3007#true} assume 0 == ~st1~0; {3007#true} is VALID [2022-02-20 18:27:32,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {3007#true} assume ~send1~0 == ~id1~0; {3007#true} is VALID [2022-02-20 18:27:32,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {3007#true} assume 0 == ~mode1~0 % 256; {3007#true} is VALID [2022-02-20 18:27:32,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {3007#true} assume ~id2~0 >= 0; {3007#true} is VALID [2022-02-20 18:27:32,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {3007#true} assume 0 == ~st2~0; {3007#true} is VALID [2022-02-20 18:27:32,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {3007#true} assume ~send2~0 == ~id2~0; {3007#true} is VALID [2022-02-20 18:27:32,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {3007#true} assume 0 == ~mode2~0 % 256; {3007#true} is VALID [2022-02-20 18:27:32,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {3007#true} assume ~id3~0 >= 0; {3007#true} is VALID [2022-02-20 18:27:32,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {3007#true} assume 0 == ~st3~0; {3007#true} is VALID [2022-02-20 18:27:32,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {3007#true} assume ~send3~0 == ~id3~0; {3007#true} is VALID [2022-02-20 18:27:32,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {3007#true} assume 0 == ~mode3~0 % 256; {3007#true} is VALID [2022-02-20 18:27:32,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {3007#true} assume ~id4~0 >= 0; {3007#true} is VALID [2022-02-20 18:27:32,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {3007#true} assume 0 == ~st4~0; {3007#true} is VALID [2022-02-20 18:27:32,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {3007#true} assume ~send4~0 == ~id4~0; {3007#true} is VALID [2022-02-20 18:27:32,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {3007#true} assume 0 == ~mode4~0 % 256; {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,633 INFO L290 TraceCheckUtils]: 28: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == main_~i2~0#1); {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~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_~i2~0#1 := 0; {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive1~0 % 256); {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode1~0 := 1; {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,637 INFO L290 TraceCheckUtils]: 36: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive2~0 % 256); {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~id2~0); {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,638 INFO L290 TraceCheckUtils]: 38: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode2~0 := 1; {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,638 INFO L290 TraceCheckUtils]: 39: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,638 INFO L290 TraceCheckUtils]: 40: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,639 INFO L290 TraceCheckUtils]: 41: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive3~0 % 256); {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,639 INFO L290 TraceCheckUtils]: 42: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~id3~0); {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,640 INFO L290 TraceCheckUtils]: 43: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode3~0 := 1; {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,640 INFO L290 TraceCheckUtils]: 44: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:32,640 INFO L290 TraceCheckUtils]: 45: Hoare triple {3009#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3008#false} is VALID [2022-02-20 18:27:32,641 INFO L290 TraceCheckUtils]: 46: Hoare triple {3008#false} assume !(node4_~m4~0#1 != ~nomsg~0); {3008#false} is VALID [2022-02-20 18:27:32,641 INFO L290 TraceCheckUtils]: 47: Hoare triple {3008#false} ~mode4~0 := 0; {3008#false} is VALID [2022-02-20 18:27:32,641 INFO L290 TraceCheckUtils]: 48: Hoare triple {3008#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3008#false} is VALID [2022-02-20 18:27:32,641 INFO L290 TraceCheckUtils]: 49: Hoare triple {3008#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {3008#false} is VALID [2022-02-20 18:27:32,641 INFO L290 TraceCheckUtils]: 50: Hoare triple {3008#false} check_#res#1 := check_~tmp~1#1; {3008#false} is VALID [2022-02-20 18:27:32,641 INFO L290 TraceCheckUtils]: 51: Hoare triple {3008#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3008#false} is VALID [2022-02-20 18:27:32,641 INFO L290 TraceCheckUtils]: 52: Hoare triple {3008#false} assume 0 == assert_~arg#1 % 256; {3008#false} is VALID [2022-02-20 18:27:32,642 INFO L290 TraceCheckUtils]: 53: Hoare triple {3008#false} assume !false; {3008#false} is VALID [2022-02-20 18:27:32,642 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:27:32,642 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:32,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062790371] [2022-02-20 18:27:32,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062790371] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:32,642 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:32,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:32,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760256035] [2022-02-20 18:27:32,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:32,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:27:32,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:32,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:27:32,674 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:27:32,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:32,674 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:32,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:32,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:32,675 INFO L87 Difference]: Start difference. First operand 228 states and 343 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:27:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:32,851 INFO L93 Difference]: Finished difference Result 576 states and 889 transitions. [2022-02-20 18:27:32,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:32,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:27:32,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:27:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2022-02-20 18:27:32,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:27:32,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2022-02-20 18:27:32,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 310 transitions. [2022-02-20 18:27:33,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 310 edges. 310 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:33,046 INFO L225 Difference]: With dead ends: 576 [2022-02-20 18:27:33,046 INFO L226 Difference]: Without dead ends: 378 [2022-02-20 18:27:33,049 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:27:33,053 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 74 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 265 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:27:33,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 265 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:33,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-02-20 18:27:33,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376. [2022-02-20 18:27:33,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:33,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 378 states. Second operand has 376 states, 375 states have (on average 1.5226666666666666) internal successors, (571), 375 states have internal predecessors, (571), 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:27:33,079 INFO L74 IsIncluded]: Start isIncluded. First operand 378 states. Second operand has 376 states, 375 states have (on average 1.5226666666666666) internal successors, (571), 375 states have internal predecessors, (571), 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:27:33,079 INFO L87 Difference]: Start difference. First operand 378 states. Second operand has 376 states, 375 states have (on average 1.5226666666666666) internal successors, (571), 375 states have internal predecessors, (571), 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:27:33,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:33,088 INFO L93 Difference]: Finished difference Result 378 states and 572 transitions. [2022-02-20 18:27:33,088 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 572 transitions. [2022-02-20 18:27:33,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:33,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:33,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 376 states, 375 states have (on average 1.5226666666666666) internal successors, (571), 375 states have internal predecessors, (571), 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 378 states. [2022-02-20 18:27:33,095 INFO L87 Difference]: Start difference. First operand has 376 states, 375 states have (on average 1.5226666666666666) internal successors, (571), 375 states have internal predecessors, (571), 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 378 states. [2022-02-20 18:27:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:33,101 INFO L93 Difference]: Finished difference Result 378 states and 572 transitions. [2022-02-20 18:27:33,102 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 572 transitions. [2022-02-20 18:27:33,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:33,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:33,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:33,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:33,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 375 states have (on average 1.5226666666666666) internal successors, (571), 375 states have internal predecessors, (571), 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:27:33,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 571 transitions. [2022-02-20 18:27:33,112 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 571 transitions. Word has length 54 [2022-02-20 18:27:33,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:33,112 INFO L470 AbstractCegarLoop]: Abstraction has 376 states and 571 transitions. [2022-02-20 18:27:33,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:27:33,112 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 571 transitions. [2022-02-20 18:27:33,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:27:33,113 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:33,113 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, 1] [2022-02-20 18:27:33,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:27:33,114 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:33,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:33,114 INFO L85 PathProgramCache]: Analyzing trace with hash 553512453, now seen corresponding path program 1 times [2022-02-20 18:27:33,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:33,115 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008062298] [2022-02-20 18:27:33,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:33,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:33,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {4842#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0; {4842#true} is VALID [2022-02-20 18:27:33,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {4842#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_#t~post34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {4842#true} is VALID [2022-02-20 18:27:33,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {4842#true} assume 0 == ~r1~0; {4842#true} is VALID [2022-02-20 18:27:33,238 INFO L290 TraceCheckUtils]: 3: Hoare triple {4842#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {4842#true} is VALID [2022-02-20 18:27:33,238 INFO L290 TraceCheckUtils]: 4: Hoare triple {4842#true} assume ~id1~0 >= 0; {4842#true} is VALID [2022-02-20 18:27:33,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {4842#true} assume 0 == ~st1~0; {4844#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:33,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {4844#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {4844#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:33,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {4844#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {4844#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:33,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {4844#(<= ~st1~0 0)} assume ~id2~0 >= 0; {4844#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:33,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {4844#(<= ~st1~0 0)} assume 0 == ~st2~0; {4845#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {4845#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {4845#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {4845#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {4845#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {4845#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {4845#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {4845#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {4846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {4846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {4846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {4846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {4846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {4846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {4846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {4846#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~i2~0#1); {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~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_~i2~0#1 := 0; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive1~0 % 256); {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,248 INFO L290 TraceCheckUtils]: 34: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,252 INFO L290 TraceCheckUtils]: 35: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,252 INFO L290 TraceCheckUtils]: 36: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive2~0 % 256); {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,253 INFO L290 TraceCheckUtils]: 37: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,253 INFO L290 TraceCheckUtils]: 38: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,253 INFO L290 TraceCheckUtils]: 39: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,254 INFO L290 TraceCheckUtils]: 40: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,254 INFO L290 TraceCheckUtils]: 41: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive3~0 % 256); {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,254 INFO L290 TraceCheckUtils]: 42: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,255 INFO L290 TraceCheckUtils]: 43: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,255 INFO L290 TraceCheckUtils]: 44: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,255 INFO L290 TraceCheckUtils]: 45: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,256 INFO L290 TraceCheckUtils]: 46: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive4~0 % 256); {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,256 INFO L290 TraceCheckUtils]: 47: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~id4~0); {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,256 INFO L290 TraceCheckUtils]: 48: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 1; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,257 INFO L290 TraceCheckUtils]: 49: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:33,257 INFO L290 TraceCheckUtils]: 50: Hoare triple {4847#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {4843#false} is VALID [2022-02-20 18:27:33,258 INFO L290 TraceCheckUtils]: 51: Hoare triple {4843#false} check_#res#1 := check_~tmp~1#1; {4843#false} is VALID [2022-02-20 18:27:33,258 INFO L290 TraceCheckUtils]: 52: Hoare triple {4843#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {4843#false} is VALID [2022-02-20 18:27:33,258 INFO L290 TraceCheckUtils]: 53: Hoare triple {4843#false} assume 0 == assert_~arg#1 % 256; {4843#false} is VALID [2022-02-20 18:27:33,258 INFO L290 TraceCheckUtils]: 54: Hoare triple {4843#false} assume !false; {4843#false} is VALID [2022-02-20 18:27:33,258 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:27:33,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:33,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008062298] [2022-02-20 18:27:33,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008062298] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:33,259 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:33,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:27:33,260 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223780645] [2022-02-20 18:27:33,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:33,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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 55 [2022-02-20 18:27:33,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:33,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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:27:33,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:33,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:27:33,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:33,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:27:33,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:27:33,299 INFO L87 Difference]: Start difference. First operand 376 states and 571 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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:27:34,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:34,264 INFO L93 Difference]: Finished difference Result 2106 states and 3276 transitions. [2022-02-20 18:27:34,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:27:34,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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 55 [2022-02-20 18:27:34,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:34,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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:27:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 630 transitions. [2022-02-20 18:27:34,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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:27:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 630 transitions. [2022-02-20 18:27:34,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 630 transitions. [2022-02-20 18:27:34,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 630 edges. 630 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:34,766 INFO L225 Difference]: With dead ends: 2106 [2022-02-20 18:27:34,767 INFO L226 Difference]: Without dead ends: 1760 [2022-02-20 18:27:34,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:27:34,770 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 725 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:34,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [725 Valid, 1064 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:34,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2022-02-20 18:27:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 720. [2022-02-20 18:27:34,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:34,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1760 states. Second operand has 720 states, 719 states have (on average 1.5229485396383866) internal successors, (1095), 719 states have internal predecessors, (1095), 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:27:34,930 INFO L74 IsIncluded]: Start isIncluded. First operand 1760 states. Second operand has 720 states, 719 states have (on average 1.5229485396383866) internal successors, (1095), 719 states have internal predecessors, (1095), 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:27:34,931 INFO L87 Difference]: Start difference. First operand 1760 states. Second operand has 720 states, 719 states have (on average 1.5229485396383866) internal successors, (1095), 719 states have internal predecessors, (1095), 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:27:35,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:35,045 INFO L93 Difference]: Finished difference Result 1760 states and 2719 transitions. [2022-02-20 18:27:35,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2719 transitions. [2022-02-20 18:27:35,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:35,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:35,049 INFO L74 IsIncluded]: Start isIncluded. First operand has 720 states, 719 states have (on average 1.5229485396383866) internal successors, (1095), 719 states have internal predecessors, (1095), 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 1760 states. [2022-02-20 18:27:35,050 INFO L87 Difference]: Start difference. First operand has 720 states, 719 states have (on average 1.5229485396383866) internal successors, (1095), 719 states have internal predecessors, (1095), 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 1760 states. [2022-02-20 18:27:35,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:35,137 INFO L93 Difference]: Finished difference Result 1760 states and 2719 transitions. [2022-02-20 18:27:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2719 transitions. [2022-02-20 18:27:35,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:35,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:35,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:35,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:35,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 719 states have (on average 1.5229485396383866) internal successors, (1095), 719 states have internal predecessors, (1095), 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:27:35,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1095 transitions. [2022-02-20 18:27:35,157 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1095 transitions. Word has length 55 [2022-02-20 18:27:35,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:35,157 INFO L470 AbstractCegarLoop]: Abstraction has 720 states and 1095 transitions. [2022-02-20 18:27:35,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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:27:35,158 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1095 transitions. [2022-02-20 18:27:35,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:27:35,158 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:35,159 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, 1, 1] [2022-02-20 18:27:35,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:27:35,159 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:35,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:35,160 INFO L85 PathProgramCache]: Analyzing trace with hash -404306473, now seen corresponding path program 1 times [2022-02-20 18:27:35,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:35,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265246224] [2022-02-20 18:27:35,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:35,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:35,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {11589#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0; {11589#true} is VALID [2022-02-20 18:27:35,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {11589#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_#t~post34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {11589#true} is VALID [2022-02-20 18:27:35,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {11589#true} assume 0 == ~r1~0; {11589#true} is VALID [2022-02-20 18:27:35,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {11589#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,255 INFO L290 TraceCheckUtils]: 4: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 >= 0; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st4~0; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send4~0 == ~id4~0; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode4~0 % 256; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id4~0; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id4~0; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} init_#res#1 := init_~tmp~0#1; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 == main_~i2~0#1); {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} ~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_~i2~0#1 := 0; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 != ~mode1~0 % 256); {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:35,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {11591#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 != ~alive1~0 % 256); {11592#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:35,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {11592#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} ~mode1~0 := 1; {11592#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:35,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {11592#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {11592#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:35,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {11592#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume !(0 != ~mode2~0 % 256); {11592#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:35,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {11592#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume !(0 != ~alive2~0 % 256); {11593#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:27:35,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {11593#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !(~send2~0 != ~id2~0); {11593#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:27:35,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {11593#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} ~mode2~0 := 1; {11593#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:27:35,272 INFO L290 TraceCheckUtils]: 39: Hoare triple {11593#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {11593#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:27:35,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {11593#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !(0 != ~mode3~0 % 256); {11593#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:27:35,274 INFO L290 TraceCheckUtils]: 41: Hoare triple {11593#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !(0 != ~alive3~0 % 256); {11594#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:27:35,274 INFO L290 TraceCheckUtils]: 42: Hoare triple {11594#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !(~send3~0 != ~id3~0); {11594#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:27:35,274 INFO L290 TraceCheckUtils]: 43: Hoare triple {11594#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} ~mode3~0 := 1; {11594#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:27:35,275 INFO L290 TraceCheckUtils]: 44: Hoare triple {11594#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {11594#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:27:35,275 INFO L290 TraceCheckUtils]: 45: Hoare triple {11594#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !(0 != ~mode4~0 % 256); {11594#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:27:35,275 INFO L290 TraceCheckUtils]: 46: Hoare triple {11594#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !(0 != ~alive4~0 % 256); {11590#false} is VALID [2022-02-20 18:27:35,275 INFO L290 TraceCheckUtils]: 47: Hoare triple {11590#false} assume !(~send4~0 != ~id4~0); {11590#false} is VALID [2022-02-20 18:27:35,276 INFO L290 TraceCheckUtils]: 48: Hoare triple {11590#false} ~mode4~0 := 1; {11590#false} is VALID [2022-02-20 18:27:35,276 INFO L290 TraceCheckUtils]: 49: Hoare triple {11590#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {11590#false} is VALID [2022-02-20 18:27:35,276 INFO L290 TraceCheckUtils]: 50: Hoare triple {11590#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {11590#false} is VALID [2022-02-20 18:27:35,276 INFO L290 TraceCheckUtils]: 51: Hoare triple {11590#false} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {11590#false} is VALID [2022-02-20 18:27:35,276 INFO L290 TraceCheckUtils]: 52: Hoare triple {11590#false} check_#res#1 := check_~tmp~1#1; {11590#false} is VALID [2022-02-20 18:27:35,276 INFO L290 TraceCheckUtils]: 53: Hoare triple {11590#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {11590#false} is VALID [2022-02-20 18:27:35,276 INFO L290 TraceCheckUtils]: 54: Hoare triple {11590#false} assume 0 == assert_~arg#1 % 256; {11590#false} is VALID [2022-02-20 18:27:35,277 INFO L290 TraceCheckUtils]: 55: Hoare triple {11590#false} assume !false; {11590#false} is VALID [2022-02-20 18:27:35,277 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:27:35,277 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:35,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265246224] [2022-02-20 18:27:35,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265246224] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:35,278 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:35,278 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:27:35,278 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947789810] [2022-02-20 18:27:35,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:35,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 56 [2022-02-20 18:27:35,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:35,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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:27:35,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:35,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:27:35,319 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:35,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:27:35,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:27:35,319 INFO L87 Difference]: Start difference. First operand 720 states and 1095 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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:27:37,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:37,037 INFO L93 Difference]: Finished difference Result 3216 states and 4899 transitions. [2022-02-20 18:27:37,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:27:37,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 56 [2022-02-20 18:27:37,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:37,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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:27:37,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 473 transitions. [2022-02-20 18:27:37,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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:27:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 473 transitions. [2022-02-20 18:27:37,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 473 transitions. [2022-02-20 18:27:37,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:37,594 INFO L225 Difference]: With dead ends: 3216 [2022-02-20 18:27:37,594 INFO L226 Difference]: Without dead ends: 2526 [2022-02-20 18:27:37,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:27:37,596 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 336 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:37,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 604 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:27:37,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2022-02-20 18:27:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2520. [2022-02-20 18:27:38,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:38,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2526 states. Second operand has 2520 states, 2519 states have (on average 1.5144898769352917) internal successors, (3815), 2519 states have internal predecessors, (3815), 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:27:38,356 INFO L74 IsIncluded]: Start isIncluded. First operand 2526 states. Second operand has 2520 states, 2519 states have (on average 1.5144898769352917) internal successors, (3815), 2519 states have internal predecessors, (3815), 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:27:38,360 INFO L87 Difference]: Start difference. First operand 2526 states. Second operand has 2520 states, 2519 states have (on average 1.5144898769352917) internal successors, (3815), 2519 states have internal predecessors, (3815), 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:27:38,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:38,527 INFO L93 Difference]: Finished difference Result 2526 states and 3818 transitions. [2022-02-20 18:27:38,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3818 transitions. [2022-02-20 18:27:38,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:38,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:38,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 2520 states, 2519 states have (on average 1.5144898769352917) internal successors, (3815), 2519 states have internal predecessors, (3815), 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 2526 states. [2022-02-20 18:27:38,537 INFO L87 Difference]: Start difference. First operand has 2520 states, 2519 states have (on average 1.5144898769352917) internal successors, (3815), 2519 states have internal predecessors, (3815), 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 2526 states. [2022-02-20 18:27:38,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:38,701 INFO L93 Difference]: Finished difference Result 2526 states and 3818 transitions. [2022-02-20 18:27:38,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3818 transitions. [2022-02-20 18:27:38,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:38,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:38,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:38,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:38,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2520 states, 2519 states have (on average 1.5144898769352917) internal successors, (3815), 2519 states have internal predecessors, (3815), 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:27:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2520 states and 3815 transitions. [2022-02-20 18:27:38,927 INFO L78 Accepts]: Start accepts. Automaton has 2520 states and 3815 transitions. Word has length 56 [2022-02-20 18:27:38,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:38,927 INFO L470 AbstractCegarLoop]: Abstraction has 2520 states and 3815 transitions. [2022-02-20 18:27:38,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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:27:38,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2520 states and 3815 transitions. [2022-02-20 18:27:38,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:27:38,929 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:38,929 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, 1, 1] [2022-02-20 18:27:38,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:27:38,929 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:38,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:38,930 INFO L85 PathProgramCache]: Analyzing trace with hash 399274429, now seen corresponding path program 1 times [2022-02-20 18:27:38,930 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:38,930 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906238835] [2022-02-20 18:27:38,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:38,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:38,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {23251#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0; {23251#true} is VALID [2022-02-20 18:27:38,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {23251#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_#t~post34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {23251#true} is VALID [2022-02-20 18:27:38,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {23251#true} assume 0 == ~r1~0; {23251#true} is VALID [2022-02-20 18:27:38,976 INFO L290 TraceCheckUtils]: 3: Hoare triple {23251#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {23251#true} is VALID [2022-02-20 18:27:38,976 INFO L290 TraceCheckUtils]: 4: Hoare triple {23251#true} assume ~id1~0 >= 0; {23251#true} is VALID [2022-02-20 18:27:38,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {23251#true} assume 0 == ~st1~0; {23251#true} is VALID [2022-02-20 18:27:38,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {23251#true} assume ~send1~0 == ~id1~0; {23251#true} is VALID [2022-02-20 18:27:38,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {23251#true} assume 0 == ~mode1~0 % 256; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main_~i2~0#1); {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} ~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_~i2~0#1 := 0; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:38,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {23253#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {23252#false} is VALID [2022-02-20 18:27:38,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {23252#false} assume !(node1_~m1~0#1 != ~nomsg~0); {23252#false} is VALID [2022-02-20 18:27:38,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {23252#false} ~mode1~0 := 0; {23252#false} is VALID [2022-02-20 18:27:38,986 INFO L290 TraceCheckUtils]: 34: Hoare triple {23252#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {23252#false} is VALID [2022-02-20 18:27:38,986 INFO L290 TraceCheckUtils]: 35: Hoare triple {23252#false} assume !(0 != ~mode2~0 % 256); {23252#false} is VALID [2022-02-20 18:27:38,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {23252#false} assume !(0 != ~alive2~0 % 256); {23252#false} is VALID [2022-02-20 18:27:38,986 INFO L290 TraceCheckUtils]: 37: Hoare triple {23252#false} assume !(~send2~0 != ~id2~0); {23252#false} is VALID [2022-02-20 18:27:38,986 INFO L290 TraceCheckUtils]: 38: Hoare triple {23252#false} ~mode2~0 := 1; {23252#false} is VALID [2022-02-20 18:27:38,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {23252#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {23252#false} is VALID [2022-02-20 18:27:38,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {23252#false} assume !(0 != ~mode3~0 % 256); {23252#false} is VALID [2022-02-20 18:27:38,987 INFO L290 TraceCheckUtils]: 41: Hoare triple {23252#false} assume !(0 != ~alive3~0 % 256); {23252#false} is VALID [2022-02-20 18:27:38,987 INFO L290 TraceCheckUtils]: 42: Hoare triple {23252#false} assume !(~send3~0 != ~id3~0); {23252#false} is VALID [2022-02-20 18:27:38,987 INFO L290 TraceCheckUtils]: 43: Hoare triple {23252#false} ~mode3~0 := 1; {23252#false} is VALID [2022-02-20 18:27:38,987 INFO L290 TraceCheckUtils]: 44: Hoare triple {23252#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {23252#false} is VALID [2022-02-20 18:27:38,987 INFO L290 TraceCheckUtils]: 45: Hoare triple {23252#false} assume !(0 != ~mode4~0 % 256); {23252#false} is VALID [2022-02-20 18:27:38,988 INFO L290 TraceCheckUtils]: 46: Hoare triple {23252#false} assume !(0 != ~alive4~0 % 256); {23252#false} is VALID [2022-02-20 18:27:38,988 INFO L290 TraceCheckUtils]: 47: Hoare triple {23252#false} assume !(~send4~0 != ~id4~0); {23252#false} is VALID [2022-02-20 18:27:38,988 INFO L290 TraceCheckUtils]: 48: Hoare triple {23252#false} ~mode4~0 := 1; {23252#false} is VALID [2022-02-20 18:27:38,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {23252#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {23252#false} is VALID [2022-02-20 18:27:38,988 INFO L290 TraceCheckUtils]: 50: Hoare triple {23252#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {23252#false} is VALID [2022-02-20 18:27:38,988 INFO L290 TraceCheckUtils]: 51: Hoare triple {23252#false} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {23252#false} is VALID [2022-02-20 18:27:38,988 INFO L290 TraceCheckUtils]: 52: Hoare triple {23252#false} check_#res#1 := check_~tmp~1#1; {23252#false} is VALID [2022-02-20 18:27:38,988 INFO L290 TraceCheckUtils]: 53: Hoare triple {23252#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {23252#false} is VALID [2022-02-20 18:27:38,989 INFO L290 TraceCheckUtils]: 54: Hoare triple {23252#false} assume 0 == assert_~arg#1 % 256; {23252#false} is VALID [2022-02-20 18:27:38,989 INFO L290 TraceCheckUtils]: 55: Hoare triple {23252#false} assume !false; {23252#false} is VALID [2022-02-20 18:27:39,003 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:27:39,003 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:39,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906238835] [2022-02-20 18:27:39,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906238835] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:39,004 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:39,004 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:39,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857258733] [2022-02-20 18:27:39,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:39,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 56 [2022-02-20 18:27:39,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:39,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:27:39,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:39,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:39,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:39,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:39,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:39,041 INFO L87 Difference]: Start difference. First operand 2520 states and 3815 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:27:42,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:42,573 INFO L93 Difference]: Finished difference Result 6924 states and 10425 transitions. [2022-02-20 18:27:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:42,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 56 [2022-02-20 18:27:42,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:27:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2022-02-20 18:27:42,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:27:42,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2022-02-20 18:27:42,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 315 transitions. [2022-02-20 18:27:42,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 315 edges. 315 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:43,459 INFO L225 Difference]: With dead ends: 6924 [2022-02-20 18:27:43,460 INFO L226 Difference]: Without dead ends: 4434 [2022-02-20 18:27:43,462 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:27:43,463 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 88 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 307 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:27:43,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 307 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:43,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4434 states. [2022-02-20 18:27:45,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4434 to 4432. [2022-02-20 18:27:45,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:45,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4434 states. Second operand has 4432 states, 4431 states have (on average 1.4838636876551567) internal successors, (6575), 4431 states have internal predecessors, (6575), 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:27:45,047 INFO L74 IsIncluded]: Start isIncluded. First operand 4434 states. Second operand has 4432 states, 4431 states have (on average 1.4838636876551567) internal successors, (6575), 4431 states have internal predecessors, (6575), 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:27:45,052 INFO L87 Difference]: Start difference. First operand 4434 states. Second operand has 4432 states, 4431 states have (on average 1.4838636876551567) internal successors, (6575), 4431 states have internal predecessors, (6575), 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:27:45,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:45,594 INFO L93 Difference]: Finished difference Result 4434 states and 6576 transitions. [2022-02-20 18:27:45,594 INFO L276 IsEmpty]: Start isEmpty. Operand 4434 states and 6576 transitions. [2022-02-20 18:27:45,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:45,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:45,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 4432 states, 4431 states have (on average 1.4838636876551567) internal successors, (6575), 4431 states have internal predecessors, (6575), 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 4434 states. [2022-02-20 18:27:45,630 INFO L87 Difference]: Start difference. First operand has 4432 states, 4431 states have (on average 1.4838636876551567) internal successors, (6575), 4431 states have internal predecessors, (6575), 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 4434 states. [2022-02-20 18:27:46,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:46,181 INFO L93 Difference]: Finished difference Result 4434 states and 6576 transitions. [2022-02-20 18:27:46,181 INFO L276 IsEmpty]: Start isEmpty. Operand 4434 states and 6576 transitions. [2022-02-20 18:27:46,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:46,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:46,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:46,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:46,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4432 states, 4431 states have (on average 1.4838636876551567) internal successors, (6575), 4431 states have internal predecessors, (6575), 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:27:46,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4432 states to 4432 states and 6575 transitions. [2022-02-20 18:27:46,827 INFO L78 Accepts]: Start accepts. Automaton has 4432 states and 6575 transitions. Word has length 56 [2022-02-20 18:27:46,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:46,827 INFO L470 AbstractCegarLoop]: Abstraction has 4432 states and 6575 transitions. [2022-02-20 18:27:46,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:27:46,827 INFO L276 IsEmpty]: Start isEmpty. Operand 4432 states and 6575 transitions. [2022-02-20 18:27:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:27:46,828 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:46,828 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, 1, 1, 1] [2022-02-20 18:27:46,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:27:46,828 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:46,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:46,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1681995988, now seen corresponding path program 1 times [2022-02-20 18:27:46,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:46,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719878250] [2022-02-20 18:27:46,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:46,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:46,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {45402#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0; {45402#true} is VALID [2022-02-20 18:27:46,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {45402#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_#t~post34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {45402#true} is VALID [2022-02-20 18:27:46,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {45402#true} assume 0 == ~r1~0; {45402#true} is VALID [2022-02-20 18:27:46,915 INFO L290 TraceCheckUtils]: 3: Hoare triple {45402#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {45402#true} is VALID [2022-02-20 18:27:46,915 INFO L290 TraceCheckUtils]: 4: Hoare triple {45402#true} assume ~id1~0 >= 0; {45402#true} is VALID [2022-02-20 18:27:46,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {45402#true} assume 0 == ~st1~0; {45402#true} is VALID [2022-02-20 18:27:46,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {45402#true} assume ~send1~0 == ~id1~0; {45402#true} is VALID [2022-02-20 18:27:46,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {45402#true} assume 0 == ~mode1~0 % 256; {45402#true} is VALID [2022-02-20 18:27:46,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {45402#true} assume ~id2~0 >= 0; {45402#true} is VALID [2022-02-20 18:27:46,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {45402#true} assume 0 == ~st2~0; {45402#true} is VALID [2022-02-20 18:27:46,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {45402#true} assume ~send2~0 == ~id2~0; {45402#true} is VALID [2022-02-20 18:27:46,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {45402#true} assume 0 == ~mode2~0 % 256; {45402#true} is VALID [2022-02-20 18:27:46,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {45402#true} assume ~id3~0 >= 0; {45402#true} is VALID [2022-02-20 18:27:46,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {45402#true} assume 0 == ~st3~0; {45402#true} is VALID [2022-02-20 18:27:46,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {45402#true} assume ~send3~0 == ~id3~0; {45402#true} is VALID [2022-02-20 18:27:46,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {45402#true} assume 0 == ~mode3~0 % 256; {45402#true} is VALID [2022-02-20 18:27:46,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {45402#true} assume ~id4~0 >= 0; {45402#true} is VALID [2022-02-20 18:27:46,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {45402#true} assume 0 == ~st4~0; {45402#true} is VALID [2022-02-20 18:27:46,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {45402#true} assume ~send4~0 == ~id4~0; {45402#true} is VALID [2022-02-20 18:27:46,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {45402#true} assume 0 == ~mode4~0 % 256; {45402#true} is VALID [2022-02-20 18:27:46,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {45402#true} assume ~id1~0 != ~id2~0; {45402#true} is VALID [2022-02-20 18:27:46,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {45402#true} assume ~id1~0 != ~id3~0; {45402#true} is VALID [2022-02-20 18:27:46,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {45402#true} assume ~id1~0 != ~id4~0; {45402#true} is VALID [2022-02-20 18:27:46,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {45402#true} assume ~id2~0 != ~id3~0; {45402#true} is VALID [2022-02-20 18:27:46,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {45402#true} assume ~id2~0 != ~id4~0; {45402#true} is VALID [2022-02-20 18:27:46,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {45402#true} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {45402#true} is VALID [2022-02-20 18:27:46,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {45402#true} init_#res#1 := init_~tmp~0#1; {45402#true} is VALID [2022-02-20 18:27:46,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {45402#true} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {45402#true} is VALID [2022-02-20 18:27:46,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {45402#true} assume !(0 == main_~i2~0#1); {45402#true} is VALID [2022-02-20 18:27:46,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {45402#true} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {45402#true} is VALID [2022-02-20 18:27:46,919 INFO L290 TraceCheckUtils]: 30: Hoare triple {45402#true} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {45402#true} is VALID [2022-02-20 18:27:46,919 INFO L290 TraceCheckUtils]: 31: Hoare triple {45402#true} assume !(0 != ~mode1~0 % 256); {45402#true} is VALID [2022-02-20 18:27:46,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {45402#true} assume !(0 != ~alive1~0 % 256); {45402#true} is VALID [2022-02-20 18:27:46,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {45402#true} ~mode1~0 := 1; {45402#true} is VALID [2022-02-20 18:27:46,919 INFO L290 TraceCheckUtils]: 34: Hoare triple {45402#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {45402#true} is VALID [2022-02-20 18:27:46,919 INFO L290 TraceCheckUtils]: 35: Hoare triple {45402#true} assume !(0 != ~mode2~0 % 256); {45402#true} is VALID [2022-02-20 18:27:46,919 INFO L290 TraceCheckUtils]: 36: Hoare triple {45402#true} assume 0 != ~alive2~0 % 256; {45402#true} is VALID [2022-02-20 18:27:46,919 INFO L290 TraceCheckUtils]: 37: Hoare triple {45402#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {45402#true} is VALID [2022-02-20 18:27:46,920 INFO L290 TraceCheckUtils]: 38: Hoare triple {45402#true} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1; {45402#true} is VALID [2022-02-20 18:27:46,920 INFO L290 TraceCheckUtils]: 39: Hoare triple {45402#true} ~mode2~0 := 1; {45402#true} is VALID [2022-02-20 18:27:46,920 INFO L290 TraceCheckUtils]: 40: Hoare triple {45402#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {45402#true} is VALID [2022-02-20 18:27:46,920 INFO L290 TraceCheckUtils]: 41: Hoare triple {45402#true} assume !(0 != ~mode3~0 % 256); {45402#true} is VALID [2022-02-20 18:27:46,920 INFO L290 TraceCheckUtils]: 42: Hoare triple {45402#true} assume !(0 != ~alive3~0 % 256); {45402#true} is VALID [2022-02-20 18:27:46,920 INFO L290 TraceCheckUtils]: 43: Hoare triple {45402#true} assume !(~send3~0 != ~id3~0); {45402#true} is VALID [2022-02-20 18:27:46,920 INFO L290 TraceCheckUtils]: 44: Hoare triple {45402#true} ~mode3~0 := 1; {45402#true} is VALID [2022-02-20 18:27:46,920 INFO L290 TraceCheckUtils]: 45: Hoare triple {45402#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {45402#true} is VALID [2022-02-20 18:27:46,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {45402#true} assume !(0 != ~mode4~0 % 256); {45402#true} is VALID [2022-02-20 18:27:46,921 INFO L290 TraceCheckUtils]: 47: Hoare triple {45402#true} assume !(0 != ~alive4~0 % 256); {45402#true} is VALID [2022-02-20 18:27:46,921 INFO L290 TraceCheckUtils]: 48: Hoare triple {45402#true} assume !(~send4~0 != ~id4~0); {45402#true} is VALID [2022-02-20 18:27:46,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {45402#true} ~mode4~0 := 1; {45402#true} is VALID [2022-02-20 18:27:46,921 INFO L290 TraceCheckUtils]: 50: Hoare triple {45402#true} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {45402#true} is VALID [2022-02-20 18:27:46,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {45402#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {45402#true} is VALID [2022-02-20 18:27:46,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {45402#true} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {45404#(= |ULTIMATE.start_check_~tmp~1#1| 1)} is VALID [2022-02-20 18:27:46,922 INFO L290 TraceCheckUtils]: 53: Hoare triple {45404#(= |ULTIMATE.start_check_~tmp~1#1| 1)} check_#res#1 := check_~tmp~1#1; {45405#(= 1 |ULTIMATE.start_check_#res#1|)} is VALID [2022-02-20 18:27:46,922 INFO L290 TraceCheckUtils]: 54: Hoare triple {45405#(= 1 |ULTIMATE.start_check_#res#1|)} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {45406#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 18:27:46,923 INFO L290 TraceCheckUtils]: 55: Hoare triple {45406#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {45403#false} is VALID [2022-02-20 18:27:46,923 INFO L290 TraceCheckUtils]: 56: Hoare triple {45403#false} assume !false; {45403#false} is VALID [2022-02-20 18:27:46,923 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:27:46,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:46,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719878250] [2022-02-20 18:27:46,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719878250] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:46,924 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:46,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:27:46,924 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203006968] [2022-02-20 18:27:46,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:46,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 57 [2022-02-20 18:27:46,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:46,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:27:46,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:46,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:27:46,960 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:46,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:27:46,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:27:46,960 INFO L87 Difference]: Start difference. First operand 4432 states and 6575 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:27:54,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:54,833 INFO L93 Difference]: Finished difference Result 9346 states and 13632 transitions. [2022-02-20 18:27:54,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:27:54,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 57 [2022-02-20 18:27:54,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:54,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:27:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 234 transitions. [2022-02-20 18:27:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:27:54,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 234 transitions. [2022-02-20 18:27:54,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 234 transitions. [2022-02-20 18:27:54,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:57,859 INFO L225 Difference]: With dead ends: 9346 [2022-02-20 18:27:57,859 INFO L226 Difference]: Without dead ends: 9344 [2022-02-20 18:27:57,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:27:57,863 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 279 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:57,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 563 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:57,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9344 states. [2022-02-20 18:28:00,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9344 to 4816. [2022-02-20 18:28:00,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:00,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9344 states. Second operand has 4816 states, 4815 states have (on average 1.44527518172378) internal successors, (6959), 4815 states have internal predecessors, (6959), 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:28:00,749 INFO L74 IsIncluded]: Start isIncluded. First operand 9344 states. Second operand has 4816 states, 4815 states have (on average 1.44527518172378) internal successors, (6959), 4815 states have internal predecessors, (6959), 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:28:00,753 INFO L87 Difference]: Start difference. First operand 9344 states. Second operand has 4816 states, 4815 states have (on average 1.44527518172378) internal successors, (6959), 4815 states have internal predecessors, (6959), 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:28:03,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:03,201 INFO L93 Difference]: Finished difference Result 9344 states and 13503 transitions. [2022-02-20 18:28:03,201 INFO L276 IsEmpty]: Start isEmpty. Operand 9344 states and 13503 transitions. [2022-02-20 18:28:03,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:03,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:03,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 4816 states, 4815 states have (on average 1.44527518172378) internal successors, (6959), 4815 states have internal predecessors, (6959), 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 9344 states. [2022-02-20 18:28:03,218 INFO L87 Difference]: Start difference. First operand has 4816 states, 4815 states have (on average 1.44527518172378) internal successors, (6959), 4815 states have internal predecessors, (6959), 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 9344 states. [2022-02-20 18:28:05,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:05,576 INFO L93 Difference]: Finished difference Result 9344 states and 13503 transitions. [2022-02-20 18:28:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 9344 states and 13503 transitions. [2022-02-20 18:28:05,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:05,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:05,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:05,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4816 states, 4815 states have (on average 1.44527518172378) internal successors, (6959), 4815 states have internal predecessors, (6959), 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:28:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4816 states to 4816 states and 6959 transitions. [2022-02-20 18:28:06,405 INFO L78 Accepts]: Start accepts. Automaton has 4816 states and 6959 transitions. Word has length 57 [2022-02-20 18:28:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:06,405 INFO L470 AbstractCegarLoop]: Abstraction has 4816 states and 6959 transitions. [2022-02-20 18:28:06,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:28:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 4816 states and 6959 transitions. [2022-02-20 18:28:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:28:06,406 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:06,406 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, 1, 1, 1, 1] [2022-02-20 18:28:06,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:28:06,406 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:06,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:06,406 INFO L85 PathProgramCache]: Analyzing trace with hash 654846656, now seen corresponding path program 1 times [2022-02-20 18:28:06,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:06,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414514713] [2022-02-20 18:28:06,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:06,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:06,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {80956#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0; {80956#true} is VALID [2022-02-20 18:28:06,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {80956#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_#t~post34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {80956#true} is VALID [2022-02-20 18:28:06,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {80956#true} assume 0 == ~r1~0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,443 INFO L290 TraceCheckUtils]: 3: Hoare triple {80958#(<= ~r1~0 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,444 INFO L290 TraceCheckUtils]: 4: Hoare triple {80958#(<= ~r1~0 0)} assume ~id1~0 >= 0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {80958#(<= ~r1~0 0)} assume 0 == ~st1~0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {80958#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {80958#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {80958#(<= ~r1~0 0)} assume ~id2~0 >= 0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {80958#(<= ~r1~0 0)} assume 0 == ~st2~0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {80958#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {80958#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {80958#(<= ~r1~0 0)} assume ~id3~0 >= 0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {80958#(<= ~r1~0 0)} assume 0 == ~st3~0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {80958#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {80958#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {80958#(<= ~r1~0 0)} assume ~id4~0 >= 0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {80958#(<= ~r1~0 0)} assume 0 == ~st4~0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {80958#(<= ~r1~0 0)} assume ~send4~0 == ~id4~0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {80958#(<= ~r1~0 0)} assume 0 == ~mode4~0 % 256; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {80958#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {80958#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {80958#(<= ~r1~0 0)} assume ~id1~0 != ~id4~0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {80958#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {80958#(<= ~r1~0 0)} assume ~id2~0 != ~id4~0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {80958#(<= ~r1~0 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {80958#(<= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {80958#(<= ~r1~0 0)} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {80958#(<= ~r1~0 0)} assume !(0 == main_~i2~0#1); {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {80958#(<= ~r1~0 0)} ~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_~i2~0#1 := 0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {80958#(<= ~r1~0 0)} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,452 INFO L290 TraceCheckUtils]: 31: Hoare triple {80958#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {80958#(<= ~r1~0 0)} assume !(0 != ~alive1~0 % 256); {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {80958#(<= ~r1~0 0)} ~mode1~0 := 1; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,453 INFO L290 TraceCheckUtils]: 34: Hoare triple {80958#(<= ~r1~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,453 INFO L290 TraceCheckUtils]: 35: Hoare triple {80958#(<= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,453 INFO L290 TraceCheckUtils]: 36: Hoare triple {80958#(<= ~r1~0 0)} assume 0 != ~alive2~0 % 256; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,454 INFO L290 TraceCheckUtils]: 37: Hoare triple {80958#(<= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,454 INFO L290 TraceCheckUtils]: 38: Hoare triple {80958#(<= ~r1~0 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,454 INFO L290 TraceCheckUtils]: 39: Hoare triple {80958#(<= ~r1~0 0)} ~mode2~0 := 1; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,454 INFO L290 TraceCheckUtils]: 40: Hoare triple {80958#(<= ~r1~0 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,455 INFO L290 TraceCheckUtils]: 41: Hoare triple {80958#(<= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,455 INFO L290 TraceCheckUtils]: 42: Hoare triple {80958#(<= ~r1~0 0)} assume !(0 != ~alive3~0 % 256); {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,455 INFO L290 TraceCheckUtils]: 43: Hoare triple {80958#(<= ~r1~0 0)} assume !(~send3~0 != ~id3~0); {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,456 INFO L290 TraceCheckUtils]: 44: Hoare triple {80958#(<= ~r1~0 0)} ~mode3~0 := 1; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,456 INFO L290 TraceCheckUtils]: 45: Hoare triple {80958#(<= ~r1~0 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,456 INFO L290 TraceCheckUtils]: 46: Hoare triple {80958#(<= ~r1~0 0)} assume !(0 != ~mode4~0 % 256); {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,457 INFO L290 TraceCheckUtils]: 47: Hoare triple {80958#(<= ~r1~0 0)} assume !(0 != ~alive4~0 % 256); {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,457 INFO L290 TraceCheckUtils]: 48: Hoare triple {80958#(<= ~r1~0 0)} assume !(~send4~0 != ~id4~0); {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,457 INFO L290 TraceCheckUtils]: 49: Hoare triple {80958#(<= ~r1~0 0)} ~mode4~0 := 1; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,457 INFO L290 TraceCheckUtils]: 50: Hoare triple {80958#(<= ~r1~0 0)} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,458 INFO L290 TraceCheckUtils]: 51: Hoare triple {80958#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {80958#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:06,458 INFO L290 TraceCheckUtils]: 52: Hoare triple {80958#(<= ~r1~0 0)} assume !(~r1~0 < 4); {80957#false} is VALID [2022-02-20 18:28:06,458 INFO L290 TraceCheckUtils]: 53: Hoare triple {80957#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);check_~tmp~1#1 := 0; {80957#false} is VALID [2022-02-20 18:28:06,458 INFO L290 TraceCheckUtils]: 54: Hoare triple {80957#false} check_#res#1 := check_~tmp~1#1; {80957#false} is VALID [2022-02-20 18:28:06,459 INFO L290 TraceCheckUtils]: 55: Hoare triple {80957#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {80957#false} is VALID [2022-02-20 18:28:06,459 INFO L290 TraceCheckUtils]: 56: Hoare triple {80957#false} assume 0 == assert_~arg#1 % 256; {80957#false} is VALID [2022-02-20 18:28:06,459 INFO L290 TraceCheckUtils]: 57: Hoare triple {80957#false} assume !false; {80957#false} is VALID [2022-02-20 18:28:06,459 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:28:06,459 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:06,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414514713] [2022-02-20 18:28:06,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414514713] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:06,460 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:06,460 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:06,460 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123138371] [2022-02-20 18:28:06,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:06,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2022-02-20 18:28:06,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:06,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:28:06,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:06,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:06,509 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:06,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:06,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:06,510 INFO L87 Difference]: Start difference. First operand 4816 states and 6959 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:28:13,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:13,565 INFO L93 Difference]: Finished difference Result 11534 states and 16675 transitions. [2022-02-20 18:28:13,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:13,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2022-02-20 18:28:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:13,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:28:13,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2022-02-20 18:28:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:28:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2022-02-20 18:28:13,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 319 transitions. [2022-02-20 18:28:13,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 319 edges. 319 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:15,544 INFO L225 Difference]: With dead ends: 11534 [2022-02-20 18:28:15,544 INFO L226 Difference]: Without dead ends: 6748 [2022-02-20 18:28:15,547 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:28:15,548 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 65 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:15,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 227 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:15,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6748 states. [2022-02-20 18:28:20,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6748 to 6746. [2022-02-20 18:28:20,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:20,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6748 states. Second operand has 6746 states, 6745 states have (on average 1.4364714603409934) internal successors, (9689), 6745 states have internal predecessors, (9689), 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:28:20,031 INFO L74 IsIncluded]: Start isIncluded. First operand 6748 states. Second operand has 6746 states, 6745 states have (on average 1.4364714603409934) internal successors, (9689), 6745 states have internal predecessors, (9689), 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:28:20,036 INFO L87 Difference]: Start difference. First operand 6748 states. Second operand has 6746 states, 6745 states have (on average 1.4364714603409934) internal successors, (9689), 6745 states have internal predecessors, (9689), 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:28:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:21,341 INFO L93 Difference]: Finished difference Result 6748 states and 9690 transitions. [2022-02-20 18:28:21,341 INFO L276 IsEmpty]: Start isEmpty. Operand 6748 states and 9690 transitions. [2022-02-20 18:28:21,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:21,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:21,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 6746 states, 6745 states have (on average 1.4364714603409934) internal successors, (9689), 6745 states have internal predecessors, (9689), 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 6748 states. [2022-02-20 18:28:21,358 INFO L87 Difference]: Start difference. First operand has 6746 states, 6745 states have (on average 1.4364714603409934) internal successors, (9689), 6745 states have internal predecessors, (9689), 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 6748 states. [2022-02-20 18:28:22,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:22,758 INFO L93 Difference]: Finished difference Result 6748 states and 9690 transitions. [2022-02-20 18:28:22,759 INFO L276 IsEmpty]: Start isEmpty. Operand 6748 states and 9690 transitions. [2022-02-20 18:28:22,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:22,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:22,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:22,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6746 states, 6745 states have (on average 1.4364714603409934) internal successors, (9689), 6745 states have internal predecessors, (9689), 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:28:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6746 states to 6746 states and 9689 transitions. [2022-02-20 18:28:24,389 INFO L78 Accepts]: Start accepts. Automaton has 6746 states and 9689 transitions. Word has length 58 [2022-02-20 18:28:24,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:24,389 INFO L470 AbstractCegarLoop]: Abstraction has 6746 states and 9689 transitions. [2022-02-20 18:28:24,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:28:24,389 INFO L276 IsEmpty]: Start isEmpty. Operand 6746 states and 9689 transitions. [2022-02-20 18:28:24,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-20 18:28:24,392 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:24,392 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 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, 1] [2022-02-20 18:28:24,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:28:24,392 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:24,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:24,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2133316492, now seen corresponding path program 1 times [2022-02-20 18:28:24,393 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:24,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808967] [2022-02-20 18:28:24,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:24,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:24,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {116149#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0; {116149#true} is VALID [2022-02-20 18:28:24,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {116149#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_#t~post34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {116149#true} is VALID [2022-02-20 18:28:24,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {116149#true} assume 0 == ~r1~0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,468 INFO L290 TraceCheckUtils]: 3: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,468 INFO L290 TraceCheckUtils]: 4: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id1~0 >= 0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st1~0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send1~0 == ~id1~0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~mode1~0 % 256; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id2~0 >= 0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st2~0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send2~0 == ~id2~0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~mode2~0 % 256; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id3~0 >= 0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st3~0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send3~0 == ~id3~0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~mode3~0 % 256; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id4~0 >= 0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st4~0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send4~0 == ~id4~0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~mode4~0 % 256; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id1~0 != ~id2~0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id1~0 != ~id3~0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id1~0 != ~id4~0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id2~0 != ~id3~0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id2~0 != ~id4~0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} init_#res#1 := init_~tmp~0#1; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,485 INFO L290 TraceCheckUtils]: 28: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 == main_~i2~0#1); {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~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_~i2~0#1 := 0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~mode1~0 % 256); {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~alive1~0 % 256); {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~mode1~0 := 1; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,488 INFO L290 TraceCheckUtils]: 34: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,488 INFO L290 TraceCheckUtils]: 35: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~mode2~0 % 256); {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,488 INFO L290 TraceCheckUtils]: 36: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 != ~alive2~0 % 256; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,489 INFO L290 TraceCheckUtils]: 37: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,489 INFO L290 TraceCheckUtils]: 38: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,489 INFO L290 TraceCheckUtils]: 39: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~mode2~0 := 1; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,490 INFO L290 TraceCheckUtils]: 40: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,490 INFO L290 TraceCheckUtils]: 41: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~mode3~0 % 256); {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,490 INFO L290 TraceCheckUtils]: 42: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~alive3~0 % 256); {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,491 INFO L290 TraceCheckUtils]: 43: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(~send3~0 != ~id3~0); {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,491 INFO L290 TraceCheckUtils]: 44: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~mode3~0 := 1; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,491 INFO L290 TraceCheckUtils]: 45: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,492 INFO L290 TraceCheckUtils]: 46: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~mode4~0 % 256); {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,492 INFO L290 TraceCheckUtils]: 47: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 != ~alive4~0 % 256); {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,492 INFO L290 TraceCheckUtils]: 48: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(~send4~0 != ~id4~0); {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,493 INFO L290 TraceCheckUtils]: 49: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~mode4~0 := 1; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,493 INFO L290 TraceCheckUtils]: 50: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,494 INFO L290 TraceCheckUtils]: 51: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,494 INFO L290 TraceCheckUtils]: 52: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,494 INFO L290 TraceCheckUtils]: 53: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} check_#res#1 := check_~tmp~1#1; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,495 INFO L290 TraceCheckUtils]: 54: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,495 INFO L290 TraceCheckUtils]: 55: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 == assert_~arg#1 % 256); {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,495 INFO L290 TraceCheckUtils]: 56: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume { :end_inline_assert } true;main_#t~post34#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post34#1;havoc main_#t~post34#1; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,496 INFO L290 TraceCheckUtils]: 57: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:28:24,496 INFO L290 TraceCheckUtils]: 58: Hoare triple {116151#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,497 INFO L290 TraceCheckUtils]: 59: Hoare triple {116152#(<= ~r1~0 1)} assume !(node1_~m1~0#1 != ~nomsg~0); {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,497 INFO L290 TraceCheckUtils]: 60: Hoare triple {116152#(<= ~r1~0 1)} ~mode1~0 := 0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,497 INFO L290 TraceCheckUtils]: 61: Hoare triple {116152#(<= ~r1~0 1)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,498 INFO L290 TraceCheckUtils]: 62: Hoare triple {116152#(<= ~r1~0 1)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,498 INFO L290 TraceCheckUtils]: 63: Hoare triple {116152#(<= ~r1~0 1)} assume !(node2_~m2~0#1 != ~nomsg~0); {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,498 INFO L290 TraceCheckUtils]: 64: Hoare triple {116152#(<= ~r1~0 1)} ~mode2~0 := 0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,498 INFO L290 TraceCheckUtils]: 65: Hoare triple {116152#(<= ~r1~0 1)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,499 INFO L290 TraceCheckUtils]: 66: Hoare triple {116152#(<= ~r1~0 1)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,499 INFO L290 TraceCheckUtils]: 67: Hoare triple {116152#(<= ~r1~0 1)} assume !(node3_~m3~0#1 != ~nomsg~0); {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,499 INFO L290 TraceCheckUtils]: 68: Hoare triple {116152#(<= ~r1~0 1)} ~mode3~0 := 0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,499 INFO L290 TraceCheckUtils]: 69: Hoare triple {116152#(<= ~r1~0 1)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,500 INFO L290 TraceCheckUtils]: 70: Hoare triple {116152#(<= ~r1~0 1)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,500 INFO L290 TraceCheckUtils]: 71: Hoare triple {116152#(<= ~r1~0 1)} assume !(node4_~m4~0#1 != ~nomsg~0); {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,500 INFO L290 TraceCheckUtils]: 72: Hoare triple {116152#(<= ~r1~0 1)} ~mode4~0 := 0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,500 INFO L290 TraceCheckUtils]: 73: Hoare triple {116152#(<= ~r1~0 1)} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,501 INFO L290 TraceCheckUtils]: 74: Hoare triple {116152#(<= ~r1~0 1)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,501 INFO L290 TraceCheckUtils]: 75: Hoare triple {116152#(<= ~r1~0 1)} assume !(~r1~0 < 4); {116150#false} is VALID [2022-02-20 18:28:24,501 INFO L290 TraceCheckUtils]: 76: Hoare triple {116150#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);check_~tmp~1#1 := 0; {116150#false} is VALID [2022-02-20 18:28:24,501 INFO L290 TraceCheckUtils]: 77: Hoare triple {116150#false} check_#res#1 := check_~tmp~1#1; {116150#false} is VALID [2022-02-20 18:28:24,501 INFO L290 TraceCheckUtils]: 78: Hoare triple {116150#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {116150#false} is VALID [2022-02-20 18:28:24,501 INFO L290 TraceCheckUtils]: 79: Hoare triple {116150#false} assume 0 == assert_~arg#1 % 256; {116150#false} is VALID [2022-02-20 18:28:24,502 INFO L290 TraceCheckUtils]: 80: Hoare triple {116150#false} assume !false; {116150#false} is VALID [2022-02-20 18:28:24,502 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:28:24,502 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:24,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808967] [2022-02-20 18:28:24,502 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808967] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:28:24,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23354627] [2022-02-20 18:28:24,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:24,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:28:24,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:28:24,504 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:28:24,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 18:28:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:24,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 18:28:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:24,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:28:24,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {116149#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0; {116149#true} is VALID [2022-02-20 18:28:24,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {116149#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_#t~post34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {116149#true} is VALID [2022-02-20 18:28:24,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {116149#true} assume 0 == ~r1~0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,948 INFO L290 TraceCheckUtils]: 3: Hoare triple {116162#(= ~r1~0 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,948 INFO L290 TraceCheckUtils]: 4: Hoare triple {116162#(= ~r1~0 0)} assume ~id1~0 >= 0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {116162#(= ~r1~0 0)} assume 0 == ~st1~0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {116162#(= ~r1~0 0)} assume ~send1~0 == ~id1~0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {116162#(= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {116162#(= ~r1~0 0)} assume ~id2~0 >= 0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {116162#(= ~r1~0 0)} assume 0 == ~st2~0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {116162#(= ~r1~0 0)} assume ~send2~0 == ~id2~0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {116162#(= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {116162#(= ~r1~0 0)} assume ~id3~0 >= 0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {116162#(= ~r1~0 0)} assume 0 == ~st3~0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {116162#(= ~r1~0 0)} assume ~send3~0 == ~id3~0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {116162#(= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {116162#(= ~r1~0 0)} assume ~id4~0 >= 0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {116162#(= ~r1~0 0)} assume 0 == ~st4~0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {116162#(= ~r1~0 0)} assume ~send4~0 == ~id4~0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {116162#(= ~r1~0 0)} assume 0 == ~mode4~0 % 256; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {116162#(= ~r1~0 0)} assume ~id1~0 != ~id2~0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {116162#(= ~r1~0 0)} assume ~id1~0 != ~id3~0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {116162#(= ~r1~0 0)} assume ~id1~0 != ~id4~0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {116162#(= ~r1~0 0)} assume ~id2~0 != ~id3~0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {116162#(= ~r1~0 0)} assume ~id2~0 != ~id4~0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {116162#(= ~r1~0 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {116162#(= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {116162#(= ~r1~0 0)} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {116162#(= ~r1~0 0)} assume !(0 == main_~i2~0#1); {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {116162#(= ~r1~0 0)} ~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_~i2~0#1 := 0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {116162#(= ~r1~0 0)} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {116162#(= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {116162#(= ~r1~0 0)} assume !(0 != ~alive1~0 % 256); {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {116162#(= ~r1~0 0)} ~mode1~0 := 1; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {116162#(= ~r1~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {116162#(= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {116162#(= ~r1~0 0)} assume 0 != ~alive2~0 % 256; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {116162#(= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,957 INFO L290 TraceCheckUtils]: 38: Hoare triple {116162#(= ~r1~0 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {116162#(= ~r1~0 0)} ~mode2~0 := 1; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,958 INFO L290 TraceCheckUtils]: 40: Hoare triple {116162#(= ~r1~0 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,958 INFO L290 TraceCheckUtils]: 41: Hoare triple {116162#(= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,958 INFO L290 TraceCheckUtils]: 42: Hoare triple {116162#(= ~r1~0 0)} assume !(0 != ~alive3~0 % 256); {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,959 INFO L290 TraceCheckUtils]: 43: Hoare triple {116162#(= ~r1~0 0)} assume !(~send3~0 != ~id3~0); {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,959 INFO L290 TraceCheckUtils]: 44: Hoare triple {116162#(= ~r1~0 0)} ~mode3~0 := 1; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,959 INFO L290 TraceCheckUtils]: 45: Hoare triple {116162#(= ~r1~0 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,960 INFO L290 TraceCheckUtils]: 46: Hoare triple {116162#(= ~r1~0 0)} assume !(0 != ~mode4~0 % 256); {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,960 INFO L290 TraceCheckUtils]: 47: Hoare triple {116162#(= ~r1~0 0)} assume !(0 != ~alive4~0 % 256); {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,960 INFO L290 TraceCheckUtils]: 48: Hoare triple {116162#(= ~r1~0 0)} assume !(~send4~0 != ~id4~0); {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,961 INFO L290 TraceCheckUtils]: 49: Hoare triple {116162#(= ~r1~0 0)} ~mode4~0 := 1; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,961 INFO L290 TraceCheckUtils]: 50: Hoare triple {116162#(= ~r1~0 0)} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,961 INFO L290 TraceCheckUtils]: 51: Hoare triple {116162#(= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,962 INFO L290 TraceCheckUtils]: 52: Hoare triple {116162#(= ~r1~0 0)} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {116313#(and (<= 1 |ULTIMATE.start_check_~tmp~1#1|) (= ~r1~0 0))} is VALID [2022-02-20 18:28:24,962 INFO L290 TraceCheckUtils]: 53: Hoare triple {116313#(and (<= 1 |ULTIMATE.start_check_~tmp~1#1|) (= ~r1~0 0))} check_#res#1 := check_~tmp~1#1; {116317#(and (<= 1 |ULTIMATE.start_check_#res#1|) (= ~r1~0 0))} is VALID [2022-02-20 18:28:24,962 INFO L290 TraceCheckUtils]: 54: Hoare triple {116317#(and (<= 1 |ULTIMATE.start_check_#res#1|) (= ~r1~0 0))} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,963 INFO L290 TraceCheckUtils]: 55: Hoare triple {116162#(= ~r1~0 0)} assume !(0 == assert_~arg#1 % 256); {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,963 INFO L290 TraceCheckUtils]: 56: Hoare triple {116162#(= ~r1~0 0)} assume { :end_inline_assert } true;main_#t~post34#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post34#1;havoc main_#t~post34#1; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,963 INFO L290 TraceCheckUtils]: 57: Hoare triple {116162#(= ~r1~0 0)} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {116162#(= ~r1~0 0)} is VALID [2022-02-20 18:28:24,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {116162#(= ~r1~0 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,964 INFO L290 TraceCheckUtils]: 59: Hoare triple {116152#(<= ~r1~0 1)} assume !(node1_~m1~0#1 != ~nomsg~0); {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,964 INFO L290 TraceCheckUtils]: 60: Hoare triple {116152#(<= ~r1~0 1)} ~mode1~0 := 0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,964 INFO L290 TraceCheckUtils]: 61: Hoare triple {116152#(<= ~r1~0 1)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,965 INFO L290 TraceCheckUtils]: 62: Hoare triple {116152#(<= ~r1~0 1)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,965 INFO L290 TraceCheckUtils]: 63: Hoare triple {116152#(<= ~r1~0 1)} assume !(node2_~m2~0#1 != ~nomsg~0); {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,965 INFO L290 TraceCheckUtils]: 64: Hoare triple {116152#(<= ~r1~0 1)} ~mode2~0 := 0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,966 INFO L290 TraceCheckUtils]: 65: Hoare triple {116152#(<= ~r1~0 1)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,966 INFO L290 TraceCheckUtils]: 66: Hoare triple {116152#(<= ~r1~0 1)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,966 INFO L290 TraceCheckUtils]: 67: Hoare triple {116152#(<= ~r1~0 1)} assume !(node3_~m3~0#1 != ~nomsg~0); {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,966 INFO L290 TraceCheckUtils]: 68: Hoare triple {116152#(<= ~r1~0 1)} ~mode3~0 := 0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,967 INFO L290 TraceCheckUtils]: 69: Hoare triple {116152#(<= ~r1~0 1)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,967 INFO L290 TraceCheckUtils]: 70: Hoare triple {116152#(<= ~r1~0 1)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,967 INFO L290 TraceCheckUtils]: 71: Hoare triple {116152#(<= ~r1~0 1)} assume !(node4_~m4~0#1 != ~nomsg~0); {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,968 INFO L290 TraceCheckUtils]: 72: Hoare triple {116152#(<= ~r1~0 1)} ~mode4~0 := 0; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,968 INFO L290 TraceCheckUtils]: 73: Hoare triple {116152#(<= ~r1~0 1)} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,968 INFO L290 TraceCheckUtils]: 74: Hoare triple {116152#(<= ~r1~0 1)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {116152#(<= ~r1~0 1)} is VALID [2022-02-20 18:28:24,968 INFO L290 TraceCheckUtils]: 75: Hoare triple {116152#(<= ~r1~0 1)} assume !(~r1~0 < 4); {116150#false} is VALID [2022-02-20 18:28:24,969 INFO L290 TraceCheckUtils]: 76: Hoare triple {116150#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);check_~tmp~1#1 := 0; {116150#false} is VALID [2022-02-20 18:28:24,969 INFO L290 TraceCheckUtils]: 77: Hoare triple {116150#false} check_#res#1 := check_~tmp~1#1; {116150#false} is VALID [2022-02-20 18:28:24,969 INFO L290 TraceCheckUtils]: 78: Hoare triple {116150#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {116150#false} is VALID [2022-02-20 18:28:24,969 INFO L290 TraceCheckUtils]: 79: Hoare triple {116150#false} assume 0 == assert_~arg#1 % 256; {116150#false} is VALID [2022-02-20 18:28:24,969 INFO L290 TraceCheckUtils]: 80: Hoare triple {116150#false} assume !false; {116150#false} is VALID [2022-02-20 18:28:24,969 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:28:24,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:28:25,671 INFO L290 TraceCheckUtils]: 80: Hoare triple {116150#false} assume !false; {116150#false} is VALID [2022-02-20 18:28:25,671 INFO L290 TraceCheckUtils]: 79: Hoare triple {116150#false} assume 0 == assert_~arg#1 % 256; {116150#false} is VALID [2022-02-20 18:28:25,671 INFO L290 TraceCheckUtils]: 78: Hoare triple {116150#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {116150#false} is VALID [2022-02-20 18:28:25,671 INFO L290 TraceCheckUtils]: 77: Hoare triple {116150#false} check_#res#1 := check_~tmp~1#1; {116150#false} is VALID [2022-02-20 18:28:25,671 INFO L290 TraceCheckUtils]: 76: Hoare triple {116150#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);check_~tmp~1#1 := 0; {116150#false} is VALID [2022-02-20 18:28:25,672 INFO L290 TraceCheckUtils]: 75: Hoare triple {116414#(< ~r1~0 4)} assume !(~r1~0 < 4); {116150#false} is VALID [2022-02-20 18:28:25,672 INFO L290 TraceCheckUtils]: 74: Hoare triple {116414#(< ~r1~0 4)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {116414#(< ~r1~0 4)} is VALID [2022-02-20 18:28:25,672 INFO L290 TraceCheckUtils]: 73: Hoare triple {116414#(< ~r1~0 4)} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {116414#(< ~r1~0 4)} is VALID [2022-02-20 18:28:25,673 INFO L290 TraceCheckUtils]: 72: Hoare triple {116414#(< ~r1~0 4)} ~mode4~0 := 0; {116414#(< ~r1~0 4)} is VALID [2022-02-20 18:28:25,673 INFO L290 TraceCheckUtils]: 71: Hoare triple {116414#(< ~r1~0 4)} assume !(node4_~m4~0#1 != ~nomsg~0); {116414#(< ~r1~0 4)} is VALID [2022-02-20 18:28:25,673 INFO L290 TraceCheckUtils]: 70: Hoare triple {116414#(< ~r1~0 4)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {116414#(< ~r1~0 4)} is VALID [2022-02-20 18:28:25,674 INFO L290 TraceCheckUtils]: 69: Hoare triple {116414#(< ~r1~0 4)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {116414#(< ~r1~0 4)} is VALID [2022-02-20 18:28:25,674 INFO L290 TraceCheckUtils]: 68: Hoare triple {116414#(< ~r1~0 4)} ~mode3~0 := 0; {116414#(< ~r1~0 4)} is VALID [2022-02-20 18:28:25,674 INFO L290 TraceCheckUtils]: 67: Hoare triple {116414#(< ~r1~0 4)} assume !(node3_~m3~0#1 != ~nomsg~0); {116414#(< ~r1~0 4)} is VALID [2022-02-20 18:28:25,675 INFO L290 TraceCheckUtils]: 66: Hoare triple {116414#(< ~r1~0 4)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {116414#(< ~r1~0 4)} is VALID [2022-02-20 18:28:25,675 INFO L290 TraceCheckUtils]: 65: Hoare triple {116414#(< ~r1~0 4)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {116414#(< ~r1~0 4)} is VALID [2022-02-20 18:28:25,675 INFO L290 TraceCheckUtils]: 64: Hoare triple {116414#(< ~r1~0 4)} ~mode2~0 := 0; {116414#(< ~r1~0 4)} is VALID [2022-02-20 18:28:25,676 INFO L290 TraceCheckUtils]: 63: Hoare triple {116414#(< ~r1~0 4)} assume !(node2_~m2~0#1 != ~nomsg~0); {116414#(< ~r1~0 4)} is VALID [2022-02-20 18:28:25,676 INFO L290 TraceCheckUtils]: 62: Hoare triple {116414#(< ~r1~0 4)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {116414#(< ~r1~0 4)} is VALID [2022-02-20 18:28:25,676 INFO L290 TraceCheckUtils]: 61: Hoare triple {116414#(< ~r1~0 4)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {116414#(< ~r1~0 4)} is VALID [2022-02-20 18:28:25,677 INFO L290 TraceCheckUtils]: 60: Hoare triple {116414#(< ~r1~0 4)} ~mode1~0 := 0; {116414#(< ~r1~0 4)} is VALID [2022-02-20 18:28:25,677 INFO L290 TraceCheckUtils]: 59: Hoare triple {116414#(< ~r1~0 4)} assume !(node1_~m1~0#1 != ~nomsg~0); {116414#(< ~r1~0 4)} is VALID [2022-02-20 18:28:25,678 INFO L290 TraceCheckUtils]: 58: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {116414#(< ~r1~0 4)} is VALID [2022-02-20 18:28:25,678 INFO L290 TraceCheckUtils]: 57: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,678 INFO L290 TraceCheckUtils]: 56: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume { :end_inline_assert } true;main_#t~post34#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post34#1;havoc main_#t~post34#1; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,679 INFO L290 TraceCheckUtils]: 55: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(0 == assert_~arg#1 % 256); {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,679 INFO L290 TraceCheckUtils]: 54: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,679 INFO L290 TraceCheckUtils]: 53: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} check_#res#1 := check_~tmp~1#1; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,680 INFO L290 TraceCheckUtils]: 52: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,680 INFO L290 TraceCheckUtils]: 51: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,680 INFO L290 TraceCheckUtils]: 50: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,681 INFO L290 TraceCheckUtils]: 49: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} ~mode4~0 := 1; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,681 INFO L290 TraceCheckUtils]: 48: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(~send4~0 != ~id4~0); {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,681 INFO L290 TraceCheckUtils]: 47: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(0 != ~alive4~0 % 256); {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,682 INFO L290 TraceCheckUtils]: 46: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(0 != ~mode4~0 % 256); {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,682 INFO L290 TraceCheckUtils]: 45: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,682 INFO L290 TraceCheckUtils]: 44: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} ~mode3~0 := 1; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,683 INFO L290 TraceCheckUtils]: 43: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(~send3~0 != ~id3~0); {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,683 INFO L290 TraceCheckUtils]: 42: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(0 != ~alive3~0 % 256); {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,683 INFO L290 TraceCheckUtils]: 41: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(0 != ~mode3~0 % 256); {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,684 INFO L290 TraceCheckUtils]: 39: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} ~mode2~0 := 1; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,684 INFO L290 TraceCheckUtils]: 38: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,685 INFO L290 TraceCheckUtils]: 37: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,685 INFO L290 TraceCheckUtils]: 36: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume 0 != ~alive2~0 % 256; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,685 INFO L290 TraceCheckUtils]: 35: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(0 != ~mode2~0 % 256); {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,686 INFO L290 TraceCheckUtils]: 34: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} ~mode1~0 := 1; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(0 != ~alive1~0 % 256); {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(0 != ~mode1~0 % 256); {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} ~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_~i2~0#1 := 0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume !(0 == main_~i2~0#1); {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} init_#res#1 := init_~tmp~0#1; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~id2~0 != ~id4~0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~id2~0 != ~id3~0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~id1~0 != ~id4~0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~id1~0 != ~id3~0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~id1~0 != ~id2~0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume 0 == ~mode4~0 % 256; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~send4~0 == ~id4~0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume 0 == ~st4~0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~id4~0 >= 0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume 0 == ~mode3~0 % 256; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~send3~0 == ~id3~0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume 0 == ~st3~0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~id3~0 >= 0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume 0 == ~mode2~0 % 256; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~send2~0 == ~id2~0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume 0 == ~st2~0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~id2~0 >= 0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume 0 == ~mode1~0 % 256; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~send1~0 == ~id1~0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume 0 == ~st1~0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,715 INFO L290 TraceCheckUtils]: 4: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~id1~0 >= 0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {116149#true} assume 0 == ~r1~0; {116466#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (< (mod (+ ~r1~0 1) 256) 4))} is VALID [2022-02-20 18:28:25,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {116149#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_#t~post34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {116149#true} is VALID [2022-02-20 18:28:25,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {116149#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~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;~alive4~0 := 0; {116149#true} is VALID [2022-02-20 18:28:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:28:25,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23354627] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:28:25,717 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:28:25,717 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2022-02-20 18:28:25,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749021300] [2022-02-20 18:28:25,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:28:25,718 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 23.22222222222222) internal successors, (209), 9 states have internal predecessors, (209), 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 81 [2022-02-20 18:28:25,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:25,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 23.22222222222222) internal successors, (209), 9 states have internal predecessors, (209), 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:28:25,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:25,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:28:25,869 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:25,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:28:25,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:28:25,870 INFO L87 Difference]: Start difference. First operand 6746 states and 9689 transitions. Second operand has 9 states, 9 states have (on average 23.22222222222222) internal successors, (209), 9 states have internal predecessors, (209), 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)