./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a82391ebb044799bad480df1878c271ded14d474016d9ad90c3e7a554ae5460f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:50:42,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:50:42,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:50:42,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:50:42,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:50:42,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:50:42,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:50:42,369 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:50:42,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:50:42,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:50:42,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:50:42,373 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:50:42,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:50:42,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:50:42,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:50:42,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:50:42,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:50:42,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:50:42,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:50:42,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:50:42,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:50:42,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:50:42,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:50:42,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:50:42,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:50:42,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:50:42,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:50:42,389 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:50:42,390 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:50:42,391 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:50:42,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:50:42,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:50:42,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:50:42,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:50:42,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:50:42,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:50:42,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:50:42,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:50:42,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:50:42,397 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:50:42,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:50:42,398 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:50:42,416 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:50:42,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:50:42,417 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:50:42,418 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:50:42,418 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:50:42,418 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:50:42,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:50:42,419 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:50:42,420 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:50:42,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:50:42,420 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:50:42,420 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:50:42,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:50:42,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:50:42,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:50:42,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:50:42,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:50:42,422 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:50:42,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:50:42,422 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:50:42,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:50:42,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:50:42,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:50:42,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:50:42,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:42,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:50:42,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:50:42,424 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:50:42,425 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:50:42,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:50:42,425 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:50:42,425 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:50:42,426 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:50:42,426 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 -> a82391ebb044799bad480df1878c271ded14d474016d9ad90c3e7a554ae5460f [2022-02-20 18:50:42,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:50:42,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:50:42,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:50:42,653 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:50:42,654 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:50:42,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:50:42,703 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f17dd800/cccb4b6c75b84532b191735fc60748e7/FLAG75c57b798 [2022-02-20 18:50:43,076 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:50:43,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:50:43,083 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f17dd800/cccb4b6c75b84532b191735fc60748e7/FLAG75c57b798 [2022-02-20 18:50:43,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f17dd800/cccb4b6c75b84532b191735fc60748e7 [2022-02-20 18:50:43,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:50:43,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:50:43,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:43,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:50:43,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:50:43,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:43" (1/1) ... [2022-02-20 18:50:43,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28bca394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:43, skipping insertion in model container [2022-02-20 18:50:43,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:43" (1/1) ... [2022-02-20 18:50:43,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:50:43,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:50:43,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4067,4080] [2022-02-20 18:50:43,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:43,750 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:50:43,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4067,4080] [2022-02-20 18:50:43,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:43,797 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:50:43,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:43 WrapperNode [2022-02-20 18:50:43,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:43,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:43,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:50:43,799 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:50:43,808 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:50:43" (1/1) ... [2022-02-20 18:50:43,826 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:50:43" (1/1) ... [2022-02-20 18:50:43,863 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 270 [2022-02-20 18:50:43,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:43,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:50:43,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:50:43,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:50:43,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:43" (1/1) ... [2022-02-20 18:50:43,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:43" (1/1) ... [2022-02-20 18:50:43,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:43" (1/1) ... [2022-02-20 18:50:43,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:43" (1/1) ... [2022-02-20 18:50:43,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:43" (1/1) ... [2022-02-20 18:50:43,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:43" (1/1) ... [2022-02-20 18:50:43,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:43" (1/1) ... [2022-02-20 18:50:43,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:50:43,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:50:43,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:50:43,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:50:43,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:43" (1/1) ... [2022-02-20 18:50:43,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:43,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:50:43,960 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:50:43,982 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:50:44,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:50:44,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:50:44,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:50:44,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:50:44,124 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:50:44,126 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:50:44,492 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:50:44,497 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:50:44,498 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:50:44,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:44 BoogieIcfgContainer [2022-02-20 18:50:44,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:50:44,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:50:44,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:50:44,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:50:44,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:50:43" (1/3) ... [2022-02-20 18:50:44,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1e6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:44, skipping insertion in model container [2022-02-20 18:50:44,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:43" (2/3) ... [2022-02-20 18:50:44,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1e6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:44, skipping insertion in model container [2022-02-20 18:50:44,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:44" (3/3) ... [2022-02-20 18:50:44,506 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:50:44,510 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:50:44,510 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:50:44,545 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:50:44,550 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:50:44,551 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:50:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 61 states have internal predecessors, (103), 0 states have call successors, (0), 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:50:44,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 18:50:44,570 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:44,571 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] [2022-02-20 18:50:44,571 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:44,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:44,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1007825277, now seen corresponding path program 1 times [2022-02-20 18:50:44,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:44,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764278860] [2022-02-20 18:50:44,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:44,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:44,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {65#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_1482~0 := 0;~__return_1537~0 := 0; {65#true} is VALID [2022-02-20 18:50:44,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {65#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {65#true} is VALID [2022-02-20 18:50:44,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {65#true} assume 0 == ~r1~0; {65#true} is VALID [2022-02-20 18:50:44,853 INFO L290 TraceCheckUtils]: 3: Hoare triple {65#true} assume ~id1~0 >= 0; {65#true} is VALID [2022-02-20 18:50:44,854 INFO L290 TraceCheckUtils]: 4: Hoare triple {65#true} assume 0 == ~st1~0; {65#true} is VALID [2022-02-20 18:50:44,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {65#true} assume ~send1~0 == ~id1~0; {65#true} is VALID [2022-02-20 18:50:44,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {65#true} assume 0 == ~mode1~0 % 256; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:44,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:44,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:44,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:44,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:44,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:44,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:44,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:44,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:44,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:44,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:44,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:44,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:44,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:44,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {66#false} is VALID [2022-02-20 18:50:44,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {66#false} assume !(main_~node1__m1~0#1 != ~nomsg~0); {66#false} is VALID [2022-02-20 18:50:44,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {66#false} ~mode1~0 := 0; {66#false} is VALID [2022-02-20 18:50:44,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {66#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {66#false} is VALID [2022-02-20 18:50:44,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {66#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {66#false} is VALID [2022-02-20 18:50:44,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {66#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {66#false} is VALID [2022-02-20 18:50:44,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {66#false} ~mode2~0 := 0; {66#false} is VALID [2022-02-20 18:50:44,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {66#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {66#false} is VALID [2022-02-20 18:50:44,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {66#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {66#false} is VALID [2022-02-20 18:50:44,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {66#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {66#false} is VALID [2022-02-20 18:50:44,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {66#false} ~mode3~0 := 0; {66#false} is VALID [2022-02-20 18:50:44,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {66#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {66#false} is VALID [2022-02-20 18:50:44,876 INFO L290 TraceCheckUtils]: 32: Hoare triple {66#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {66#false} is VALID [2022-02-20 18:50:44,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {66#false} ~__return_1482~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1482~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {66#false} is VALID [2022-02-20 18:50:44,877 INFO L290 TraceCheckUtils]: 34: Hoare triple {66#false} assume 0 == main_~assert__arg~0#1 % 256; {66#false} is VALID [2022-02-20 18:50:44,877 INFO L290 TraceCheckUtils]: 35: Hoare triple {66#false} assume !false; {66#false} is VALID [2022-02-20 18:50:44,879 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:50:44,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:44,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764278860] [2022-02-20 18:50:44,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764278860] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:44,880 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:44,880 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:50:44,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082535239] [2022-02-20 18:50:44,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:44,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-02-20 18:50:44,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:44,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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:50:44,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:44,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:50:44,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:44,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:50:44,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:50:44,975 INFO L87 Difference]: Start difference. First operand has 62 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 61 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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:50:45,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:45,217 INFO L93 Difference]: Finished difference Result 140 states and 224 transitions. [2022-02-20 18:50:45,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:50:45,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-02-20 18:50:45,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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:50:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2022-02-20 18:50:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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:50:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2022-02-20 18:50:45,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 224 transitions. [2022-02-20 18:50:45,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:45,519 INFO L225 Difference]: With dead ends: 140 [2022-02-20 18:50:45,519 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 18:50:45,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:50:45,524 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 68 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:45,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 215 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:45,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 18:50:45,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2022-02-20 18:50:45,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:45,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 89 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 88 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:50:45,561 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 89 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 88 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:50:45,561 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 89 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 88 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:50:45,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:45,566 INFO L93 Difference]: Finished difference Result 91 states and 131 transitions. [2022-02-20 18:50:45,566 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2022-02-20 18:50:45,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:45,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:45,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 88 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 91 states. [2022-02-20 18:50:45,569 INFO L87 Difference]: Start difference. First operand has 89 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 88 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 91 states. [2022-02-20 18:50:45,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:45,573 INFO L93 Difference]: Finished difference Result 91 states and 131 transitions. [2022-02-20 18:50:45,573 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2022-02-20 18:50:45,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:45,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:45,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:45,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:45,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 88 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:50:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 130 transitions. [2022-02-20 18:50:45,584 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 130 transitions. Word has length 36 [2022-02-20 18:50:45,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:45,585 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 130 transitions. [2022-02-20 18:50:45,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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:50:45,586 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 130 transitions. [2022-02-20 18:50:45,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:50:45,588 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:45,588 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] [2022-02-20 18:50:45,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:50:45,588 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:45,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:45,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1176817218, now seen corresponding path program 1 times [2022-02-20 18:50:45,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:45,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464835343] [2022-02-20 18:50:45,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:45,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:45,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {553#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_1482~0 := 0;~__return_1537~0 := 0; {553#true} is VALID [2022-02-20 18:50:45,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {553#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {553#true} is VALID [2022-02-20 18:50:45,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {553#true} assume 0 == ~r1~0; {553#true} is VALID [2022-02-20 18:50:45,693 INFO L290 TraceCheckUtils]: 3: Hoare triple {553#true} assume ~id1~0 >= 0; {553#true} is VALID [2022-02-20 18:50:45,693 INFO L290 TraceCheckUtils]: 4: Hoare triple {553#true} assume 0 == ~st1~0; {553#true} is VALID [2022-02-20 18:50:45,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {553#true} assume ~send1~0 == ~id1~0; {553#true} is VALID [2022-02-20 18:50:45,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {553#true} assume 0 == ~mode1~0 % 256; {553#true} is VALID [2022-02-20 18:50:45,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {553#true} assume ~id2~0 >= 0; {553#true} is VALID [2022-02-20 18:50:45,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {553#true} assume 0 == ~st2~0; {553#true} is VALID [2022-02-20 18:50:45,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {553#true} assume ~send2~0 == ~id2~0; {553#true} is VALID [2022-02-20 18:50:45,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {553#true} assume 0 == ~mode2~0 % 256; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:45,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:45,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:45,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:45,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:45,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:45,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:45,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:45,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:45,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:45,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:45,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:45,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:45,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:45,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:45,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {554#false} is VALID [2022-02-20 18:50:45,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {554#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {554#false} is VALID [2022-02-20 18:50:45,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {554#false} ~mode2~0 := 0; {554#false} is VALID [2022-02-20 18:50:45,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {554#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {554#false} is VALID [2022-02-20 18:50:45,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {554#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {554#false} is VALID [2022-02-20 18:50:45,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {554#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {554#false} is VALID [2022-02-20 18:50:45,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {554#false} ~mode3~0 := 0; {554#false} is VALID [2022-02-20 18:50:45,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {554#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {554#false} is VALID [2022-02-20 18:50:45,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {554#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {554#false} is VALID [2022-02-20 18:50:45,706 INFO L290 TraceCheckUtils]: 34: Hoare triple {554#false} ~__return_1482~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1482~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {554#false} is VALID [2022-02-20 18:50:45,706 INFO L290 TraceCheckUtils]: 35: Hoare triple {554#false} assume 0 == main_~assert__arg~0#1 % 256; {554#false} is VALID [2022-02-20 18:50:45,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {554#false} assume !false; {554#false} is VALID [2022-02-20 18:50:45,708 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:50:45,708 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:45,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464835343] [2022-02-20 18:50:45,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464835343] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:45,709 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:45,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:50:45,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543427719] [2022-02-20 18:50:45,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:45,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:50:45,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:45,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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:50:45,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:45,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:50:45,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:45,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:50:45,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:50:45,743 INFO L87 Difference]: Start difference. First operand 89 states and 130 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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:50:45,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:45,917 INFO L93 Difference]: Finished difference Result 213 states and 326 transitions. [2022-02-20 18:50:45,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:50:45,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:50:45,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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:50:45,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2022-02-20 18:50:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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:50:45,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2022-02-20 18:50:45,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 195 transitions. [2022-02-20 18:50:46,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:46,109 INFO L225 Difference]: With dead ends: 213 [2022-02-20 18:50:46,109 INFO L226 Difference]: Without dead ends: 143 [2022-02-20 18:50:46,114 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:50:46,115 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 48 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 182 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:50:46,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 182 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:46,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-02-20 18:50:46,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-02-20 18:50:46,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:46,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 141 states, 140 states have (on average 1.5142857142857142) internal successors, (212), 140 states have internal predecessors, (212), 0 states have call successors, (0), 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:50:46,143 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 141 states, 140 states have (on average 1.5142857142857142) internal successors, (212), 140 states have internal predecessors, (212), 0 states have call successors, (0), 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:50:46,143 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 141 states, 140 states have (on average 1.5142857142857142) internal successors, (212), 140 states have internal predecessors, (212), 0 states have call successors, (0), 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:50:46,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:46,149 INFO L93 Difference]: Finished difference Result 143 states and 213 transitions. [2022-02-20 18:50:46,149 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2022-02-20 18:50:46,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:46,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:46,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 140 states have (on average 1.5142857142857142) internal successors, (212), 140 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 143 states. [2022-02-20 18:50:46,156 INFO L87 Difference]: Start difference. First operand has 141 states, 140 states have (on average 1.5142857142857142) internal successors, (212), 140 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 143 states. [2022-02-20 18:50:46,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:46,164 INFO L93 Difference]: Finished difference Result 143 states and 213 transitions. [2022-02-20 18:50:46,164 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2022-02-20 18:50:46,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:46,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:46,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:46,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:46,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.5142857142857142) internal successors, (212), 140 states have internal predecessors, (212), 0 states have call successors, (0), 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:50:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2022-02-20 18:50:46,171 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 37 [2022-02-20 18:50:46,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:46,172 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2022-02-20 18:50:46,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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:50:46,172 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2022-02-20 18:50:46,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 18:50:46,174 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:46,175 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] [2022-02-20 18:50:46,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:50:46,178 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:46,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:46,179 INFO L85 PathProgramCache]: Analyzing trace with hash 761408425, now seen corresponding path program 1 times [2022-02-20 18:50:46,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:46,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645068391] [2022-02-20 18:50:46,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:46,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:46,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {1321#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_1482~0 := 0;~__return_1537~0 := 0; {1321#true} is VALID [2022-02-20 18:50:46,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {1321#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {1321#true} is VALID [2022-02-20 18:50:46,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {1321#true} assume 0 == ~r1~0; {1321#true} is VALID [2022-02-20 18:50:46,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {1321#true} assume ~id1~0 >= 0; {1321#true} is VALID [2022-02-20 18:50:46,277 INFO L290 TraceCheckUtils]: 4: Hoare triple {1321#true} assume 0 == ~st1~0; {1321#true} is VALID [2022-02-20 18:50:46,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {1321#true} assume ~send1~0 == ~id1~0; {1321#true} is VALID [2022-02-20 18:50:46,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {1321#true} assume 0 == ~mode1~0 % 256; {1321#true} is VALID [2022-02-20 18:50:46,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {1321#true} assume ~id2~0 >= 0; {1321#true} is VALID [2022-02-20 18:50:46,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {1321#true} assume 0 == ~st2~0; {1321#true} is VALID [2022-02-20 18:50:46,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {1321#true} assume ~send2~0 == ~id2~0; {1321#true} is VALID [2022-02-20 18:50:46,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {1321#true} assume 0 == ~mode2~0 % 256; {1321#true} is VALID [2022-02-20 18:50:46,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {1321#true} assume ~id3~0 >= 0; {1321#true} is VALID [2022-02-20 18:50:46,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {1321#true} assume 0 == ~st3~0; {1321#true} is VALID [2022-02-20 18:50:46,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {1321#true} assume ~send3~0 == ~id3~0; {1321#true} is VALID [2022-02-20 18:50:46,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {1321#true} assume 0 == ~mode3~0 % 256; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:46,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:46,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:46,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:46,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:46,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:46,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:46,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:46,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:46,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:46,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:46,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:46,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~nomsg~0); {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:46,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:46,289 INFO L290 TraceCheckUtils]: 28: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:46,289 INFO L290 TraceCheckUtils]: 29: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:46,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1322#false} is VALID [2022-02-20 18:50:46,290 INFO L290 TraceCheckUtils]: 31: Hoare triple {1322#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {1322#false} is VALID [2022-02-20 18:50:46,291 INFO L290 TraceCheckUtils]: 32: Hoare triple {1322#false} ~mode3~0 := 0; {1322#false} is VALID [2022-02-20 18:50:46,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {1322#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1322#false} is VALID [2022-02-20 18:50:46,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {1322#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {1322#false} is VALID [2022-02-20 18:50:46,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {1322#false} ~__return_1482~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1482~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {1322#false} is VALID [2022-02-20 18:50:46,293 INFO L290 TraceCheckUtils]: 36: Hoare triple {1322#false} assume 0 == main_~assert__arg~0#1 % 256; {1322#false} is VALID [2022-02-20 18:50:46,294 INFO L290 TraceCheckUtils]: 37: Hoare triple {1322#false} assume !false; {1322#false} is VALID [2022-02-20 18:50:46,294 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:50:46,295 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:46,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645068391] [2022-02-20 18:50:46,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645068391] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:46,295 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:46,296 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:50:46,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481253774] [2022-02-20 18:50:46,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:46,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-02-20 18:50:46,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:46,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:46,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:46,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:50:46,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:46,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:50:46,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:50:46,331 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:46,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:46,469 INFO L93 Difference]: Finished difference Result 353 states and 546 transitions. [2022-02-20 18:50:46,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:50:46,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-02-20 18:50:46,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:46,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:46,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2022-02-20 18:50:46,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:46,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2022-02-20 18:50:46,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 195 transitions. [2022-02-20 18:50:46,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:46,636 INFO L225 Difference]: With dead ends: 353 [2022-02-20 18:50:46,637 INFO L226 Difference]: Without dead ends: 231 [2022-02-20 18:50:46,638 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:50:46,639 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 43 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 178 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:50:46,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:46,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-02-20 18:50:46,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2022-02-20 18:50:46,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:46,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 231 states. Second operand has 229 states, 228 states have (on average 1.5263157894736843) internal successors, (348), 228 states have internal predecessors, (348), 0 states have call successors, (0), 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:50:46,661 INFO L74 IsIncluded]: Start isIncluded. First operand 231 states. Second operand has 229 states, 228 states have (on average 1.5263157894736843) internal successors, (348), 228 states have internal predecessors, (348), 0 states have call successors, (0), 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:50:46,661 INFO L87 Difference]: Start difference. First operand 231 states. Second operand has 229 states, 228 states have (on average 1.5263157894736843) internal successors, (348), 228 states have internal predecessors, (348), 0 states have call successors, (0), 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:50:46,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:46,668 INFO L93 Difference]: Finished difference Result 231 states and 349 transitions. [2022-02-20 18:50:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 349 transitions. [2022-02-20 18:50:46,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:46,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:46,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 228 states have (on average 1.5263157894736843) internal successors, (348), 228 states have internal predecessors, (348), 0 states have call successors, (0), 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 231 states. [2022-02-20 18:50:46,669 INFO L87 Difference]: Start difference. First operand has 229 states, 228 states have (on average 1.5263157894736843) internal successors, (348), 228 states have internal predecessors, (348), 0 states have call successors, (0), 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 231 states. [2022-02-20 18:50:46,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:46,676 INFO L93 Difference]: Finished difference Result 231 states and 349 transitions. [2022-02-20 18:50:46,676 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 349 transitions. [2022-02-20 18:50:46,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:46,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:46,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:46,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:46,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.5263157894736843) internal successors, (348), 228 states have internal predecessors, (348), 0 states have call successors, (0), 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:50:46,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 348 transitions. [2022-02-20 18:50:46,684 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 348 transitions. Word has length 38 [2022-02-20 18:50:46,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:46,684 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 348 transitions. [2022-02-20 18:50:46,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:46,684 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 348 transitions. [2022-02-20 18:50:46,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 18:50:46,685 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:46,685 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] [2022-02-20 18:50:46,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:50:46,685 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:46,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:46,686 INFO L85 PathProgramCache]: Analyzing trace with hash 2014631486, now seen corresponding path program 1 times [2022-02-20 18:50:46,686 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:46,686 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805360270] [2022-02-20 18:50:46,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:46,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:46,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {2586#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_1482~0 := 0;~__return_1537~0 := 0; {2586#true} is VALID [2022-02-20 18:50:46,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {2586#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {2586#true} is VALID [2022-02-20 18:50:46,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {2586#true} assume 0 == ~r1~0; {2586#true} is VALID [2022-02-20 18:50:46,771 INFO L290 TraceCheckUtils]: 3: Hoare triple {2586#true} assume ~id1~0 >= 0; {2586#true} is VALID [2022-02-20 18:50:46,771 INFO L290 TraceCheckUtils]: 4: Hoare triple {2586#true} assume 0 == ~st1~0; {2588#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:46,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {2588#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {2588#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:46,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {2588#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {2588#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:46,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {2588#(<= ~st1~0 0)} assume ~id2~0 >= 0; {2588#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:46,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {2588#(<= ~st1~0 0)} assume 0 == ~st2~0; {2589#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {2589#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {2589#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {2589#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {2589#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {2589#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {2589#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {2589#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0); {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,782 INFO L290 TraceCheckUtils]: 29: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,782 INFO L290 TraceCheckUtils]: 30: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,783 INFO L290 TraceCheckUtils]: 31: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,783 INFO L290 TraceCheckUtils]: 32: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,784 INFO L290 TraceCheckUtils]: 33: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,784 INFO L290 TraceCheckUtils]: 34: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,785 INFO L290 TraceCheckUtils]: 35: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {2587#false} is VALID [2022-02-20 18:50:46,785 INFO L290 TraceCheckUtils]: 36: Hoare triple {2587#false} ~__return_1482~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1482~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {2587#false} is VALID [2022-02-20 18:50:46,785 INFO L290 TraceCheckUtils]: 37: Hoare triple {2587#false} assume 0 == main_~assert__arg~0#1 % 256; {2587#false} is VALID [2022-02-20 18:50:46,785 INFO L290 TraceCheckUtils]: 38: Hoare triple {2587#false} assume !false; {2587#false} is VALID [2022-02-20 18:50:46,786 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:50:46,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:46,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805360270] [2022-02-20 18:50:46,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805360270] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:46,786 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:46,787 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:46,787 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385607116] [2022-02-20 18:50:46,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:46,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-02-20 18:50:46,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:46,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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:50:46,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:46,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:46,818 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:46,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:46,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:46,819 INFO L87 Difference]: Start difference. First operand 229 states and 348 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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:50:47,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:47,768 INFO L93 Difference]: Finished difference Result 1489 states and 2322 transitions. [2022-02-20 18:50:47,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:50:47,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-02-20 18:50:47,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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:50:47,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 460 transitions. [2022-02-20 18:50:47,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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:50:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 460 transitions. [2022-02-20 18:50:47,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 460 transitions. [2022-02-20 18:50:48,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:48,233 INFO L225 Difference]: With dead ends: 1489 [2022-02-20 18:50:48,234 INFO L226 Difference]: Without dead ends: 1279 [2022-02-20 18:50:48,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:50:48,236 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 423 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:48,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 419 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2022-02-20 18:50:48,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 437. [2022-02-20 18:50:48,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:48,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1279 states. Second operand has 437 states, 436 states have (on average 1.5137614678899083) internal successors, (660), 436 states have internal predecessors, (660), 0 states have call successors, (0), 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:50:48,482 INFO L74 IsIncluded]: Start isIncluded. First operand 1279 states. Second operand has 437 states, 436 states have (on average 1.5137614678899083) internal successors, (660), 436 states have internal predecessors, (660), 0 states have call successors, (0), 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:50:48,482 INFO L87 Difference]: Start difference. First operand 1279 states. Second operand has 437 states, 436 states have (on average 1.5137614678899083) internal successors, (660), 436 states have internal predecessors, (660), 0 states have call successors, (0), 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:50:48,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:48,557 INFO L93 Difference]: Finished difference Result 1279 states and 1945 transitions. [2022-02-20 18:50:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1945 transitions. [2022-02-20 18:50:48,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:48,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:48,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 437 states, 436 states have (on average 1.5137614678899083) internal successors, (660), 436 states have internal predecessors, (660), 0 states have call successors, (0), 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 1279 states. [2022-02-20 18:50:48,568 INFO L87 Difference]: Start difference. First operand has 437 states, 436 states have (on average 1.5137614678899083) internal successors, (660), 436 states have internal predecessors, (660), 0 states have call successors, (0), 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 1279 states. [2022-02-20 18:50:48,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:48,638 INFO L93 Difference]: Finished difference Result 1279 states and 1945 transitions. [2022-02-20 18:50:48,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1945 transitions. [2022-02-20 18:50:48,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:48,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:48,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:48,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.5137614678899083) internal successors, (660), 436 states have internal predecessors, (660), 0 states have call successors, (0), 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:50:48,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 660 transitions. [2022-02-20 18:50:48,656 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 660 transitions. Word has length 39 [2022-02-20 18:50:48,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:48,656 INFO L470 AbstractCegarLoop]: Abstraction has 437 states and 660 transitions. [2022-02-20 18:50:48,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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:50:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 660 transitions. [2022-02-20 18:50:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 18:50:48,657 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:48,657 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] [2022-02-20 18:50:48,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:50:48,658 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:48,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1891215654, now seen corresponding path program 1 times [2022-02-20 18:50:48,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:48,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942228858] [2022-02-20 18:50:48,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:48,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {7840#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_1482~0 := 0;~__return_1537~0 := 0; {7840#true} is VALID [2022-02-20 18:50:48,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {7840#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {7840#true} is VALID [2022-02-20 18:50:48,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {7840#true} assume 0 == ~r1~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {7842#(<= ~r1~0 0)} assume ~id1~0 >= 0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,717 INFO L290 TraceCheckUtils]: 4: Hoare triple {7842#(<= ~r1~0 0)} assume 0 == ~st1~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {7842#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {7842#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {7842#(<= ~r1~0 0)} assume ~id2~0 >= 0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {7842#(<= ~r1~0 0)} assume 0 == ~st2~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {7842#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {7842#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {7842#(<= ~r1~0 0)} assume ~id3~0 >= 0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {7842#(<= ~r1~0 0)} assume 0 == ~st3~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {7842#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {7842#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {7842#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {7842#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {7842#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {7842#(<= ~r1~0 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {7842#(<= ~r1~0 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {7842#(<= ~r1~0 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {7842#(<= ~r1~0 0)} assume ~send1~0 != ~nomsg~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {7842#(<= ~r1~0 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {7842#(<= ~r1~0 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {7842#(<= ~r1~0 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {7842#(<= ~r1~0 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {7842#(<= ~r1~0 0)} assume !(~send2~0 != ~nomsg~0); {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {7842#(<= ~r1~0 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {7842#(<= ~r1~0 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {7842#(<= ~r1~0 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {7842#(<= ~r1~0 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {7842#(<= ~r1~0 0)} assume ~send3~0 != ~nomsg~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {7842#(<= ~r1~0 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {7842#(<= ~r1~0 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {7842#(<= ~r1~0 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,736 INFO L290 TraceCheckUtils]: 35: Hoare triple {7842#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:50:48,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {7842#(<= ~r1~0 0)} assume ~r1~0 >= 3; {7841#false} is VALID [2022-02-20 18:50:48,737 INFO L290 TraceCheckUtils]: 37: Hoare triple {7841#false} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {7841#false} is VALID [2022-02-20 18:50:48,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {7841#false} ~__return_1482~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1482~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {7841#false} is VALID [2022-02-20 18:50:48,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {7841#false} assume 0 == main_~assert__arg~0#1 % 256; {7841#false} is VALID [2022-02-20 18:50:48,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {7841#false} assume !false; {7841#false} is VALID [2022-02-20 18:50:48,738 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:50:48,738 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:48,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942228858] [2022-02-20 18:50:48,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942228858] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:48,738 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:48,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:50:48,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376292900] [2022-02-20 18:50:48,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:48,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 18:50:48,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:48,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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:50:48,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:48,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:50:48,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:48,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:50:48,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:50:48,767 INFO L87 Difference]: Start difference. First operand 437 states and 660 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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:50:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:49,254 INFO L93 Difference]: Finished difference Result 1055 states and 1604 transitions. [2022-02-20 18:50:49,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:50:49,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 18:50:49,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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:50:49,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2022-02-20 18:50:49,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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:50:49,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2022-02-20 18:50:49,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 199 transitions. [2022-02-20 18:50:49,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:49,418 INFO L225 Difference]: With dead ends: 1055 [2022-02-20 18:50:49,418 INFO L226 Difference]: Without dead ends: 637 [2022-02-20 18:50:49,419 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:50:49,420 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 34 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:49,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 154 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:49,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-02-20 18:50:49,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 635. [2022-02-20 18:50:49,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:49,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 637 states. Second operand has 635 states, 634 states have (on average 1.498422712933754) internal successors, (950), 634 states have internal predecessors, (950), 0 states have call successors, (0), 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:50:49,783 INFO L74 IsIncluded]: Start isIncluded. First operand 637 states. Second operand has 635 states, 634 states have (on average 1.498422712933754) internal successors, (950), 634 states have internal predecessors, (950), 0 states have call successors, (0), 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:50:49,784 INFO L87 Difference]: Start difference. First operand 637 states. Second operand has 635 states, 634 states have (on average 1.498422712933754) internal successors, (950), 634 states have internal predecessors, (950), 0 states have call successors, (0), 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:50:49,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:49,805 INFO L93 Difference]: Finished difference Result 637 states and 951 transitions. [2022-02-20 18:50:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 951 transitions. [2022-02-20 18:50:49,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:49,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:49,808 INFO L74 IsIncluded]: Start isIncluded. First operand has 635 states, 634 states have (on average 1.498422712933754) internal successors, (950), 634 states have internal predecessors, (950), 0 states have call successors, (0), 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 637 states. [2022-02-20 18:50:49,809 INFO L87 Difference]: Start difference. First operand has 635 states, 634 states have (on average 1.498422712933754) internal successors, (950), 634 states have internal predecessors, (950), 0 states have call successors, (0), 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 637 states. [2022-02-20 18:50:49,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:49,830 INFO L93 Difference]: Finished difference Result 637 states and 951 transitions. [2022-02-20 18:50:49,830 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 951 transitions. [2022-02-20 18:50:49,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:49,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:49,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:49,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.498422712933754) internal successors, (950), 634 states have internal predecessors, (950), 0 states have call successors, (0), 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:50:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 950 transitions. [2022-02-20 18:50:49,869 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 950 transitions. Word has length 41 [2022-02-20 18:50:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:49,870 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 950 transitions. [2022-02-20 18:50:49,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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:50:49,870 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 950 transitions. [2022-02-20 18:50:49,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 18:50:49,870 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:49,871 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] [2022-02-20 18:50:49,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:50:49,871 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:49,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:49,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1870212999, now seen corresponding path program 1 times [2022-02-20 18:50:49,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:49,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199722336] [2022-02-20 18:50:49,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:49,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:50,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {11483#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_1482~0 := 0;~__return_1537~0 := 0; {11483#true} is VALID [2022-02-20 18:50:50,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {11483#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {11483#true} is VALID [2022-02-20 18:50:50,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {11483#true} assume 0 == ~r1~0; {11483#true} is VALID [2022-02-20 18:50:50,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {11483#true} assume ~id1~0 >= 0; {11483#true} is VALID [2022-02-20 18:50:50,008 INFO L290 TraceCheckUtils]: 4: Hoare triple {11483#true} assume 0 == ~st1~0; {11485#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:50:50,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {11485#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send1~0 == ~id1~0; {11485#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:50:50,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {11485#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode1~0 % 256; {11485#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:50:50,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {11485#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id2~0 >= 0; {11485#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:50:50,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {11485#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st2~0; {11486#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:50:50,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {11486#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {11486#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:50:50,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {11486#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {11486#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:50:50,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {11486#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {11486#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:50:50,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {11486#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 == ~id3~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode3~0 % 256; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send1~0 != ~nomsg~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send2~0 != ~nomsg~0); {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,026 INFO L290 TraceCheckUtils]: 28: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,028 INFO L290 TraceCheckUtils]: 31: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 != ~nomsg~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,028 INFO L290 TraceCheckUtils]: 32: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,030 INFO L290 TraceCheckUtils]: 35: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,030 INFO L290 TraceCheckUtils]: 36: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 >= 3); {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:50,032 INFO L290 TraceCheckUtils]: 37: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~0#1 := 0; {11484#false} is VALID [2022-02-20 18:50:50,032 INFO L290 TraceCheckUtils]: 38: Hoare triple {11484#false} ~__return_1482~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1482~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {11484#false} is VALID [2022-02-20 18:50:50,032 INFO L290 TraceCheckUtils]: 39: Hoare triple {11484#false} assume 0 == main_~assert__arg~0#1 % 256; {11484#false} is VALID [2022-02-20 18:50:50,032 INFO L290 TraceCheckUtils]: 40: Hoare triple {11484#false} assume !false; {11484#false} is VALID [2022-02-20 18:50:50,033 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:50:50,033 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:50,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199722336] [2022-02-20 18:50:50,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199722336] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:50,033 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:50,034 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:50,034 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590651997] [2022-02-20 18:50:50,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:50,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 18:50:50,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:50,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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:50:50,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:50,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:50,071 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:50,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:50,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:50,072 INFO L87 Difference]: Start difference. First operand 635 states and 950 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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:50:50,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:50,872 INFO L93 Difference]: Finished difference Result 1251 states and 1880 transitions. [2022-02-20 18:50:50,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:50,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 18:50:50,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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:50:50,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 206 transitions. [2022-02-20 18:50:50,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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:50:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 206 transitions. [2022-02-20 18:50:50,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 206 transitions. [2022-02-20 18:50:51,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:51,054 INFO L225 Difference]: With dead ends: 1251 [2022-02-20 18:50:51,054 INFO L226 Difference]: Without dead ends: 637 [2022-02-20 18:50:51,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:50:51,058 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 171 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:51,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 195 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:51,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-02-20 18:50:51,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 635. [2022-02-20 18:50:51,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:51,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 637 states. Second operand has 635 states, 634 states have (on average 1.4794952681388012) internal successors, (938), 634 states have internal predecessors, (938), 0 states have call successors, (0), 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:50:51,533 INFO L74 IsIncluded]: Start isIncluded. First operand 637 states. Second operand has 635 states, 634 states have (on average 1.4794952681388012) internal successors, (938), 634 states have internal predecessors, (938), 0 states have call successors, (0), 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:50:51,534 INFO L87 Difference]: Start difference. First operand 637 states. Second operand has 635 states, 634 states have (on average 1.4794952681388012) internal successors, (938), 634 states have internal predecessors, (938), 0 states have call successors, (0), 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:50:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,554 INFO L93 Difference]: Finished difference Result 637 states and 939 transitions. [2022-02-20 18:50:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 939 transitions. [2022-02-20 18:50:51,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:51,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:51,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 635 states, 634 states have (on average 1.4794952681388012) internal successors, (938), 634 states have internal predecessors, (938), 0 states have call successors, (0), 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 637 states. [2022-02-20 18:50:51,558 INFO L87 Difference]: Start difference. First operand has 635 states, 634 states have (on average 1.4794952681388012) internal successors, (938), 634 states have internal predecessors, (938), 0 states have call successors, (0), 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 637 states. [2022-02-20 18:50:51,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,578 INFO L93 Difference]: Finished difference Result 637 states and 939 transitions. [2022-02-20 18:50:51,578 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 939 transitions. [2022-02-20 18:50:51,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:51,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:51,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:51,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.4794952681388012) internal successors, (938), 634 states have internal predecessors, (938), 0 states have call successors, (0), 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:50:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 938 transitions. [2022-02-20 18:50:51,605 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 938 transitions. Word has length 41 [2022-02-20 18:50:51,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:51,605 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 938 transitions. [2022-02-20 18:50:51,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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:50:51,606 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 938 transitions. [2022-02-20 18:50:51,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:50:51,606 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:51,606 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] [2022-02-20 18:50:51,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:50:51,607 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:51,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:51,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2143937547, now seen corresponding path program 1 times [2022-02-20 18:50:51,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:51,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609380386] [2022-02-20 18:50:51,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:51,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:51,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {15410#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_1482~0 := 0;~__return_1537~0 := 0; {15412#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:51,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {15412#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {15412#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:51,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {15412#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {15412#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:51,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {15412#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {15412#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:51,667 INFO L290 TraceCheckUtils]: 4: Hoare triple {15412#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {15412#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:51,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {15412#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {15412#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:51,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {15412#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {15412#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:51,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {15412#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {15413#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:51,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {15413#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {15413#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:51,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {15413#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:51,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:51,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:51,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:51,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:51,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:51,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:51,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:51,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:51,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:51,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:51,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:51,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:51,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:51,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:51,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:51,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:51,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0); {15411#false} is VALID [2022-02-20 18:50:51,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {15411#false} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {15411#false} is VALID [2022-02-20 18:50:51,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {15411#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {15411#false} is VALID [2022-02-20 18:50:51,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {15411#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {15411#false} is VALID [2022-02-20 18:50:51,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {15411#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {15411#false} is VALID [2022-02-20 18:50:51,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {15411#false} assume ~send3~0 != ~nomsg~0; {15411#false} is VALID [2022-02-20 18:50:51,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {15411#false} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {15411#false} is VALID [2022-02-20 18:50:51,681 INFO L290 TraceCheckUtils]: 33: Hoare triple {15411#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {15411#false} is VALID [2022-02-20 18:50:51,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {15411#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {15411#false} is VALID [2022-02-20 18:50:51,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {15411#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15411#false} is VALID [2022-02-20 18:50:51,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {15411#false} assume !(~r1~0 >= 3); {15411#false} is VALID [2022-02-20 18:50:51,682 INFO L290 TraceCheckUtils]: 37: Hoare triple {15411#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {15411#false} is VALID [2022-02-20 18:50:51,682 INFO L290 TraceCheckUtils]: 38: Hoare triple {15411#false} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {15411#false} is VALID [2022-02-20 18:50:51,682 INFO L290 TraceCheckUtils]: 39: Hoare triple {15411#false} ~__return_1482~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1482~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {15411#false} is VALID [2022-02-20 18:50:51,683 INFO L290 TraceCheckUtils]: 40: Hoare triple {15411#false} assume 0 == main_~assert__arg~0#1 % 256; {15411#false} is VALID [2022-02-20 18:50:51,683 INFO L290 TraceCheckUtils]: 41: Hoare triple {15411#false} assume !false; {15411#false} is VALID [2022-02-20 18:50:51,683 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:50:51,683 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:51,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609380386] [2022-02-20 18:50:51,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609380386] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:51,684 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:51,684 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:51,684 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596902317] [2022-02-20 18:50:51,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:51,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 18:50:51,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:51,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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:50:51,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:51,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:51,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:51,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:51,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:51,714 INFO L87 Difference]: Start difference. First operand 635 states and 938 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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:50:52,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:52,884 INFO L93 Difference]: Finished difference Result 1249 states and 1855 transitions. [2022-02-20 18:50:52,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:52,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 18:50:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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:50:52,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2022-02-20 18:50:52,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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:50:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2022-02-20 18:50:52,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 145 transitions. [2022-02-20 18:50:53,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:53,028 INFO L225 Difference]: With dead ends: 1249 [2022-02-20 18:50:53,029 INFO L226 Difference]: Without dead ends: 635 [2022-02-20 18:50:53,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:53,031 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 198 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:53,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 61 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-02-20 18:50:53,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2022-02-20 18:50:53,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:53,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 635 states. Second operand has 635 states, 634 states have (on average 1.4605678233438486) internal successors, (926), 634 states have internal predecessors, (926), 0 states have call successors, (0), 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:50:53,801 INFO L74 IsIncluded]: Start isIncluded. First operand 635 states. Second operand has 635 states, 634 states have (on average 1.4605678233438486) internal successors, (926), 634 states have internal predecessors, (926), 0 states have call successors, (0), 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:50:53,802 INFO L87 Difference]: Start difference. First operand 635 states. Second operand has 635 states, 634 states have (on average 1.4605678233438486) internal successors, (926), 634 states have internal predecessors, (926), 0 states have call successors, (0), 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:50:53,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:53,823 INFO L93 Difference]: Finished difference Result 635 states and 926 transitions. [2022-02-20 18:50:53,823 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 926 transitions. [2022-02-20 18:50:53,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:53,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:53,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 635 states, 634 states have (on average 1.4605678233438486) internal successors, (926), 634 states have internal predecessors, (926), 0 states have call successors, (0), 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 635 states. [2022-02-20 18:50:53,827 INFO L87 Difference]: Start difference. First operand has 635 states, 634 states have (on average 1.4605678233438486) internal successors, (926), 634 states have internal predecessors, (926), 0 states have call successors, (0), 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 635 states. [2022-02-20 18:50:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:53,848 INFO L93 Difference]: Finished difference Result 635 states and 926 transitions. [2022-02-20 18:50:53,848 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 926 transitions. [2022-02-20 18:50:53,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:53,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:53,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:53,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:53,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.4605678233438486) internal successors, (926), 634 states have internal predecessors, (926), 0 states have call successors, (0), 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:50:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 926 transitions. [2022-02-20 18:50:53,876 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 926 transitions. Word has length 42 [2022-02-20 18:50:53,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:53,876 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 926 transitions. [2022-02-20 18:50:53,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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:50:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 926 transitions. [2022-02-20 18:50:53,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:50:53,877 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:53,878 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] [2022-02-20 18:50:53,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:50:53,878 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:53,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:53,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1278405158, now seen corresponding path program 1 times [2022-02-20 18:50:53,881 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:53,881 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318447927] [2022-02-20 18:50:53,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:53,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:53,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {19333#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_1482~0 := 0;~__return_1537~0 := 0; {19333#true} is VALID [2022-02-20 18:50:53,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {19333#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {19333#true} is VALID [2022-02-20 18:50:53,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {19333#true} assume 0 == ~r1~0; {19333#true} is VALID [2022-02-20 18:50:53,984 INFO L290 TraceCheckUtils]: 3: Hoare triple {19333#true} assume ~id1~0 >= 0; {19333#true} is VALID [2022-02-20 18:50:53,984 INFO L290 TraceCheckUtils]: 4: Hoare triple {19333#true} assume 0 == ~st1~0; {19333#true} is VALID [2022-02-20 18:50:53,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {19333#true} assume ~send1~0 == ~id1~0; {19333#true} is VALID [2022-02-20 18:50:53,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {19333#true} assume 0 == ~mode1~0 % 256; {19333#true} is VALID [2022-02-20 18:50:53,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {19333#true} assume ~id2~0 >= 0; {19333#true} is VALID [2022-02-20 18:50:53,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {19333#true} assume 0 == ~st2~0; {19333#true} is VALID [2022-02-20 18:50:53,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {19333#true} assume ~send2~0 == ~id2~0; {19333#true} is VALID [2022-02-20 18:50:53,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {19333#true} assume 0 == ~mode2~0 % 256; {19333#true} is VALID [2022-02-20 18:50:53,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {19333#true} assume ~id3~0 >= 0; {19333#true} is VALID [2022-02-20 18:50:53,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {19333#true} assume 0 == ~st3~0; {19333#true} is VALID [2022-02-20 18:50:53,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {19333#true} assume ~send3~0 == ~id3~0; {19333#true} is VALID [2022-02-20 18:50:53,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {19333#true} assume 0 == ~mode3~0 % 256; {19333#true} is VALID [2022-02-20 18:50:53,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {19333#true} assume ~id1~0 != ~id2~0; {19333#true} is VALID [2022-02-20 18:50:53,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {19333#true} assume ~id1~0 != ~id3~0; {19333#true} is VALID [2022-02-20 18:50:53,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {19333#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {19335#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} is VALID [2022-02-20 18:50:53,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {19335#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {19333#true} is VALID [2022-02-20 18:50:53,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {19333#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {19333#true} is VALID [2022-02-20 18:50:53,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {19333#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {19333#true} is VALID [2022-02-20 18:50:53,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {19333#true} assume ~send1~0 != ~nomsg~0; {19333#true} is VALID [2022-02-20 18:50:53,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {19333#true} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {19333#true} is VALID [2022-02-20 18:50:53,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {19333#true} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {19333#true} is VALID [2022-02-20 18:50:53,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {19333#true} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {19333#true} is VALID [2022-02-20 18:50:53,987 INFO L290 TraceCheckUtils]: 25: Hoare triple {19333#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {19333#true} is VALID [2022-02-20 18:50:53,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {19333#true} assume ~send2~0 != ~nomsg~0; {19333#true} is VALID [2022-02-20 18:50:53,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {19333#true} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {19333#true} is VALID [2022-02-20 18:50:53,988 INFO L290 TraceCheckUtils]: 28: Hoare triple {19333#true} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {19333#true} is VALID [2022-02-20 18:50:53,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {19333#true} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {19333#true} is VALID [2022-02-20 18:50:53,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {19333#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {19333#true} is VALID [2022-02-20 18:50:53,988 INFO L290 TraceCheckUtils]: 31: Hoare triple {19333#true} assume ~send3~0 != ~nomsg~0; {19333#true} is VALID [2022-02-20 18:50:53,989 INFO L290 TraceCheckUtils]: 32: Hoare triple {19333#true} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {19333#true} is VALID [2022-02-20 18:50:53,989 INFO L290 TraceCheckUtils]: 33: Hoare triple {19333#true} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {19333#true} is VALID [2022-02-20 18:50:53,989 INFO L290 TraceCheckUtils]: 34: Hoare triple {19333#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;havoc main_~check__tmp~0#1; {19333#true} is VALID [2022-02-20 18:50:53,989 INFO L290 TraceCheckUtils]: 35: Hoare triple {19333#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {19333#true} is VALID [2022-02-20 18:50:53,989 INFO L290 TraceCheckUtils]: 36: Hoare triple {19333#true} assume !(~r1~0 >= 3); {19333#true} is VALID [2022-02-20 18:50:53,989 INFO L290 TraceCheckUtils]: 37: Hoare triple {19333#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {19333#true} is VALID [2022-02-20 18:50:53,990 INFO L290 TraceCheckUtils]: 38: Hoare triple {19333#true} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {19336#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} is VALID [2022-02-20 18:50:53,990 INFO L290 TraceCheckUtils]: 39: Hoare triple {19336#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} ~__return_1482~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1482~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {19337#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} is VALID [2022-02-20 18:50:53,991 INFO L290 TraceCheckUtils]: 40: Hoare triple {19337#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} assume 0 == main_~assert__arg~0#1 % 256; {19334#false} is VALID [2022-02-20 18:50:53,991 INFO L290 TraceCheckUtils]: 41: Hoare triple {19334#false} assume !false; {19334#false} is VALID [2022-02-20 18:50:53,991 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:50:53,991 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:53,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318447927] [2022-02-20 18:50:53,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318447927] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:53,992 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:53,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:53,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577421670] [2022-02-20 18:50:53,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:53,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 18:50:53,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:53,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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:50:54,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:54,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:54,019 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:54,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:54,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:54,020 INFO L87 Difference]: Start difference. First operand 635 states and 926 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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:50:56,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:56,057 INFO L93 Difference]: Finished difference Result 1143 states and 1658 transitions. [2022-02-20 18:50:56,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:50:56,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 18:50:56,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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:50:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2022-02-20 18:50:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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:50:56,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2022-02-20 18:50:56,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 145 transitions. [2022-02-20 18:50:56,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:56,203 INFO L225 Difference]: With dead ends: 1143 [2022-02-20 18:50:56,203 INFO L226 Difference]: Without dead ends: 1141 [2022-02-20 18:50:56,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:50:56,204 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 108 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:56,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 361 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:56,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2022-02-20 18:50:57,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 667. [2022-02-20 18:50:57,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:57,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1141 states. Second operand has 667 states, 666 states have (on average 1.4324324324324325) internal successors, (954), 666 states have internal predecessors, (954), 0 states have call successors, (0), 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:50:57,268 INFO L74 IsIncluded]: Start isIncluded. First operand 1141 states. Second operand has 667 states, 666 states have (on average 1.4324324324324325) internal successors, (954), 666 states have internal predecessors, (954), 0 states have call successors, (0), 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:50:57,270 INFO L87 Difference]: Start difference. First operand 1141 states. Second operand has 667 states, 666 states have (on average 1.4324324324324325) internal successors, (954), 666 states have internal predecessors, (954), 0 states have call successors, (0), 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:50:57,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:57,324 INFO L93 Difference]: Finished difference Result 1141 states and 1637 transitions. [2022-02-20 18:50:57,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1637 transitions. [2022-02-20 18:50:57,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:57,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:57,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 667 states, 666 states have (on average 1.4324324324324325) internal successors, (954), 666 states have internal predecessors, (954), 0 states have call successors, (0), 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 1141 states. [2022-02-20 18:50:57,329 INFO L87 Difference]: Start difference. First operand has 667 states, 666 states have (on average 1.4324324324324325) internal successors, (954), 666 states have internal predecessors, (954), 0 states have call successors, (0), 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 1141 states. [2022-02-20 18:50:57,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:57,376 INFO L93 Difference]: Finished difference Result 1141 states and 1637 transitions. [2022-02-20 18:50:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1637 transitions. [2022-02-20 18:50:57,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:57,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:57,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:57,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:57,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 666 states have (on average 1.4324324324324325) internal successors, (954), 666 states have internal predecessors, (954), 0 states have call successors, (0), 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:50:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 954 transitions. [2022-02-20 18:50:57,404 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 954 transitions. Word has length 42 [2022-02-20 18:50:57,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:57,405 INFO L470 AbstractCegarLoop]: Abstraction has 667 states and 954 transitions. [2022-02-20 18:50:57,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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:50:57,405 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 954 transitions. [2022-02-20 18:50:57,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:50:57,406 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:57,406 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 18:50:57,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:50:57,406 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:57,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:57,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1616122195, now seen corresponding path program 1 times [2022-02-20 18:50:57,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:57,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093877332] [2022-02-20 18:50:57,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:57,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:57,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {24188#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_1482~0 := 0;~__return_1537~0 := 0; {24188#true} is VALID [2022-02-20 18:50:57,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {24188#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {24188#true} is VALID [2022-02-20 18:50:57,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {24188#true} assume 0 == ~r1~0; {24188#true} is VALID [2022-02-20 18:50:57,470 INFO L290 TraceCheckUtils]: 3: Hoare triple {24188#true} assume ~id1~0 >= 0; {24188#true} is VALID [2022-02-20 18:50:57,471 INFO L290 TraceCheckUtils]: 4: Hoare triple {24188#true} assume 0 == ~st1~0; {24190#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:57,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {24190#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {24190#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:57,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {24190#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {24190#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:57,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {24190#(<= ~st1~0 0)} assume ~id2~0 >= 0; {24190#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:57,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {24190#(<= ~st1~0 0)} assume 0 == ~st2~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,481 INFO L290 TraceCheckUtils]: 34: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,481 INFO L290 TraceCheckUtils]: 35: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,482 INFO L290 TraceCheckUtils]: 37: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,482 INFO L290 TraceCheckUtils]: 38: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,483 INFO L290 TraceCheckUtils]: 39: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} ~__return_1482~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1482~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,483 INFO L290 TraceCheckUtils]: 40: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,484 INFO L290 TraceCheckUtils]: 41: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,484 INFO L290 TraceCheckUtils]: 42: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,484 INFO L290 TraceCheckUtils]: 43: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~0#1 != ~nomsg~0); {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,485 INFO L290 TraceCheckUtils]: 44: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,485 INFO L290 TraceCheckUtils]: 45: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,485 INFO L290 TraceCheckUtils]: 46: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,486 INFO L290 TraceCheckUtils]: 47: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~0#1 != ~nomsg~0); {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,486 INFO L290 TraceCheckUtils]: 48: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,486 INFO L290 TraceCheckUtils]: 49: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,487 INFO L290 TraceCheckUtils]: 50: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,487 INFO L290 TraceCheckUtils]: 51: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~0#1 != ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,487 INFO L290 TraceCheckUtils]: 52: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~0#1 > ~id3~0); {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:57,488 INFO L290 TraceCheckUtils]: 53: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~0#1 == ~id3~0;~st3~0 := 1; {24192#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:57,488 INFO L290 TraceCheckUtils]: 54: Hoare triple {24192#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {24192#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:57,489 INFO L290 TraceCheckUtils]: 55: Hoare triple {24192#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {24192#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:57,489 INFO L290 TraceCheckUtils]: 56: Hoare triple {24192#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {24189#false} is VALID [2022-02-20 18:50:57,489 INFO L290 TraceCheckUtils]: 57: Hoare triple {24189#false} ~__return_1482~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1482~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {24189#false} is VALID [2022-02-20 18:50:57,489 INFO L290 TraceCheckUtils]: 58: Hoare triple {24189#false} assume 0 == main_~assert__arg~0#1 % 256; {24189#false} is VALID [2022-02-20 18:50:57,490 INFO L290 TraceCheckUtils]: 59: Hoare triple {24189#false} assume !false; {24189#false} is VALID [2022-02-20 18:50:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 18:50:57,490 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:57,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093877332] [2022-02-20 18:50:57,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093877332] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:57,491 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:57,491 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:57,491 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560485054] [2022-02-20 18:50:57,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:57,492 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 60 [2022-02-20 18:50:57,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:57,492 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:50:57,530 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:50:57,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:57,530 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:57,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:57,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:57,531 INFO L87 Difference]: Start difference. First operand 667 states and 954 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:51:01,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:01,282 INFO L93 Difference]: Finished difference Result 2735 states and 3928 transitions. [2022-02-20 18:51:01,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:01,282 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 60 [2022-02-20 18:51:01,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:01,282 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:51:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 326 transitions. [2022-02-20 18:51:01,284 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:51:01,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 326 transitions. [2022-02-20 18:51:01,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 326 transitions. [2022-02-20 18:51:01,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:01,671 INFO L225 Difference]: With dead ends: 2735 [2022-02-20 18:51:01,672 INFO L226 Difference]: Without dead ends: 2089 [2022-02-20 18:51:01,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:51:01,675 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 212 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:01,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 332 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2022-02-20 18:51:03,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1311. [2022-02-20 18:51:03,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:03,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2089 states. Second operand has 1311 states, 1310 states have (on average 1.4305343511450381) internal successors, (1874), 1310 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:03,739 INFO L74 IsIncluded]: Start isIncluded. First operand 2089 states. Second operand has 1311 states, 1310 states have (on average 1.4305343511450381) internal successors, (1874), 1310 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:03,741 INFO L87 Difference]: Start difference. First operand 2089 states. Second operand has 1311 states, 1310 states have (on average 1.4305343511450381) internal successors, (1874), 1310 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:03,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:03,863 INFO L93 Difference]: Finished difference Result 2089 states and 2983 transitions. [2022-02-20 18:51:03,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2983 transitions. [2022-02-20 18:51:03,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:03,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:03,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 1311 states, 1310 states have (on average 1.4305343511450381) internal successors, (1874), 1310 states have internal predecessors, (1874), 0 states have call successors, (0), 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 2089 states. [2022-02-20 18:51:03,869 INFO L87 Difference]: Start difference. First operand has 1311 states, 1310 states have (on average 1.4305343511450381) internal successors, (1874), 1310 states have internal predecessors, (1874), 0 states have call successors, (0), 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 2089 states. [2022-02-20 18:51:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:04,007 INFO L93 Difference]: Finished difference Result 2089 states and 2983 transitions. [2022-02-20 18:51:04,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2983 transitions. [2022-02-20 18:51:04,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:04,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:04,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:04,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:04,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 1310 states have (on average 1.4305343511450381) internal successors, (1874), 1310 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1874 transitions. [2022-02-20 18:51:04,109 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1874 transitions. Word has length 60 [2022-02-20 18:51:04,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:04,110 INFO L470 AbstractCegarLoop]: Abstraction has 1311 states and 1874 transitions. [2022-02-20 18:51:04,110 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:51:04,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1874 transitions. [2022-02-20 18:51:04,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:51:04,111 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:04,111 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 18:51:04,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:51:04,111 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:04,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:04,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1524898995, now seen corresponding path program 1 times [2022-02-20 18:51:04,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:04,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201386729] [2022-02-20 18:51:04,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:04,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:04,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {34086#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_1482~0 := 0;~__return_1537~0 := 0; {34086#true} is VALID [2022-02-20 18:51:04,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {34086#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {34086#true} is VALID [2022-02-20 18:51:04,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {34086#true} assume 0 == ~r1~0; {34086#true} is VALID [2022-02-20 18:51:04,202 INFO L290 TraceCheckUtils]: 3: Hoare triple {34086#true} assume ~id1~0 >= 0; {34086#true} is VALID [2022-02-20 18:51:04,203 INFO L290 TraceCheckUtils]: 4: Hoare triple {34086#true} assume 0 == ~st1~0; {34088#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:04,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {34088#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {34088#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:04,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {34088#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {34088#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:04,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {34088#(<= ~st1~0 0)} assume ~id2~0 >= 0; {34088#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:04,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {34088#(<= ~st1~0 0)} assume 0 == ~st2~0; {34088#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:04,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {34088#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {34088#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:04,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {34088#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {34088#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:04,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {34088#(<= ~st1~0 0)} assume ~id3~0 >= 0; {34088#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:04,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {34088#(<= ~st1~0 0)} assume 0 == ~st3~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,213 INFO L290 TraceCheckUtils]: 32: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,213 INFO L290 TraceCheckUtils]: 33: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,214 INFO L290 TraceCheckUtils]: 35: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,215 INFO L290 TraceCheckUtils]: 38: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} ~__return_1482~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1482~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node1__m1~0#1 != ~nomsg~0); {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,217 INFO L290 TraceCheckUtils]: 46: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,218 INFO L290 TraceCheckUtils]: 47: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~0#1 != ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,218 INFO L290 TraceCheckUtils]: 48: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~0#1 > ~id2~0); {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:04,218 INFO L290 TraceCheckUtils]: 49: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~0#1 == ~id2~0;~st2~0 := 1; {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:51:04,219 INFO L290 TraceCheckUtils]: 50: Hoare triple {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0; {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:51:04,219 INFO L290 TraceCheckUtils]: 51: Hoare triple {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:51:04,220 INFO L290 TraceCheckUtils]: 52: Hoare triple {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:51:04,220 INFO L290 TraceCheckUtils]: 53: Hoare triple {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node3__m3~0#1 != ~nomsg~0); {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:51:04,221 INFO L290 TraceCheckUtils]: 54: Hoare triple {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode3~0 := 0; {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:51:04,221 INFO L290 TraceCheckUtils]: 55: Hoare triple {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:51:04,222 INFO L290 TraceCheckUtils]: 56: Hoare triple {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {34087#false} is VALID [2022-02-20 18:51:04,222 INFO L290 TraceCheckUtils]: 57: Hoare triple {34087#false} ~__return_1482~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1482~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {34087#false} is VALID [2022-02-20 18:51:04,222 INFO L290 TraceCheckUtils]: 58: Hoare triple {34087#false} assume 0 == main_~assert__arg~0#1 % 256; {34087#false} is VALID [2022-02-20 18:51:04,222 INFO L290 TraceCheckUtils]: 59: Hoare triple {34087#false} assume !false; {34087#false} is VALID [2022-02-20 18:51:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 18:51:04,224 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:04,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201386729] [2022-02-20 18:51:04,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201386729] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:04,225 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:04,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:51:04,225 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304242571] [2022-02-20 18:51:04,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:04,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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 60 [2022-02-20 18:51:04,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:04,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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:51:04,264 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:51:04,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:04,264 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:04,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:04,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:04,264 INFO L87 Difference]: Start difference. First operand 1311 states and 1874 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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:51:09,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:09,309 INFO L93 Difference]: Finished difference Result 3379 states and 4848 transitions. [2022-02-20 18:51:09,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:09,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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 60 [2022-02-20 18:51:09,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:09,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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:51:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 326 transitions. [2022-02-20 18:51:09,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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:51:09,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 326 transitions. [2022-02-20 18:51:09,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 326 transitions. [2022-02-20 18:51:09,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:09,794 INFO L225 Difference]: With dead ends: 3379 [2022-02-20 18:51:09,794 INFO L226 Difference]: Without dead ends: 2733 [2022-02-20 18:51:09,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:51:09,796 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 207 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:09,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 365 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:09,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2022-02-20 18:51:13,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2279. [2022-02-20 18:51:13,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:13,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2733 states. Second operand has 2279 states, 2278 states have (on average 1.4240561896400352) internal successors, (3244), 2278 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:13,567 INFO L74 IsIncluded]: Start isIncluded. First operand 2733 states. Second operand has 2279 states, 2278 states have (on average 1.4240561896400352) internal successors, (3244), 2278 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:13,568 INFO L87 Difference]: Start difference. First operand 2733 states. Second operand has 2279 states, 2278 states have (on average 1.4240561896400352) internal successors, (3244), 2278 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:13,809 INFO L93 Difference]: Finished difference Result 2733 states and 3903 transitions. [2022-02-20 18:51:13,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2733 states and 3903 transitions. [2022-02-20 18:51:13,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:13,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:13,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 2279 states, 2278 states have (on average 1.4240561896400352) internal successors, (3244), 2278 states have internal predecessors, (3244), 0 states have call successors, (0), 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 2733 states. [2022-02-20 18:51:13,816 INFO L87 Difference]: Start difference. First operand has 2279 states, 2278 states have (on average 1.4240561896400352) internal successors, (3244), 2278 states have internal predecessors, (3244), 0 states have call successors, (0), 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 2733 states. [2022-02-20 18:51:14,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:14,067 INFO L93 Difference]: Finished difference Result 2733 states and 3903 transitions. [2022-02-20 18:51:14,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2733 states and 3903 transitions. [2022-02-20 18:51:14,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:14,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:14,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:14,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:14,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2279 states, 2278 states have (on average 1.4240561896400352) internal successors, (3244), 2278 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:14,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3244 transitions. [2022-02-20 18:51:14,353 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3244 transitions. Word has length 60 [2022-02-20 18:51:14,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:14,354 INFO L470 AbstractCegarLoop]: Abstraction has 2279 states and 3244 transitions. [2022-02-20 18:51:14,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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:51:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3244 transitions. [2022-02-20 18:51:14,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:51:14,355 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:14,355 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 18:51:14,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:51:14,355 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:14,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:14,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1912167623, now seen corresponding path program 1 times [2022-02-20 18:51:14,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:14,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916182811] [2022-02-20 18:51:14,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:14,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:14,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {47556#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_1482~0 := 0;~__return_1537~0 := 0; {47556#true} is VALID [2022-02-20 18:51:14,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {47556#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {47556#true} is VALID [2022-02-20 18:51:14,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {47556#true} assume 0 == ~r1~0; {47556#true} is VALID [2022-02-20 18:51:14,430 INFO L290 TraceCheckUtils]: 3: Hoare triple {47556#true} assume ~id1~0 >= 0; {47556#true} is VALID [2022-02-20 18:51:14,430 INFO L290 TraceCheckUtils]: 4: Hoare triple {47556#true} assume 0 == ~st1~0; {47556#true} is VALID [2022-02-20 18:51:14,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {47556#true} assume ~send1~0 == ~id1~0; {47556#true} is VALID [2022-02-20 18:51:14,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {47556#true} assume 0 == ~mode1~0 % 256; {47556#true} is VALID [2022-02-20 18:51:14,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {47556#true} assume ~id2~0 >= 0; {47556#true} is VALID [2022-02-20 18:51:14,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {47556#true} assume 0 == ~st2~0; {47558#(<= ~st2~0 0)} is VALID [2022-02-20 18:51:14,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {47558#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {47558#(<= ~st2~0 0)} is VALID [2022-02-20 18:51:14,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {47558#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {47558#(<= ~st2~0 0)} is VALID [2022-02-20 18:51:14,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {47558#(<= ~st2~0 0)} assume ~id3~0 >= 0; {47558#(<= ~st2~0 0)} is VALID [2022-02-20 18:51:14,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {47558#(<= ~st2~0 0)} assume 0 == ~st3~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send1~0 != ~nomsg~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send2~0 != ~nomsg~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 != ~nomsg~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,440 INFO L290 TraceCheckUtils]: 32: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,441 INFO L290 TraceCheckUtils]: 35: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,441 INFO L290 TraceCheckUtils]: 36: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~r1~0 >= 3); {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,441 INFO L290 TraceCheckUtils]: 37: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,442 INFO L290 TraceCheckUtils]: 38: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,442 INFO L290 TraceCheckUtils]: 39: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} ~__return_1482~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1482~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,443 INFO L290 TraceCheckUtils]: 40: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,443 INFO L290 TraceCheckUtils]: 41: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,443 INFO L290 TraceCheckUtils]: 42: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,444 INFO L290 TraceCheckUtils]: 43: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~0#1 != ~nomsg~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,444 INFO L290 TraceCheckUtils]: 44: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~0#1 > ~id1~0); {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:14,445 INFO L290 TraceCheckUtils]: 45: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~0#1 == ~id1~0;~st1~0 := 1; {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:14,445 INFO L290 TraceCheckUtils]: 46: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode1~0 := 0; {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:14,446 INFO L290 TraceCheckUtils]: 47: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:14,446 INFO L290 TraceCheckUtils]: 48: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:14,447 INFO L290 TraceCheckUtils]: 49: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~0#1 != ~nomsg~0); {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:14,447 INFO L290 TraceCheckUtils]: 50: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode2~0 := 0; {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:14,448 INFO L290 TraceCheckUtils]: 51: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:14,448 INFO L290 TraceCheckUtils]: 52: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:14,448 INFO L290 TraceCheckUtils]: 53: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~0#1 != ~nomsg~0); {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:14,449 INFO L290 TraceCheckUtils]: 54: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode3~0 := 0; {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:14,449 INFO L290 TraceCheckUtils]: 55: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:14,450 INFO L290 TraceCheckUtils]: 56: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {47557#false} is VALID [2022-02-20 18:51:14,450 INFO L290 TraceCheckUtils]: 57: Hoare triple {47557#false} ~__return_1482~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1482~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {47557#false} is VALID [2022-02-20 18:51:14,450 INFO L290 TraceCheckUtils]: 58: Hoare triple {47557#false} assume 0 == main_~assert__arg~0#1 % 256; {47557#false} is VALID [2022-02-20 18:51:14,450 INFO L290 TraceCheckUtils]: 59: Hoare triple {47557#false} assume !false; {47557#false} is VALID [2022-02-20 18:51:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:51:14,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:14,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916182811] [2022-02-20 18:51:14,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916182811] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:14,452 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:14,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:51:14,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129415814] [2022-02-20 18:51:14,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:14,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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 60 [2022-02-20 18:51:14,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:14,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:14,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:14,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:14,495 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:14,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:14,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:14,495 INFO L87 Difference]: Start difference. First operand 2279 states and 3244 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:20,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:20,699 INFO L93 Difference]: Finished difference Result 3631 states and 5216 transitions. [2022-02-20 18:51:20,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:20,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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 60 [2022-02-20 18:51:20,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:20,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 326 transitions. [2022-02-20 18:51:20,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 326 transitions. [2022-02-20 18:51:20,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 326 transitions. [2022-02-20 18:51:20,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:21,321 INFO L225 Difference]: With dead ends: 3631 [2022-02-20 18:51:21,322 INFO L226 Difference]: Without dead ends: 3181 [2022-02-20 18:51:21,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:51:21,323 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 206 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:21,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 338 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:21,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2022-02-20 18:51:26,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 2727. [2022-02-20 18:51:26,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:26,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3181 states. Second operand has 2727 states, 2726 states have (on average 1.4277329420396185) internal successors, (3892), 2726 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,285 INFO L74 IsIncluded]: Start isIncluded. First operand 3181 states. Second operand has 2727 states, 2726 states have (on average 1.4277329420396185) internal successors, (3892), 2726 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,287 INFO L87 Difference]: Start difference. First operand 3181 states. Second operand has 2727 states, 2726 states have (on average 1.4277329420396185) internal successors, (3892), 2726 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:26,598 INFO L93 Difference]: Finished difference Result 3181 states and 4551 transitions. [2022-02-20 18:51:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 4551 transitions. [2022-02-20 18:51:26,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:26,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:26,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 2727 states, 2726 states have (on average 1.4277329420396185) internal successors, (3892), 2726 states have internal predecessors, (3892), 0 states have call successors, (0), 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 3181 states. [2022-02-20 18:51:26,606 INFO L87 Difference]: Start difference. First operand has 2727 states, 2726 states have (on average 1.4277329420396185) internal successors, (3892), 2726 states have internal predecessors, (3892), 0 states have call successors, (0), 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 3181 states. [2022-02-20 18:51:26,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:26,909 INFO L93 Difference]: Finished difference Result 3181 states and 4551 transitions. [2022-02-20 18:51:26,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 4551 transitions. [2022-02-20 18:51:26,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:26,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:26,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:26,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:26,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2727 states, 2726 states have (on average 1.4277329420396185) internal successors, (3892), 2726 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2727 states to 2727 states and 3892 transitions. [2022-02-20 18:51:27,197 INFO L78 Accepts]: Start accepts. Automaton has 2727 states and 3892 transitions. Word has length 60 [2022-02-20 18:51:27,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:27,198 INFO L470 AbstractCegarLoop]: Abstraction has 2727 states and 3892 transitions. [2022-02-20 18:51:27,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2727 states and 3892 transitions. [2022-02-20 18:51:27,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:51:27,199 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:27,199 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:27,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:51:27,200 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:27,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:27,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1791952020, now seen corresponding path program 1 times [2022-02-20 18:51:27,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:27,200 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167287732] [2022-02-20 18:51:27,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:27,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:27,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {62906#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_1482~0 := 0;~__return_1537~0 := 0; {62906#true} is VALID [2022-02-20 18:51:27,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {62906#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {62906#true} is VALID [2022-02-20 18:51:27,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {62906#true} assume 0 == ~r1~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id1~0 >= 0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,291 INFO L290 TraceCheckUtils]: 4: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st1~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send1~0 == ~id1~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~mode1~0 % 256; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id2~0 >= 0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st2~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send2~0 == ~id2~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~mode2~0 % 256; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id3~0 >= 0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st3~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send3~0 == ~id3~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~mode3~0 % 256; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id1~0 != ~id2~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id1~0 != ~id3~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send1~0 != ~nomsg~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send2~0 != ~nomsg~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,304 INFO L290 TraceCheckUtils]: 31: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send3~0 != ~nomsg~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,304 INFO L290 TraceCheckUtils]: 32: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,305 INFO L290 TraceCheckUtils]: 34: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(~r1~0 >= 3); {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,306 INFO L290 TraceCheckUtils]: 37: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,307 INFO L290 TraceCheckUtils]: 39: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~__return_1482~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1482~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,308 INFO L290 TraceCheckUtils]: 41: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:51:27,309 INFO L290 TraceCheckUtils]: 42: Hoare triple {62908#(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);main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:51:27,309 INFO L290 TraceCheckUtils]: 43: Hoare triple {62909#(<= ~r1~0 1)} assume !(main_~node1__m1~0#1 != ~nomsg~0); {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:51:27,310 INFO L290 TraceCheckUtils]: 44: Hoare triple {62909#(<= ~r1~0 1)} ~mode1~0 := 0; {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:51:27,310 INFO L290 TraceCheckUtils]: 45: Hoare triple {62909#(<= ~r1~0 1)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:51:27,310 INFO L290 TraceCheckUtils]: 46: Hoare triple {62909#(<= ~r1~0 1)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:51:27,311 INFO L290 TraceCheckUtils]: 47: Hoare triple {62909#(<= ~r1~0 1)} assume !(main_~node2__m2~0#1 != ~nomsg~0); {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:51:27,311 INFO L290 TraceCheckUtils]: 48: Hoare triple {62909#(<= ~r1~0 1)} ~mode2~0 := 0; {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:51:27,312 INFO L290 TraceCheckUtils]: 49: Hoare triple {62909#(<= ~r1~0 1)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:51:27,312 INFO L290 TraceCheckUtils]: 50: Hoare triple {62909#(<= ~r1~0 1)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:51:27,312 INFO L290 TraceCheckUtils]: 51: Hoare triple {62909#(<= ~r1~0 1)} assume !(main_~node3__m3~0#1 != ~nomsg~0); {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:51:27,313 INFO L290 TraceCheckUtils]: 52: Hoare triple {62909#(<= ~r1~0 1)} ~mode3~0 := 0; {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:51:27,313 INFO L290 TraceCheckUtils]: 53: Hoare triple {62909#(<= ~r1~0 1)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:51:27,313 INFO L290 TraceCheckUtils]: 54: Hoare triple {62909#(<= ~r1~0 1)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:51:27,314 INFO L290 TraceCheckUtils]: 55: Hoare triple {62909#(<= ~r1~0 1)} assume ~r1~0 >= 3; {62907#false} is VALID [2022-02-20 18:51:27,314 INFO L290 TraceCheckUtils]: 56: Hoare triple {62907#false} assume !(~r1~0 < 3); {62907#false} is VALID [2022-02-20 18:51:27,314 INFO L290 TraceCheckUtils]: 57: Hoare triple {62907#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~0#1 := 0; {62907#false} is VALID [2022-02-20 18:51:27,314 INFO L290 TraceCheckUtils]: 58: Hoare triple {62907#false} ~__return_1482~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1482~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {62907#false} is VALID [2022-02-20 18:51:27,314 INFO L290 TraceCheckUtils]: 59: Hoare triple {62907#false} assume 0 == main_~assert__arg~0#1 % 256; {62907#false} is VALID [2022-02-20 18:51:27,315 INFO L290 TraceCheckUtils]: 60: Hoare triple {62907#false} assume !false; {62907#false} is VALID [2022-02-20 18:51:27,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:51:27,315 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:27,315 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167287732] [2022-02-20 18:51:27,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167287732] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:51:27,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890561522] [2022-02-20 18:51:27,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:27,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:51:27,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:51:27,319 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:51:27,330 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:51:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:27,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 18:51:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:27,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:51:27,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {62906#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_1482~0 := 0;~__return_1537~0 := 0; {62906#true} is VALID [2022-02-20 18:51:27,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {62906#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {62906#true} is VALID [2022-02-20 18:51:27,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {62906#true} assume 0 == ~r1~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,768 INFO L290 TraceCheckUtils]: 3: Hoare triple {62919#(= ~r1~0 0)} assume ~id1~0 >= 0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,768 INFO L290 TraceCheckUtils]: 4: Hoare triple {62919#(= ~r1~0 0)} assume 0 == ~st1~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {62919#(= ~r1~0 0)} assume ~send1~0 == ~id1~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {62919#(= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {62919#(= ~r1~0 0)} assume ~id2~0 >= 0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {62919#(= ~r1~0 0)} assume 0 == ~st2~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {62919#(= ~r1~0 0)} assume ~send2~0 == ~id2~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {62919#(= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {62919#(= ~r1~0 0)} assume ~id3~0 >= 0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {62919#(= ~r1~0 0)} assume 0 == ~st3~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {62919#(= ~r1~0 0)} assume ~send3~0 == ~id3~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {62919#(= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {62919#(= ~r1~0 0)} assume ~id1~0 != ~id2~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {62919#(= ~r1~0 0)} assume ~id1~0 != ~id3~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {62919#(= ~r1~0 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {62919#(= ~r1~0 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {62919#(= ~r1~0 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {62919#(= ~r1~0 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {62919#(= ~r1~0 0)} assume ~send1~0 != ~nomsg~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {62919#(= ~r1~0 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {62919#(= ~r1~0 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {62919#(= ~r1~0 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {62919#(= ~r1~0 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {62919#(= ~r1~0 0)} assume ~send2~0 != ~nomsg~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {62919#(= ~r1~0 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {62919#(= ~r1~0 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {62919#(= ~r1~0 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {62919#(= ~r1~0 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {62919#(= ~r1~0 0)} assume ~send3~0 != ~nomsg~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,778 INFO L290 TraceCheckUtils]: 32: Hoare triple {62919#(= ~r1~0 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {62919#(= ~r1~0 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {62919#(= ~r1~0 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {62919#(= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,780 INFO L290 TraceCheckUtils]: 36: Hoare triple {62919#(= ~r1~0 0)} assume !(~r1~0 >= 3); {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:51:27,781 INFO L290 TraceCheckUtils]: 37: Hoare triple {62919#(= ~r1~0 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {63025#(and (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~r1~0 0))} is VALID [2022-02-20 18:51:27,781 INFO L290 TraceCheckUtils]: 38: Hoare triple {63025#(and (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~r1~0 0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {63029#(and (= |ULTIMATE.start_main_~check__tmp~0#1| 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~r1~0 0))} is VALID [2022-02-20 18:51:27,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {63029#(and (= |ULTIMATE.start_main_~check__tmp~0#1| 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~r1~0 0))} ~__return_1482~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1482~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {63025#(and (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~r1~0 0))} is VALID [2022-02-20 18:51:27,782 INFO L290 TraceCheckUtils]: 40: Hoare triple {63025#(and (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~r1~0 0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {63025#(and (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~r1~0 0))} is VALID [2022-02-20 18:51:27,783 INFO L290 TraceCheckUtils]: 41: Hoare triple {63025#(and (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~r1~0 0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {63025#(and (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~r1~0 0))} is VALID [2022-02-20 18:51:27,783 INFO L290 TraceCheckUtils]: 42: Hoare triple {63025#(and (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~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);main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:27,784 INFO L290 TraceCheckUtils]: 43: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node1__m1~0#1 != ~nomsg~0); {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:27,784 INFO L290 TraceCheckUtils]: 44: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~mode1~0 := 0; {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:27,784 INFO L290 TraceCheckUtils]: 45: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:27,785 INFO L290 TraceCheckUtils]: 46: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:27,785 INFO L290 TraceCheckUtils]: 47: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node2__m2~0#1 != ~nomsg~0); {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:27,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~mode2~0 := 0; {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:27,786 INFO L290 TraceCheckUtils]: 49: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:27,787 INFO L290 TraceCheckUtils]: 50: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:27,787 INFO L290 TraceCheckUtils]: 51: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node3__m3~0#1 != ~nomsg~0); {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:27,788 INFO L290 TraceCheckUtils]: 52: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:27,788 INFO L290 TraceCheckUtils]: 53: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:27,789 INFO L290 TraceCheckUtils]: 54: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:27,789 INFO L290 TraceCheckUtils]: 55: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~r1~0 >= 3; {62907#false} is VALID [2022-02-20 18:51:27,789 INFO L290 TraceCheckUtils]: 56: Hoare triple {62907#false} assume !(~r1~0 < 3); {62907#false} is VALID [2022-02-20 18:51:27,789 INFO L290 TraceCheckUtils]: 57: Hoare triple {62907#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~0#1 := 0; {62907#false} is VALID [2022-02-20 18:51:27,790 INFO L290 TraceCheckUtils]: 58: Hoare triple {62907#false} ~__return_1482~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1482~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {62907#false} is VALID [2022-02-20 18:51:27,790 INFO L290 TraceCheckUtils]: 59: Hoare triple {62907#false} assume 0 == main_~assert__arg~0#1 % 256; {62907#false} is VALID [2022-02-20 18:51:27,790 INFO L290 TraceCheckUtils]: 60: Hoare triple {62907#false} assume !false; {62907#false} is VALID [2022-02-20 18:51:27,790 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:27,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:51:28,522 INFO L290 TraceCheckUtils]: 60: Hoare triple {62907#false} assume !false; {62907#false} is VALID [2022-02-20 18:51:28,522 INFO L290 TraceCheckUtils]: 59: Hoare triple {62907#false} assume 0 == main_~assert__arg~0#1 % 256; {62907#false} is VALID [2022-02-20 18:51:28,522 INFO L290 TraceCheckUtils]: 58: Hoare triple {62907#false} ~__return_1482~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1482~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {62907#false} is VALID [2022-02-20 18:51:28,523 INFO L290 TraceCheckUtils]: 57: Hoare triple {63106#(= (+ ~st3~0 ~st2~0 ~st1~0) 1)} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~0#1 := 0; {62907#false} is VALID [2022-02-20 18:51:28,523 INFO L290 TraceCheckUtils]: 56: Hoare triple {63106#(= (+ ~st3~0 ~st2~0 ~st1~0) 1)} assume !(~r1~0 < 3); {63106#(= (+ ~st3~0 ~st2~0 ~st1~0) 1)} is VALID [2022-02-20 18:51:28,524 INFO L290 TraceCheckUtils]: 55: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} assume ~r1~0 >= 3; {63106#(= (+ ~st3~0 ~st2~0 ~st1~0) 1)} is VALID [2022-02-20 18:51:28,524 INFO L290 TraceCheckUtils]: 54: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:51:28,526 INFO L290 TraceCheckUtils]: 53: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:51:28,526 INFO L290 TraceCheckUtils]: 52: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} ~mode3~0 := 0; {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:51:28,527 INFO L290 TraceCheckUtils]: 51: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} assume !(main_~node3__m3~0#1 != ~nomsg~0); {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:51:28,527 INFO L290 TraceCheckUtils]: 50: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:51:28,528 INFO L290 TraceCheckUtils]: 49: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:51:28,528 INFO L290 TraceCheckUtils]: 48: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} ~mode2~0 := 0; {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:51:28,529 INFO L290 TraceCheckUtils]: 47: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} assume !(main_~node2__m2~0#1 != ~nomsg~0); {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:51:28,529 INFO L290 TraceCheckUtils]: 46: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:51:28,530 INFO L290 TraceCheckUtils]: 45: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:51:28,530 INFO L290 TraceCheckUtils]: 44: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} ~mode1~0 := 0; {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:51:28,531 INFO L290 TraceCheckUtils]: 43: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} assume !(main_~node1__m1~0#1 != ~nomsg~0); {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:51:28,532 INFO L290 TraceCheckUtils]: 42: Hoare triple {63153#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:51:28,532 INFO L290 TraceCheckUtils]: 41: Hoare triple {63153#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1) (< (mod (+ ~r1~0 1) 256) 3))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {63153#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,533 INFO L290 TraceCheckUtils]: 40: Hoare triple {63153#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {63153#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,534 INFO L290 TraceCheckUtils]: 39: Hoare triple {63153#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1) (< (mod (+ ~r1~0 1) 256) 3))} ~__return_1482~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1482~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {63153#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,534 INFO L290 TraceCheckUtils]: 38: Hoare triple {63153#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1) (< (mod (+ ~r1~0 1) 256) 3))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {63153#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {63153#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,535 INFO L290 TraceCheckUtils]: 36: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(~r1~0 >= 3); {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,536 INFO L290 TraceCheckUtils]: 35: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} ~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;havoc main_~check__tmp~0#1; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,537 INFO L290 TraceCheckUtils]: 32: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,537 INFO L290 TraceCheckUtils]: 31: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send3~0 != ~nomsg~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,538 INFO L290 TraceCheckUtils]: 30: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send2~0 != ~nomsg~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send1~0 != ~nomsg~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id1~0 != ~id3~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id1~0 != ~id2~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~mode3~0 % 256; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send3~0 == ~id3~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~st3~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id3~0 >= 0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~mode2~0 % 256; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send2~0 == ~id2~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~st2~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id2~0 >= 0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~mode1~0 % 256; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send1~0 == ~id1~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,547 INFO L290 TraceCheckUtils]: 4: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~st1~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,547 INFO L290 TraceCheckUtils]: 3: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id1~0 >= 0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {62906#true} assume 0 == ~r1~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:51:28,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {62906#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {62906#true} is VALID [2022-02-20 18:51:28,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {62906#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_1482~0 := 0;~__return_1537~0 := 0; {62906#true} is VALID [2022-02-20 18:51:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:28,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890561522] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:51:28,549 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:51:28,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 12 [2022-02-20 18:51:28,550 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823927216] [2022-02-20 18:51:28,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:51:28,551 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.166666666666666) internal successors, (170), 12 states have internal predecessors, (170), 0 states have call successors, (0), 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 61 [2022-02-20 18:51:28,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:28,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 14.166666666666666) internal successors, (170), 12 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:28,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:28,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:51:28,698 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:28,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:51:28,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:51:28,699 INFO L87 Difference]: Start difference. First operand 2727 states and 3892 transitions. Second operand has 12 states, 12 states have (on average 14.166666666666666) internal successors, (170), 12 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)