./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-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-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-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 c39b660f273ecbdfa60a013e46dad0637949d26902d1f41ae3834ad8e3310564 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:44:56,367 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:44:56,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:44:56,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:44:56,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:44:56,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:44:56,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:44:56,415 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:44:56,416 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:44:56,417 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:44:56,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:44:56,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:44:56,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:44:56,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:44:56,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:44:56,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:44:56,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:44:56,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:44:56,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:44:56,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:44:56,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:44:56,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:44:56,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:44:56,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:44:56,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:44:56,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:44:56,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:44:56,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:44:56,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:44:56,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:44:56,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:44:56,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:44:56,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:44:56,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:44:56,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:44:56,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:44:56,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:44:56,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:44:56,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:44:56,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:44:56,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:44:56,438 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:44:56,469 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:44:56,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:44:56,469 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:44:56,470 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:44:56,470 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:44:56,470 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:44:56,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:44:56,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:44:56,471 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:44:56,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:44:56,472 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:44:56,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:44:56,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:44:56,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:44:56,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:44:56,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:44:56,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:44:56,473 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:44:56,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:44:56,473 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:44:56,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:44:56,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:44:56,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:44:56,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:44:56,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:44:56,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:44:56,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:44:56,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:44:56,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:44:56,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:44:56,476 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:44:56,476 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:44:56,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:44:56,476 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 -> c39b660f273ecbdfa60a013e46dad0637949d26902d1f41ae3834ad8e3310564 [2022-02-20 18:44:56,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:44:56,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:44:56,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:44:56,644 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:44:56,644 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:44:56,645 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:44:56,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f9525df5/754c5639afc5432a8a8f93db174ba605/FLAGe8fba2a18 [2022-02-20 18:44:57,096 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:44:57,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:44:57,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f9525df5/754c5639afc5432a8a8f93db174ba605/FLAGe8fba2a18 [2022-02-20 18:44:57,473 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f9525df5/754c5639afc5432a8a8f93db174ba605 [2022-02-20 18:44:57,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:44:57,476 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:44:57,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:44:57,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:44:57,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:44:57,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:44:57" (1/1) ... [2022-02-20 18:44:57,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47599ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:57, skipping insertion in model container [2022-02-20 18:44:57,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:44:57" (1/1) ... [2022-02-20 18:44:57,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:44:57,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:44:57,701 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-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7469,7482] [2022-02-20 18:44:57,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:44:57,739 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:44:57,785 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-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7469,7482] [2022-02-20 18:44:57,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:44:57,814 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:44:57,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:57 WrapperNode [2022-02-20 18:44:57,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:44:57,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:44:57,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:44:57,816 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:44:57,821 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:44:57" (1/1) ... [2022-02-20 18:44:57,828 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:44:57" (1/1) ... [2022-02-20 18:44:57,865 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 610 [2022-02-20 18:44:57,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:44:57,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:44:57,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:44:57,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:44:57,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:57" (1/1) ... [2022-02-20 18:44:57,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:57" (1/1) ... [2022-02-20 18:44:57,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:57" (1/1) ... [2022-02-20 18:44:57,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:57" (1/1) ... [2022-02-20 18:44:57,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:57" (1/1) ... [2022-02-20 18:44:57,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:57" (1/1) ... [2022-02-20 18:44:57,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:57" (1/1) ... [2022-02-20 18:44:57,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:44:57,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:44:57,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:44:57,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:44:57,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:57" (1/1) ... [2022-02-20 18:44:57,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:44:57,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:44:57,940 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:44:57,946 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:44:57,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:44:57,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:44:57,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:44:57,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:44:58,068 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:44:58,069 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:44:58,617 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:44:58,625 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:44:58,626 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:44:58,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:44:58 BoogieIcfgContainer [2022-02-20 18:44:58,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:44:58,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:44:58,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:44:58,632 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:44:58,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:44:57" (1/3) ... [2022-02-20 18:44:58,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aad7d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:44:58, skipping insertion in model container [2022-02-20 18:44:58,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:57" (2/3) ... [2022-02-20 18:44:58,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aad7d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:44:58, skipping insertion in model container [2022-02-20 18:44:58,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:44:58" (3/3) ... [2022-02-20 18:44:58,637 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:44:58,641 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:44:58,642 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:44:58,680 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:44:58,684 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:44:58,684 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:44:58,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 160 states have (on average 1.70625) internal successors, (273), 161 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:58,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:44:58,704 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:58,704 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:44:58,705 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:58,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:58,708 INFO L85 PathProgramCache]: Analyzing trace with hash 985312972, now seen corresponding path program 1 times [2022-02-20 18:44:58,715 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:58,715 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447745371] [2022-02-20 18:44:58,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:58,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:59,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#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(63, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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_6321~0 := 0;~__return_6399~0 := 0;~__return_6462~0 := 0;~__tmp_6490_0~0 := 0;~__return_6532~0 := 0;~__tmp_6533_0~0 := 0;~__return_6546~0 := 0;~__return_6718~0 := 0; {165#true} is VALID [2022-02-20 18:44:59,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~2#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {165#true} is VALID [2022-02-20 18:44:59,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {165#true} assume 0 == ~r1~0; {165#true} is VALID [2022-02-20 18:44:59,030 INFO L290 TraceCheckUtils]: 3: Hoare triple {165#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {165#true} is VALID [2022-02-20 18:44:59,030 INFO L290 TraceCheckUtils]: 4: Hoare triple {165#true} assume ~id1~0 >= 0; {165#true} is VALID [2022-02-20 18:44:59,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {165#true} assume 0 == ~st1~0; {167#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:59,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {167#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {167#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:59,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {167#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {167#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:59,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {167#(<= ~st1~0 0)} assume ~id2~0 >= 0; {167#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:59,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {167#(<= ~st1~0 0)} assume 0 == ~st2~0; {168#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {168#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {168#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {168#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {168#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {168#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {168#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {168#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6321~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6321~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {169#(<= (+ ~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; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {169#(<= (+ ~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; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~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; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6399~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6399~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; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,049 INFO L290 TraceCheckUtils]: 36: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,049 INFO L290 TraceCheckUtils]: 37: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,049 INFO L290 TraceCheckUtils]: 38: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,050 INFO L290 TraceCheckUtils]: 39: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,050 INFO L290 TraceCheckUtils]: 40: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,051 INFO L290 TraceCheckUtils]: 41: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,051 INFO L290 TraceCheckUtils]: 42: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,051 INFO L290 TraceCheckUtils]: 43: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,052 INFO L290 TraceCheckUtils]: 45: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~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~1#1; {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:59,053 INFO L290 TraceCheckUtils]: 46: Hoare triple {169#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6718~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6718~0;~__tmp_6533_0~0 := main_~main____CPAchecker_TMP_0~0#1; {166#false} is VALID [2022-02-20 18:44:59,053 INFO L290 TraceCheckUtils]: 47: Hoare triple {166#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6533_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {166#false} is VALID [2022-02-20 18:44:59,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {166#false} assume 0 == main_~assert__arg~2#1 % 256; {166#false} is VALID [2022-02-20 18:44:59,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {166#false} assume !false; {166#false} is VALID [2022-02-20 18:44:59,058 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:44:59,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:59,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447745371] [2022-02-20 18:44:59,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447745371] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:59,059 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:59,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:44:59,062 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812402048] [2022-02-20 18:44:59,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:59,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:44:59,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:59,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:59,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:59,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:59,113 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:59,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:59,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:59,136 INFO L87 Difference]: Start difference. First operand has 162 states, 160 states have (on average 1.70625) internal successors, (273), 161 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:00,150 INFO L93 Difference]: Finished difference Result 517 states and 836 transitions. [2022-02-20 18:45:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:45:00,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:45:00,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 836 transitions. [2022-02-20 18:45:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 836 transitions. [2022-02-20 18:45:00,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 836 transitions. [2022-02-20 18:45:00,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 836 edges. 836 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:00,733 INFO L225 Difference]: With dead ends: 517 [2022-02-20 18:45:00,734 INFO L226 Difference]: Without dead ends: 438 [2022-02-20 18:45:00,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:45:00,739 INFO L933 BasicCegarLoop]: 378 mSDtfsCounter, 913 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:00,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [913 Valid, 1288 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:45:00,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-02-20 18:45:00,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 256. [2022-02-20 18:45:00,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:00,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 438 states. Second operand has 256 states, 255 states have (on average 1.4980392156862745) internal successors, (382), 255 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:00,835 INFO L74 IsIncluded]: Start isIncluded. First operand 438 states. Second operand has 256 states, 255 states have (on average 1.4980392156862745) internal successors, (382), 255 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:00,836 INFO L87 Difference]: Start difference. First operand 438 states. Second operand has 256 states, 255 states have (on average 1.4980392156862745) internal successors, (382), 255 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:00,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:00,849 INFO L93 Difference]: Finished difference Result 438 states and 663 transitions. [2022-02-20 18:45:00,849 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 663 transitions. [2022-02-20 18:45:00,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:00,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:00,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 256 states, 255 states have (on average 1.4980392156862745) internal successors, (382), 255 states have internal predecessors, (382), 0 states have call successors, (0), 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 438 states. [2022-02-20 18:45:00,853 INFO L87 Difference]: Start difference. First operand has 256 states, 255 states have (on average 1.4980392156862745) internal successors, (382), 255 states have internal predecessors, (382), 0 states have call successors, (0), 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 438 states. [2022-02-20 18:45:00,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:00,864 INFO L93 Difference]: Finished difference Result 438 states and 663 transitions. [2022-02-20 18:45:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 663 transitions. [2022-02-20 18:45:00,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:00,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:00,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:00,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.4980392156862745) internal successors, (382), 255 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 382 transitions. [2022-02-20 18:45:00,873 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 382 transitions. Word has length 50 [2022-02-20 18:45:00,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:00,874 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 382 transitions. [2022-02-20 18:45:00,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 382 transitions. [2022-02-20 18:45:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:45:00,875 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:00,875 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:00,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:45:00,876 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:00,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:00,876 INFO L85 PathProgramCache]: Analyzing trace with hash -722006169, now seen corresponding path program 1 times [2022-02-20 18:45:00,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:00,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000137399] [2022-02-20 18:45:00,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:00,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:00,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {2074#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(63, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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_6321~0 := 0;~__return_6399~0 := 0;~__return_6462~0 := 0;~__tmp_6490_0~0 := 0;~__return_6532~0 := 0;~__tmp_6533_0~0 := 0;~__return_6546~0 := 0;~__return_6718~0 := 0; {2074#true} is VALID [2022-02-20 18:45:00,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {2074#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~2#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {2074#true} is VALID [2022-02-20 18:45:00,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {2074#true} assume 0 == ~r1~0; {2074#true} is VALID [2022-02-20 18:45:00,957 INFO L290 TraceCheckUtils]: 3: Hoare triple {2074#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {2074#true} is VALID [2022-02-20 18:45:00,957 INFO L290 TraceCheckUtils]: 4: Hoare triple {2074#true} assume ~id1~0 >= 0; {2074#true} is VALID [2022-02-20 18:45:00,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {2074#true} assume 0 == ~st1~0; {2074#true} is VALID [2022-02-20 18:45:00,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {2074#true} assume ~send1~0 == ~id1~0; {2074#true} is VALID [2022-02-20 18:45:00,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {2074#true} assume 0 == ~mode1~0 % 256; {2074#true} is VALID [2022-02-20 18:45:00,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {2074#true} assume ~id2~0 >= 0; {2074#true} is VALID [2022-02-20 18:45:00,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {2074#true} assume 0 == ~st2~0; {2074#true} is VALID [2022-02-20 18:45:00,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {2074#true} assume ~send2~0 == ~id2~0; {2074#true} is VALID [2022-02-20 18:45:00,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {2074#true} assume 0 == ~mode2~0 % 256; {2074#true} is VALID [2022-02-20 18:45:00,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {2074#true} assume ~id3~0 >= 0; {2074#true} is VALID [2022-02-20 18:45:00,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {2074#true} assume 0 == ~st3~0; {2074#true} is VALID [2022-02-20 18:45:00,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {2074#true} assume ~send3~0 == ~id3~0; {2074#true} is VALID [2022-02-20 18:45:00,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {2074#true} assume 0 == ~mode3~0 % 256; {2074#true} is VALID [2022-02-20 18:45:00,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {2074#true} assume ~id1~0 != ~id2~0; {2074#true} is VALID [2022-02-20 18:45:00,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {2074#true} assume ~id1~0 != ~id3~0; {2074#true} is VALID [2022-02-20 18:45:00,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {2074#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6321~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6321~0; {2074#true} is VALID [2022-02-20 18:45:00,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {2074#true} 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; {2074#true} is VALID [2022-02-20 18:45:00,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {2074#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2074#true} is VALID [2022-02-20 18:45:00,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {2074#true} assume !!(0 == ~mode1~0 % 256); {2074#true} is VALID [2022-02-20 18:45:00,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {2074#true} assume !!(0 == ~alive1~0 % 256); {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send1~0 != ~id1~0); {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode2~0 % 256); {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~alive2~0 % 256); {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send2~0 != ~id2~0); {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode3~0 % 256); {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~alive3~0 % 256); {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,966 INFO L290 TraceCheckUtils]: 31: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send3~0 != ~id3~0); {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,966 INFO L290 TraceCheckUtils]: 32: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode3~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; {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6399~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6399~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; {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,968 INFO L290 TraceCheckUtils]: 35: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 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; {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,968 INFO L290 TraceCheckUtils]: 36: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,968 INFO L290 TraceCheckUtils]: 37: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 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~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:00,969 INFO L290 TraceCheckUtils]: 39: Hoare triple {2076#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~alive1~0 % 256); {2075#false} is VALID [2022-02-20 18:45:00,970 INFO L290 TraceCheckUtils]: 40: Hoare triple {2075#false} assume !(main_~node1__m1~1#1 > ~id1~0); {2075#false} is VALID [2022-02-20 18:45:00,970 INFO L290 TraceCheckUtils]: 41: Hoare triple {2075#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {2075#false} is VALID [2022-02-20 18:45:00,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {2075#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {2075#false} is VALID [2022-02-20 18:45:00,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {2075#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2075#false} is VALID [2022-02-20 18:45:00,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {2075#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {2075#false} is VALID [2022-02-20 18:45:00,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {2075#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {2075#false} is VALID [2022-02-20 18:45:00,970 INFO L290 TraceCheckUtils]: 46: Hoare triple {2075#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2075#false} is VALID [2022-02-20 18:45:00,971 INFO L290 TraceCheckUtils]: 47: Hoare triple {2075#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {2075#false} is VALID [2022-02-20 18:45:00,971 INFO L290 TraceCheckUtils]: 48: Hoare triple {2075#false} ~mode3~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~1#1; {2075#false} is VALID [2022-02-20 18:45:00,971 INFO L290 TraceCheckUtils]: 49: Hoare triple {2075#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6718~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6718~0;~__tmp_6533_0~0 := main_~main____CPAchecker_TMP_0~0#1; {2075#false} is VALID [2022-02-20 18:45:00,971 INFO L290 TraceCheckUtils]: 50: Hoare triple {2075#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6533_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {2075#false} is VALID [2022-02-20 18:45:00,971 INFO L290 TraceCheckUtils]: 51: Hoare triple {2075#false} assume 0 == main_~assert__arg~2#1 % 256; {2075#false} is VALID [2022-02-20 18:45:00,971 INFO L290 TraceCheckUtils]: 52: Hoare triple {2075#false} assume !false; {2075#false} is VALID [2022-02-20 18:45:00,973 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:45:00,973 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:00,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000137399] [2022-02-20 18:45:00,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000137399] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:00,973 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:00,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:45:00,974 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681879728] [2022-02-20 18:45:00,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:00,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:45:00,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:00,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:01,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:01,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:45:01,004 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:01,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:45:01,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:45:01,005 INFO L87 Difference]: Start difference. First operand 256 states and 382 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:01,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:01,365 INFO L93 Difference]: Finished difference Result 628 states and 954 transitions. [2022-02-20 18:45:01,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:45:01,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:45:01,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:01,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2022-02-20 18:45:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2022-02-20 18:45:01,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 547 transitions. [2022-02-20 18:45:01,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 547 edges. 547 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:01,724 INFO L225 Difference]: With dead ends: 628 [2022-02-20 18:45:01,724 INFO L226 Difference]: Without dead ends: 430 [2022-02-20 18:45:01,725 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:45:01,725 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 158 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:01,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 420 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:45:01,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-02-20 18:45:01,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 428. [2022-02-20 18:45:01,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:01,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 430 states. Second operand has 428 states, 427 states have (on average 1.484777517564403) internal successors, (634), 427 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:01,831 INFO L74 IsIncluded]: Start isIncluded. First operand 430 states. Second operand has 428 states, 427 states have (on average 1.484777517564403) internal successors, (634), 427 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:01,832 INFO L87 Difference]: Start difference. First operand 430 states. Second operand has 428 states, 427 states have (on average 1.484777517564403) internal successors, (634), 427 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:01,842 INFO L93 Difference]: Finished difference Result 430 states and 635 transitions. [2022-02-20 18:45:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 635 transitions. [2022-02-20 18:45:01,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:01,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:01,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 428 states, 427 states have (on average 1.484777517564403) internal successors, (634), 427 states have internal predecessors, (634), 0 states have call successors, (0), 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 430 states. [2022-02-20 18:45:01,844 INFO L87 Difference]: Start difference. First operand has 428 states, 427 states have (on average 1.484777517564403) internal successors, (634), 427 states have internal predecessors, (634), 0 states have call successors, (0), 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 430 states. [2022-02-20 18:45:01,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:01,855 INFO L93 Difference]: Finished difference Result 430 states and 635 transitions. [2022-02-20 18:45:01,855 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 635 transitions. [2022-02-20 18:45:01,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:01,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:01,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:01,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 1.484777517564403) internal successors, (634), 427 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 634 transitions. [2022-02-20 18:45:01,868 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 634 transitions. Word has length 53 [2022-02-20 18:45:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:01,868 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 634 transitions. [2022-02-20 18:45:01,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:01,869 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 634 transitions. [2022-02-20 18:45:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:45:01,869 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:01,869 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:01,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:45:01,870 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:01,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:01,870 INFO L85 PathProgramCache]: Analyzing trace with hash -695460410, now seen corresponding path program 1 times [2022-02-20 18:45:01,870 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:01,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423510708] [2022-02-20 18:45:01,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:01,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:01,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {4333#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(63, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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_6321~0 := 0;~__return_6399~0 := 0;~__return_6462~0 := 0;~__tmp_6490_0~0 := 0;~__return_6532~0 := 0;~__tmp_6533_0~0 := 0;~__return_6546~0 := 0;~__return_6718~0 := 0; {4333#true} is VALID [2022-02-20 18:45:01,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {4333#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~2#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {4333#true} is VALID [2022-02-20 18:45:01,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {4333#true} assume 0 == ~r1~0; {4333#true} is VALID [2022-02-20 18:45:01,924 INFO L290 TraceCheckUtils]: 3: Hoare triple {4333#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {4333#true} is VALID [2022-02-20 18:45:01,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {4333#true} assume ~id1~0 >= 0; {4333#true} is VALID [2022-02-20 18:45:01,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {4333#true} assume 0 == ~st1~0; {4333#true} is VALID [2022-02-20 18:45:01,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {4333#true} assume ~send1~0 == ~id1~0; {4333#true} is VALID [2022-02-20 18:45:01,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {4333#true} assume 0 == ~mode1~0 % 256; {4333#true} is VALID [2022-02-20 18:45:01,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {4333#true} assume ~id2~0 >= 0; {4333#true} is VALID [2022-02-20 18:45:01,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {4333#true} assume 0 == ~st2~0; {4333#true} is VALID [2022-02-20 18:45:01,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {4333#true} assume ~send2~0 == ~id2~0; {4333#true} is VALID [2022-02-20 18:45:01,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {4333#true} assume 0 == ~mode2~0 % 256; {4333#true} is VALID [2022-02-20 18:45:01,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {4333#true} assume ~id3~0 >= 0; {4333#true} is VALID [2022-02-20 18:45:01,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {4333#true} assume 0 == ~st3~0; {4333#true} is VALID [2022-02-20 18:45:01,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {4333#true} assume ~send3~0 == ~id3~0; {4333#true} is VALID [2022-02-20 18:45:01,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {4333#true} assume 0 == ~mode3~0 % 256; {4333#true} is VALID [2022-02-20 18:45:01,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {4333#true} assume ~id1~0 != ~id2~0; {4333#true} is VALID [2022-02-20 18:45:01,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {4333#true} assume ~id1~0 != ~id3~0; {4333#true} is VALID [2022-02-20 18:45:01,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {4333#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6321~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6321~0; {4333#true} is VALID [2022-02-20 18:45:01,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {4333#true} 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; {4333#true} is VALID [2022-02-20 18:45:01,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {4333#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4333#true} is VALID [2022-02-20 18:45:01,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {4333#true} assume !!(0 == ~mode1~0 % 256); {4333#true} is VALID [2022-02-20 18:45:01,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {4333#true} assume !!(0 == ~alive1~0 % 256); {4333#true} is VALID [2022-02-20 18:45:01,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {4333#true} assume !(~send1~0 != ~id1~0); {4333#true} is VALID [2022-02-20 18:45:01,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {4333#true} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {4333#true} is VALID [2022-02-20 18:45:01,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {4333#true} assume !!(0 == ~mode2~0 % 256); {4333#true} is VALID [2022-02-20 18:45:01,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {4333#true} assume !!(0 == ~alive2~0 % 256); {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:01,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(~send2~0 != ~id2~0); {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:01,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:01,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !!(0 == ~mode3~0 % 256); {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:01,929 INFO L290 TraceCheckUtils]: 30: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !!(0 == ~alive3~0 % 256); {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:01,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(~send3~0 != ~id3~0); {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:01,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode3~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; {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:01,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:01,931 INFO L290 TraceCheckUtils]: 34: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6399~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6399~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; {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:01,931 INFO L290 TraceCheckUtils]: 35: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~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; {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:01,931 INFO L290 TraceCheckUtils]: 36: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:01,932 INFO L290 TraceCheckUtils]: 37: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~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~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:01,932 INFO L290 TraceCheckUtils]: 38: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:01,932 INFO L290 TraceCheckUtils]: 39: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:01,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:01,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:01,934 INFO L290 TraceCheckUtils]: 42: Hoare triple {4335#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~alive2~0 % 256); {4334#false} is VALID [2022-02-20 18:45:01,934 INFO L290 TraceCheckUtils]: 43: Hoare triple {4334#false} assume !(main_~node2__m2~1#1 > ~id2~0); {4334#false} is VALID [2022-02-20 18:45:01,934 INFO L290 TraceCheckUtils]: 44: Hoare triple {4334#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {4334#false} is VALID [2022-02-20 18:45:01,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {4334#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {4334#false} is VALID [2022-02-20 18:45:01,934 INFO L290 TraceCheckUtils]: 46: Hoare triple {4334#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4334#false} is VALID [2022-02-20 18:45:01,934 INFO L290 TraceCheckUtils]: 47: Hoare triple {4334#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {4334#false} is VALID [2022-02-20 18:45:01,934 INFO L290 TraceCheckUtils]: 48: Hoare triple {4334#false} ~mode3~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~1#1; {4334#false} is VALID [2022-02-20 18:45:01,934 INFO L290 TraceCheckUtils]: 49: Hoare triple {4334#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6718~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6718~0;~__tmp_6533_0~0 := main_~main____CPAchecker_TMP_0~0#1; {4334#false} is VALID [2022-02-20 18:45:01,934 INFO L290 TraceCheckUtils]: 50: Hoare triple {4334#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6533_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {4334#false} is VALID [2022-02-20 18:45:01,934 INFO L290 TraceCheckUtils]: 51: Hoare triple {4334#false} assume 0 == main_~assert__arg~2#1 % 256; {4334#false} is VALID [2022-02-20 18:45:01,935 INFO L290 TraceCheckUtils]: 52: Hoare triple {4334#false} assume !false; {4334#false} is VALID [2022-02-20 18:45:01,935 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:45:01,935 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:01,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423510708] [2022-02-20 18:45:01,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423510708] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:01,936 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:01,936 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:45:01,936 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159961099] [2022-02-20 18:45:01,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:01,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:45:01,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:01,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:01,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:01,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:45:01,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:01,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:45:01,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:45:01,976 INFO L87 Difference]: Start difference. First operand 428 states and 634 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:02,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:02,479 INFO L93 Difference]: Finished difference Result 1078 states and 1615 transitions. [2022-02-20 18:45:02,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:45:02,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:45:02,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:02,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2022-02-20 18:45:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2022-02-20 18:45:02,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 541 transitions. [2022-02-20 18:45:02,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 541 edges. 541 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:02,883 INFO L225 Difference]: With dead ends: 1078 [2022-02-20 18:45:02,883 INFO L226 Difference]: Without dead ends: 750 [2022-02-20 18:45:02,885 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:45:02,886 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 157 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:02,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 434 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:45:02,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-02-20 18:45:03,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 748. [2022-02-20 18:45:03,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:03,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 750 states. Second operand has 748 states, 747 states have (on average 1.4725568942436413) internal successors, (1100), 747 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:03,081 INFO L74 IsIncluded]: Start isIncluded. First operand 750 states. Second operand has 748 states, 747 states have (on average 1.4725568942436413) internal successors, (1100), 747 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:03,083 INFO L87 Difference]: Start difference. First operand 750 states. Second operand has 748 states, 747 states have (on average 1.4725568942436413) internal successors, (1100), 747 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:03,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:03,102 INFO L93 Difference]: Finished difference Result 750 states and 1101 transitions. [2022-02-20 18:45:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1101 transitions. [2022-02-20 18:45:03,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:03,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:03,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 748 states, 747 states have (on average 1.4725568942436413) internal successors, (1100), 747 states have internal predecessors, (1100), 0 states have call successors, (0), 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 750 states. [2022-02-20 18:45:03,106 INFO L87 Difference]: Start difference. First operand has 748 states, 747 states have (on average 1.4725568942436413) internal successors, (1100), 747 states have internal predecessors, (1100), 0 states have call successors, (0), 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 750 states. [2022-02-20 18:45:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:03,126 INFO L93 Difference]: Finished difference Result 750 states and 1101 transitions. [2022-02-20 18:45:03,126 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1101 transitions. [2022-02-20 18:45:03,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:03,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:03,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:03,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 1.4725568942436413) internal successors, (1100), 747 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:03,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1100 transitions. [2022-02-20 18:45:03,154 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1100 transitions. Word has length 53 [2022-02-20 18:45:03,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:03,154 INFO L470 AbstractCegarLoop]: Abstraction has 748 states and 1100 transitions. [2022-02-20 18:45:03,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:03,154 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1100 transitions. [2022-02-20 18:45:03,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:45:03,155 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:03,155 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:03,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:45:03,156 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:03,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:03,156 INFO L85 PathProgramCache]: Analyzing trace with hash -272648633, now seen corresponding path program 1 times [2022-02-20 18:45:03,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:03,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496460207] [2022-02-20 18:45:03,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:03,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:03,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {8270#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(63, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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_6321~0 := 0;~__return_6399~0 := 0;~__return_6462~0 := 0;~__tmp_6490_0~0 := 0;~__return_6532~0 := 0;~__tmp_6533_0~0 := 0;~__return_6546~0 := 0;~__return_6718~0 := 0; {8270#true} is VALID [2022-02-20 18:45:03,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {8270#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~2#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {8270#true} is VALID [2022-02-20 18:45:03,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {8270#true} assume 0 == ~r1~0; {8270#true} is VALID [2022-02-20 18:45:03,198 INFO L290 TraceCheckUtils]: 3: Hoare triple {8270#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {8270#true} is VALID [2022-02-20 18:45:03,198 INFO L290 TraceCheckUtils]: 4: Hoare triple {8270#true} assume ~id1~0 >= 0; {8270#true} is VALID [2022-02-20 18:45:03,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {8270#true} assume 0 == ~st1~0; {8270#true} is VALID [2022-02-20 18:45:03,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {8270#true} assume ~send1~0 == ~id1~0; {8270#true} is VALID [2022-02-20 18:45:03,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {8270#true} assume 0 == ~mode1~0 % 256; {8270#true} is VALID [2022-02-20 18:45:03,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {8270#true} assume ~id2~0 >= 0; {8270#true} is VALID [2022-02-20 18:45:03,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {8270#true} assume 0 == ~st2~0; {8270#true} is VALID [2022-02-20 18:45:03,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {8270#true} assume ~send2~0 == ~id2~0; {8270#true} is VALID [2022-02-20 18:45:03,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {8270#true} assume 0 == ~mode2~0 % 256; {8270#true} is VALID [2022-02-20 18:45:03,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {8270#true} assume ~id3~0 >= 0; {8270#true} is VALID [2022-02-20 18:45:03,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {8270#true} assume 0 == ~st3~0; {8270#true} is VALID [2022-02-20 18:45:03,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {8270#true} assume ~send3~0 == ~id3~0; {8270#true} is VALID [2022-02-20 18:45:03,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {8270#true} assume 0 == ~mode3~0 % 256; {8270#true} is VALID [2022-02-20 18:45:03,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {8270#true} assume ~id1~0 != ~id2~0; {8270#true} is VALID [2022-02-20 18:45:03,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {8270#true} assume ~id1~0 != ~id3~0; {8270#true} is VALID [2022-02-20 18:45:03,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {8270#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6321~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6321~0; {8270#true} is VALID [2022-02-20 18:45:03,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {8270#true} 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; {8270#true} is VALID [2022-02-20 18:45:03,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {8270#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {8270#true} is VALID [2022-02-20 18:45:03,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {8270#true} assume !!(0 == ~mode1~0 % 256); {8270#true} is VALID [2022-02-20 18:45:03,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {8270#true} assume !!(0 == ~alive1~0 % 256); {8270#true} is VALID [2022-02-20 18:45:03,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {8270#true} assume !(~send1~0 != ~id1~0); {8270#true} is VALID [2022-02-20 18:45:03,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {8270#true} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {8270#true} is VALID [2022-02-20 18:45:03,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {8270#true} assume !!(0 == ~mode2~0 % 256); {8270#true} is VALID [2022-02-20 18:45:03,201 INFO L290 TraceCheckUtils]: 26: Hoare triple {8270#true} assume !!(0 == ~alive2~0 % 256); {8270#true} is VALID [2022-02-20 18:45:03,202 INFO L290 TraceCheckUtils]: 27: Hoare triple {8270#true} assume !(~send2~0 != ~id2~0); {8270#true} is VALID [2022-02-20 18:45:03,202 INFO L290 TraceCheckUtils]: 28: Hoare triple {8270#true} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {8270#true} is VALID [2022-02-20 18:45:03,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {8270#true} assume !!(0 == ~mode3~0 % 256); {8270#true} is VALID [2022-02-20 18:45:03,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {8270#true} assume !!(0 == ~alive3~0 % 256); {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:03,203 INFO L290 TraceCheckUtils]: 31: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(~send3~0 != ~id3~0); {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:03,203 INFO L290 TraceCheckUtils]: 32: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} ~mode3~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; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:03,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:03,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6399~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6399~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; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:03,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~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; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:03,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:03,205 INFO L290 TraceCheckUtils]: 37: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~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~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:03,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:03,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:03,206 INFO L290 TraceCheckUtils]: 40: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:03,207 INFO L290 TraceCheckUtils]: 41: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:03,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:03,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:03,208 INFO L290 TraceCheckUtils]: 44: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:03,208 INFO L290 TraceCheckUtils]: 45: Hoare triple {8272#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~alive3~0 % 256); {8271#false} is VALID [2022-02-20 18:45:03,208 INFO L290 TraceCheckUtils]: 46: Hoare triple {8271#false} assume !(main_~node3__m3~1#1 > ~id3~0); {8271#false} is VALID [2022-02-20 18:45:03,209 INFO L290 TraceCheckUtils]: 47: Hoare triple {8271#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {8271#false} is VALID [2022-02-20 18:45:03,209 INFO L290 TraceCheckUtils]: 48: Hoare triple {8271#false} ~mode3~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~1#1; {8271#false} is VALID [2022-02-20 18:45:03,209 INFO L290 TraceCheckUtils]: 49: Hoare triple {8271#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6718~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6718~0;~__tmp_6533_0~0 := main_~main____CPAchecker_TMP_0~0#1; {8271#false} is VALID [2022-02-20 18:45:03,209 INFO L290 TraceCheckUtils]: 50: Hoare triple {8271#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6533_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {8271#false} is VALID [2022-02-20 18:45:03,209 INFO L290 TraceCheckUtils]: 51: Hoare triple {8271#false} assume 0 == main_~assert__arg~2#1 % 256; {8271#false} is VALID [2022-02-20 18:45:03,209 INFO L290 TraceCheckUtils]: 52: Hoare triple {8271#false} assume !false; {8271#false} is VALID [2022-02-20 18:45:03,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:45:03,210 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:03,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496460207] [2022-02-20 18:45:03,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496460207] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:03,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:03,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:45:03,211 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455440199] [2022-02-20 18:45:03,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:03,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:45:03,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:03,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:03,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:03,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:45:03,240 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:03,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:45:03,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:45:03,241 INFO L87 Difference]: Start difference. First operand 748 states and 1100 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:03,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:03,994 INFO L93 Difference]: Finished difference Result 1859 states and 2747 transitions. [2022-02-20 18:45:03,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:45:03,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:45:03,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:03,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2022-02-20 18:45:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:03,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2022-02-20 18:45:03,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 517 transitions. [2022-02-20 18:45:04,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 517 edges. 517 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:04,328 INFO L225 Difference]: With dead ends: 1859 [2022-02-20 18:45:04,329 INFO L226 Difference]: Without dead ends: 1295 [2022-02-20 18:45:04,330 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:45:04,330 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 144 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:04,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 434 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:45:04,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2022-02-20 18:45:04,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1293. [2022-02-20 18:45:04,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:04,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1295 states. Second operand has 1293 states, 1292 states have (on average 1.4504643962848298) internal successors, (1874), 1292 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:45:04,656 INFO L74 IsIncluded]: Start isIncluded. First operand 1295 states. Second operand has 1293 states, 1292 states have (on average 1.4504643962848298) internal successors, (1874), 1292 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:45:04,657 INFO L87 Difference]: Start difference. First operand 1295 states. Second operand has 1293 states, 1292 states have (on average 1.4504643962848298) internal successors, (1874), 1292 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:45:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:04,722 INFO L93 Difference]: Finished difference Result 1295 states and 1875 transitions. [2022-02-20 18:45:04,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1875 transitions. [2022-02-20 18:45:04,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:04,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:04,726 INFO L74 IsIncluded]: Start isIncluded. First operand has 1293 states, 1292 states have (on average 1.4504643962848298) internal successors, (1874), 1292 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 1295 states. [2022-02-20 18:45:04,728 INFO L87 Difference]: Start difference. First operand has 1293 states, 1292 states have (on average 1.4504643962848298) internal successors, (1874), 1292 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 1295 states. [2022-02-20 18:45:04,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:04,780 INFO L93 Difference]: Finished difference Result 1295 states and 1875 transitions. [2022-02-20 18:45:04,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1875 transitions. [2022-02-20 18:45:04,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:04,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:04,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:04,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:04,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1292 states have (on average 1.4504643962848298) internal successors, (1874), 1292 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:45:04,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1874 transitions. [2022-02-20 18:45:04,854 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1874 transitions. Word has length 53 [2022-02-20 18:45:04,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:04,854 INFO L470 AbstractCegarLoop]: Abstraction has 1293 states and 1874 transitions. [2022-02-20 18:45:04,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:04,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1874 transitions. [2022-02-20 18:45:04,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:45:04,856 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:04,856 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:04,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:45:04,857 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:04,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:04,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1724922721, now seen corresponding path program 1 times [2022-02-20 18:45:04,858 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:04,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805538668] [2022-02-20 18:45:04,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:04,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:04,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {15099#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(63, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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_6321~0 := 0;~__return_6399~0 := 0;~__return_6462~0 := 0;~__tmp_6490_0~0 := 0;~__return_6532~0 := 0;~__tmp_6533_0~0 := 0;~__return_6546~0 := 0;~__return_6718~0 := 0; {15099#true} is VALID [2022-02-20 18:45:04,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {15099#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~2#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {15099#true} is VALID [2022-02-20 18:45:04,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {15099#true} assume 0 == ~r1~0; {15099#true} is VALID [2022-02-20 18:45:04,956 INFO L290 TraceCheckUtils]: 3: Hoare triple {15099#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {15099#true} is VALID [2022-02-20 18:45:04,957 INFO L290 TraceCheckUtils]: 4: Hoare triple {15099#true} assume ~id1~0 >= 0; {15099#true} is VALID [2022-02-20 18:45:04,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {15099#true} assume 0 == ~st1~0; {15099#true} is VALID [2022-02-20 18:45:04,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {15099#true} assume ~send1~0 == ~id1~0; {15099#true} is VALID [2022-02-20 18:45:04,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {15099#true} assume 0 == ~mode1~0 % 256; {15099#true} is VALID [2022-02-20 18:45:04,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {15099#true} assume ~id2~0 >= 0; {15099#true} is VALID [2022-02-20 18:45:04,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {15099#true} assume 0 == ~st2~0; {15101#(<= ~st2~0 0)} is VALID [2022-02-20 18:45:04,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {15101#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {15101#(<= ~st2~0 0)} is VALID [2022-02-20 18:45:04,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {15101#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {15101#(<= ~st2~0 0)} is VALID [2022-02-20 18:45:04,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {15101#(<= ~st2~0 0)} assume ~id3~0 >= 0; {15101#(<= ~st2~0 0)} is VALID [2022-02-20 18:45:04,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {15101#(<= ~st2~0 0)} assume 0 == ~st3~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6321~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6321~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {15102#(<= (+ ~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; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {15102#(<= (+ ~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; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256); {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {15102#(<= (+ ~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); {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256); {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~alive2~0 % 256); {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send2~0 != ~id2~0); {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256); {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~alive3~0 % 256); {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,964 INFO L290 TraceCheckUtils]: 32: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send3~0 != ~id3~0); {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,964 INFO L290 TraceCheckUtils]: 33: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} ~mode3~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; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6399~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6399~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; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,966 INFO L290 TraceCheckUtils]: 36: Hoare triple {15102#(<= (+ ~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; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,970 INFO L290 TraceCheckUtils]: 38: Hoare triple {15102#(<= (+ ~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~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~alive1~0 % 256); {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~1#1 > ~id1~0); {15102#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:04,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {15102#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:45:04,975 INFO L290 TraceCheckUtils]: 43: Hoare triple {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:45:04,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:45:04,975 INFO L290 TraceCheckUtils]: 45: Hoare triple {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:45:04,976 INFO L290 TraceCheckUtils]: 46: Hoare triple {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:45:04,976 INFO L290 TraceCheckUtils]: 47: Hoare triple {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:45:04,976 INFO L290 TraceCheckUtils]: 48: Hoare triple {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:45:04,977 INFO L290 TraceCheckUtils]: 49: Hoare triple {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode3~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~1#1; {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:45:04,977 INFO L290 TraceCheckUtils]: 50: Hoare triple {15103#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6718~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6718~0;~__tmp_6533_0~0 := main_~main____CPAchecker_TMP_0~0#1; {15100#false} is VALID [2022-02-20 18:45:04,977 INFO L290 TraceCheckUtils]: 51: Hoare triple {15100#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6533_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {15100#false} is VALID [2022-02-20 18:45:04,977 INFO L290 TraceCheckUtils]: 52: Hoare triple {15100#false} assume 0 == main_~assert__arg~2#1 % 256; {15100#false} is VALID [2022-02-20 18:45:04,978 INFO L290 TraceCheckUtils]: 53: Hoare triple {15100#false} assume !false; {15100#false} is VALID [2022-02-20 18:45:04,978 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:45:04,978 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:04,978 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805538668] [2022-02-20 18:45:04,978 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805538668] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:04,978 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:04,979 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:45:04,979 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531777285] [2022-02-20 18:45:04,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:04,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:45:04,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:04,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:05,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:05,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:05,013 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:05,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:05,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:05,013 INFO L87 Difference]: Start difference. First operand 1293 states and 1874 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:06,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:06,720 INFO L93 Difference]: Finished difference Result 2516 states and 3713 transitions. [2022-02-20 18:45:06,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:45:06,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:45:06,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 763 transitions. [2022-02-20 18:45:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:06,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 763 transitions. [2022-02-20 18:45:06,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 763 transitions. [2022-02-20 18:45:07,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 763 edges. 763 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:07,374 INFO L225 Difference]: With dead ends: 2516 [2022-02-20 18:45:07,375 INFO L226 Difference]: Without dead ends: 2150 [2022-02-20 18:45:07,376 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:45:07,379 INFO L933 BasicCegarLoop]: 443 mSDtfsCounter, 634 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:07,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [634 Valid, 1128 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:45:07,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2022-02-20 18:45:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1745. [2022-02-20 18:45:08,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:08,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2150 states. Second operand has 1745 states, 1744 states have (on average 1.4581422018348624) internal successors, (2543), 1744 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:08,133 INFO L74 IsIncluded]: Start isIncluded. First operand 2150 states. Second operand has 1745 states, 1744 states have (on average 1.4581422018348624) internal successors, (2543), 1744 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:08,135 INFO L87 Difference]: Start difference. First operand 2150 states. Second operand has 1745 states, 1744 states have (on average 1.4581422018348624) internal successors, (2543), 1744 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:08,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:08,275 INFO L93 Difference]: Finished difference Result 2150 states and 3148 transitions. [2022-02-20 18:45:08,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 3148 transitions. [2022-02-20 18:45:08,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:08,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:08,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 1745 states, 1744 states have (on average 1.4581422018348624) internal successors, (2543), 1744 states have internal predecessors, (2543), 0 states have call successors, (0), 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 2150 states. [2022-02-20 18:45:08,292 INFO L87 Difference]: Start difference. First operand has 1745 states, 1744 states have (on average 1.4581422018348624) internal successors, (2543), 1744 states have internal predecessors, (2543), 0 states have call successors, (0), 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 2150 states. [2022-02-20 18:45:08,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:08,436 INFO L93 Difference]: Finished difference Result 2150 states and 3148 transitions. [2022-02-20 18:45:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 3148 transitions. [2022-02-20 18:45:08,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:08,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:08,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:08,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:08,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1745 states, 1744 states have (on average 1.4581422018348624) internal successors, (2543), 1744 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2543 transitions. [2022-02-20 18:45:08,569 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2543 transitions. Word has length 54 [2022-02-20 18:45:08,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:08,569 INFO L470 AbstractCegarLoop]: Abstraction has 1745 states and 2543 transitions. [2022-02-20 18:45:08,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:08,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2543 transitions. [2022-02-20 18:45:08,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:45:08,570 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:08,570 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:08,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:45:08,570 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:08,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:08,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1943574737, now seen corresponding path program 1 times [2022-02-20 18:45:08,571 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:08,571 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099490492] [2022-02-20 18:45:08,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:08,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:08,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {25204#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(63, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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_6321~0 := 0;~__return_6399~0 := 0;~__return_6462~0 := 0;~__tmp_6490_0~0 := 0;~__return_6532~0 := 0;~__tmp_6533_0~0 := 0;~__return_6546~0 := 0;~__return_6718~0 := 0; {25204#true} is VALID [2022-02-20 18:45:08,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {25204#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~2#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {25204#true} is VALID [2022-02-20 18:45:08,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {25204#true} assume 0 == ~r1~0; {25204#true} is VALID [2022-02-20 18:45:08,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {25204#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {25204#true} is VALID [2022-02-20 18:45:08,631 INFO L290 TraceCheckUtils]: 4: Hoare triple {25204#true} assume ~id1~0 >= 0; {25204#true} is VALID [2022-02-20 18:45:08,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {25204#true} assume 0 == ~st1~0; {25206#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:08,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {25206#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {25206#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:08,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {25206#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {25206#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:08,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {25206#(<= ~st1~0 0)} assume ~id2~0 >= 0; {25206#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:08,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {25206#(<= ~st1~0 0)} assume 0 == ~st2~0; {25206#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:08,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {25206#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {25206#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:08,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {25206#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {25206#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:08,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {25206#(<= ~st1~0 0)} assume ~id3~0 >= 0; {25206#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:08,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {25206#(<= ~st1~0 0)} assume 0 == ~st3~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6321~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6321~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {25207#(<= (+ ~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; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {25207#(<= (+ ~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; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {25207#(<= (+ ~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); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,639 INFO L290 TraceCheckUtils]: 29: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,640 INFO L290 TraceCheckUtils]: 32: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} ~mode3~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; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,641 INFO L290 TraceCheckUtils]: 35: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6399~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6399~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; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,641 INFO L290 TraceCheckUtils]: 36: Hoare triple {25207#(<= (+ ~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; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,642 INFO L290 TraceCheckUtils]: 37: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,642 INFO L290 TraceCheckUtils]: 38: Hoare triple {25207#(<= (+ ~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~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,642 INFO L290 TraceCheckUtils]: 39: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,643 INFO L290 TraceCheckUtils]: 40: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,643 INFO L290 TraceCheckUtils]: 41: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,644 INFO L290 TraceCheckUtils]: 42: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,644 INFO L290 TraceCheckUtils]: 43: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~alive2~0 % 256); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,644 INFO L290 TraceCheckUtils]: 44: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 > ~id2~0); {25207#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:08,645 INFO L290 TraceCheckUtils]: 45: Hoare triple {25207#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {25208#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:45:08,645 INFO L290 TraceCheckUtils]: 46: Hoare triple {25208#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {25208#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:45:08,646 INFO L290 TraceCheckUtils]: 47: Hoare triple {25208#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {25208#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:45:08,646 INFO L290 TraceCheckUtils]: 48: Hoare triple {25208#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {25208#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:45:08,646 INFO L290 TraceCheckUtils]: 49: Hoare triple {25208#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode3~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~1#1; {25208#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:45:08,647 INFO L290 TraceCheckUtils]: 50: Hoare triple {25208#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6718~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6718~0;~__tmp_6533_0~0 := main_~main____CPAchecker_TMP_0~0#1; {25205#false} is VALID [2022-02-20 18:45:08,647 INFO L290 TraceCheckUtils]: 51: Hoare triple {25205#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6533_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {25205#false} is VALID [2022-02-20 18:45:08,647 INFO L290 TraceCheckUtils]: 52: Hoare triple {25205#false} assume 0 == main_~assert__arg~2#1 % 256; {25205#false} is VALID [2022-02-20 18:45:08,647 INFO L290 TraceCheckUtils]: 53: Hoare triple {25205#false} assume !false; {25205#false} is VALID [2022-02-20 18:45:08,647 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:45:08,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:08,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099490492] [2022-02-20 18:45:08,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099490492] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:08,648 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:08,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:45:08,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899923159] [2022-02-20 18:45:08,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:08,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:45:08,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:08,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:08,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:08,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:08,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:08,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:08,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:08,690 INFO L87 Difference]: Start difference. First operand 1745 states and 2543 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:10,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:10,771 INFO L93 Difference]: Finished difference Result 2968 states and 4382 transitions. [2022-02-20 18:45:10,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:45:10,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:45:10,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 763 transitions. [2022-02-20 18:45:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 763 transitions. [2022-02-20 18:45:10,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 763 transitions. [2022-02-20 18:45:11,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 763 edges. 763 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:11,455 INFO L225 Difference]: With dead ends: 2968 [2022-02-20 18:45:11,455 INFO L226 Difference]: Without dead ends: 2602 [2022-02-20 18:45:11,456 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:45:11,456 INFO L933 BasicCegarLoop]: 398 mSDtfsCounter, 626 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:11,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [626 Valid, 987 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:45:11,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2022-02-20 18:45:12,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2091. [2022-02-20 18:45:12,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:12,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2602 states. Second operand has 2091 states, 2090 states have (on average 1.4631578947368422) internal successors, (3058), 2090 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:12,582 INFO L74 IsIncluded]: Start isIncluded. First operand 2602 states. Second operand has 2091 states, 2090 states have (on average 1.4631578947368422) internal successors, (3058), 2090 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:12,584 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand has 2091 states, 2090 states have (on average 1.4631578947368422) internal successors, (3058), 2090 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:12,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:12,778 INFO L93 Difference]: Finished difference Result 2602 states and 3817 transitions. [2022-02-20 18:45:12,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 3817 transitions. [2022-02-20 18:45:12,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:12,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:12,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 2091 states, 2090 states have (on average 1.4631578947368422) internal successors, (3058), 2090 states have internal predecessors, (3058), 0 states have call successors, (0), 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 2602 states. [2022-02-20 18:45:12,785 INFO L87 Difference]: Start difference. First operand has 2091 states, 2090 states have (on average 1.4631578947368422) internal successors, (3058), 2090 states have internal predecessors, (3058), 0 states have call successors, (0), 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 2602 states. [2022-02-20 18:45:12,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:12,979 INFO L93 Difference]: Finished difference Result 2602 states and 3817 transitions. [2022-02-20 18:45:12,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 3817 transitions. [2022-02-20 18:45:12,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:12,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:12,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:12,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2091 states, 2090 states have (on average 1.4631578947368422) internal successors, (3058), 2090 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 3058 transitions. [2022-02-20 18:45:13,166 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 3058 transitions. Word has length 54 [2022-02-20 18:45:13,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:13,167 INFO L470 AbstractCegarLoop]: Abstraction has 2091 states and 3058 transitions. [2022-02-20 18:45:13,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3058 transitions. [2022-02-20 18:45:13,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:45:13,168 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:13,168 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:13,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:45:13,168 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:13,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:13,168 INFO L85 PathProgramCache]: Analyzing trace with hash -867408349, now seen corresponding path program 1 times [2022-02-20 18:45:13,169 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:13,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534152963] [2022-02-20 18:45:13,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:13,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:13,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {37323#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(63, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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_6321~0 := 0;~__return_6399~0 := 0;~__return_6462~0 := 0;~__tmp_6490_0~0 := 0;~__return_6532~0 := 0;~__tmp_6533_0~0 := 0;~__return_6546~0 := 0;~__return_6718~0 := 0; {37323#true} is VALID [2022-02-20 18:45:13,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {37323#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~2#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {37323#true} is VALID [2022-02-20 18:45:13,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {37323#true} assume 0 == ~r1~0; {37323#true} is VALID [2022-02-20 18:45:13,216 INFO L290 TraceCheckUtils]: 3: Hoare triple {37323#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {37323#true} is VALID [2022-02-20 18:45:13,216 INFO L290 TraceCheckUtils]: 4: Hoare triple {37323#true} assume ~id1~0 >= 0; {37323#true} is VALID [2022-02-20 18:45:13,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {37323#true} assume 0 == ~st1~0; {37325#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:13,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {37325#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {37325#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:13,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {37325#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {37325#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:13,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {37325#(<= ~st1~0 0)} assume ~id2~0 >= 0; {37325#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:13,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {37325#(<= ~st1~0 0)} assume 0 == ~st2~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6321~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6321~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {37326#(<= (+ ~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; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {37326#(<= (+ ~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; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,224 INFO L290 TraceCheckUtils]: 32: Hoare triple {37326#(<= (+ ~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); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} ~mode3~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; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,224 INFO L290 TraceCheckUtils]: 35: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6399~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6399~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; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {37326#(<= (+ ~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; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {37326#(<= (+ ~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~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,226 INFO L290 TraceCheckUtils]: 40: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,226 INFO L290 TraceCheckUtils]: 41: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,226 INFO L290 TraceCheckUtils]: 42: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,226 INFO L290 TraceCheckUtils]: 43: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,227 INFO L290 TraceCheckUtils]: 44: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,227 INFO L290 TraceCheckUtils]: 45: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~alive3~0 % 256); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 > ~id3~0); {37326#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:13,228 INFO L290 TraceCheckUtils]: 48: Hoare triple {37326#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {37327#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:45:13,228 INFO L290 TraceCheckUtils]: 49: Hoare triple {37327#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~mode3~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~1#1; {37327#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:45:13,229 INFO L290 TraceCheckUtils]: 50: Hoare triple {37327#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6718~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6718~0;~__tmp_6533_0~0 := main_~main____CPAchecker_TMP_0~0#1; {37324#false} is VALID [2022-02-20 18:45:13,229 INFO L290 TraceCheckUtils]: 51: Hoare triple {37324#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6533_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {37324#false} is VALID [2022-02-20 18:45:13,229 INFO L290 TraceCheckUtils]: 52: Hoare triple {37324#false} assume 0 == main_~assert__arg~2#1 % 256; {37324#false} is VALID [2022-02-20 18:45:13,229 INFO L290 TraceCheckUtils]: 53: Hoare triple {37324#false} assume !false; {37324#false} is VALID [2022-02-20 18:45:13,229 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:45:13,229 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:13,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534152963] [2022-02-20 18:45:13,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534152963] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:13,230 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:13,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:45:13,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884988702] [2022-02-20 18:45:13,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:13,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:45:13,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:13,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:13,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:13,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:13,259 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:13,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:13,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:13,259 INFO L87 Difference]: Start difference. First operand 2091 states and 3058 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:15,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:15,692 INFO L93 Difference]: Finished difference Result 3367 states and 4972 transitions. [2022-02-20 18:45:15,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:45:15,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:45:15,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 763 transitions. [2022-02-20 18:45:15,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:15,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 763 transitions. [2022-02-20 18:45:15,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 763 transitions. [2022-02-20 18:45:16,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 763 edges. 763 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:16,451 INFO L225 Difference]: With dead ends: 3367 [2022-02-20 18:45:16,451 INFO L226 Difference]: Without dead ends: 3001 [2022-02-20 18:45:16,452 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:45:16,453 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 630 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:16,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 1056 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:45:16,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2022-02-20 18:45:17,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 2382. [2022-02-20 18:45:17,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:17,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3001 states. Second operand has 2382 states, 2381 states have (on average 1.4666106677866442) internal successors, (3492), 2381 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:17,603 INFO L74 IsIncluded]: Start isIncluded. First operand 3001 states. Second operand has 2382 states, 2381 states have (on average 1.4666106677866442) internal successors, (3492), 2381 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:17,604 INFO L87 Difference]: Start difference. First operand 3001 states. Second operand has 2382 states, 2381 states have (on average 1.4666106677866442) internal successors, (3492), 2381 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:17,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:17,855 INFO L93 Difference]: Finished difference Result 3001 states and 4407 transitions. [2022-02-20 18:45:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 4407 transitions. [2022-02-20 18:45:17,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:17,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:17,861 INFO L74 IsIncluded]: Start isIncluded. First operand has 2382 states, 2381 states have (on average 1.4666106677866442) internal successors, (3492), 2381 states have internal predecessors, (3492), 0 states have call successors, (0), 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 3001 states. [2022-02-20 18:45:17,862 INFO L87 Difference]: Start difference. First operand has 2382 states, 2381 states have (on average 1.4666106677866442) internal successors, (3492), 2381 states have internal predecessors, (3492), 0 states have call successors, (0), 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 3001 states. [2022-02-20 18:45:18,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:18,118 INFO L93 Difference]: Finished difference Result 3001 states and 4407 transitions. [2022-02-20 18:45:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 4407 transitions. [2022-02-20 18:45:18,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:18,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:18,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:18,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:18,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2381 states have (on average 1.4666106677866442) internal successors, (3492), 2381 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:18,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 3492 transitions. [2022-02-20 18:45:18,374 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 3492 transitions. Word has length 54 [2022-02-20 18:45:18,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:18,374 INFO L470 AbstractCegarLoop]: Abstraction has 2382 states and 3492 transitions. [2022-02-20 18:45:18,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:18,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 3492 transitions. [2022-02-20 18:45:18,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:45:18,375 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:18,375 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:18,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:45:18,375 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:18,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:18,376 INFO L85 PathProgramCache]: Analyzing trace with hash -554993830, now seen corresponding path program 1 times [2022-02-20 18:45:18,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:18,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825095787] [2022-02-20 18:45:18,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:18,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:18,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {51199#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(63, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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_6321~0 := 0;~__return_6399~0 := 0;~__return_6462~0 := 0;~__tmp_6490_0~0 := 0;~__return_6532~0 := 0;~__tmp_6533_0~0 := 0;~__return_6546~0 := 0;~__return_6718~0 := 0; {51201#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:18,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {51201#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~2#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {51201#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:18,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {51201#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {51201#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:18,425 INFO L290 TraceCheckUtils]: 3: Hoare triple {51201#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {51201#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:18,426 INFO L290 TraceCheckUtils]: 4: Hoare triple {51201#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {51202#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:18,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {51202#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {51202#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:18,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {51202#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:18,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:18,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:18,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:18,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:18,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:18,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:18,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:18,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:18,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:18,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:18,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:18,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6321~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6321~0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:18,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:18,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:18,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256); {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:18,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {51203#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:18,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {51203#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {51200#false} is VALID [2022-02-20 18:45:18,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {51200#false} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256); {51200#false} is VALID [2022-02-20 18:45:18,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {51200#false} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {51200#false} is VALID [2022-02-20 18:45:18,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {51200#false} assume !!(0 == ~mode2~0 % 256); {51200#false} is VALID [2022-02-20 18:45:18,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {51200#false} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {51200#false} is VALID [2022-02-20 18:45:18,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {51200#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {51200#false} is VALID [2022-02-20 18:45:18,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {51200#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); {51200#false} is VALID [2022-02-20 18:45:18,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {51200#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {51200#false} is VALID [2022-02-20 18:45:18,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {51200#false} assume !!(0 == ~mode3~0 % 256); {51200#false} is VALID [2022-02-20 18:45:18,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {51200#false} assume !!(0 == ~alive3~0 % 256); {51200#false} is VALID [2022-02-20 18:45:18,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {51200#false} assume !(~send3~0 != ~id3~0); {51200#false} is VALID [2022-02-20 18:45:18,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {51200#false} ~mode3~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; {51200#false} is VALID [2022-02-20 18:45:18,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {51200#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {51200#false} is VALID [2022-02-20 18:45:18,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {51200#false} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6399~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6399~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; {51200#false} is VALID [2022-02-20 18:45:18,432 INFO L290 TraceCheckUtils]: 37: Hoare triple {51200#false} 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; {51200#false} is VALID [2022-02-20 18:45:18,433 INFO L290 TraceCheckUtils]: 38: Hoare triple {51200#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {51200#false} is VALID [2022-02-20 18:45:18,433 INFO L290 TraceCheckUtils]: 39: Hoare triple {51200#false} 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~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {51200#false} is VALID [2022-02-20 18:45:18,433 INFO L290 TraceCheckUtils]: 40: Hoare triple {51200#false} assume main_~node1__m1~1#1 != ~nomsg~0; {51200#false} is VALID [2022-02-20 18:45:18,433 INFO L290 TraceCheckUtils]: 41: Hoare triple {51200#false} assume !(0 == ~alive1~0 % 256); {51200#false} is VALID [2022-02-20 18:45:18,433 INFO L290 TraceCheckUtils]: 42: Hoare triple {51200#false} assume !(main_~node1__m1~1#1 > ~id1~0); {51200#false} is VALID [2022-02-20 18:45:18,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {51200#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {51200#false} is VALID [2022-02-20 18:45:18,433 INFO L290 TraceCheckUtils]: 44: Hoare triple {51200#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {51200#false} is VALID [2022-02-20 18:45:18,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {51200#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {51200#false} is VALID [2022-02-20 18:45:18,433 INFO L290 TraceCheckUtils]: 46: Hoare triple {51200#false} assume main_~node2__m2~1#1 != ~nomsg~0; {51200#false} is VALID [2022-02-20 18:45:18,434 INFO L290 TraceCheckUtils]: 47: Hoare triple {51200#false} assume !(0 == ~alive2~0 % 256); {51200#false} is VALID [2022-02-20 18:45:18,434 INFO L290 TraceCheckUtils]: 48: Hoare triple {51200#false} assume !(main_~node2__m2~1#1 > ~id2~0); {51200#false} is VALID [2022-02-20 18:45:18,434 INFO L290 TraceCheckUtils]: 49: Hoare triple {51200#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {51200#false} is VALID [2022-02-20 18:45:18,434 INFO L290 TraceCheckUtils]: 50: Hoare triple {51200#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {51200#false} is VALID [2022-02-20 18:45:18,434 INFO L290 TraceCheckUtils]: 51: Hoare triple {51200#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {51200#false} is VALID [2022-02-20 18:45:18,434 INFO L290 TraceCheckUtils]: 52: Hoare triple {51200#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {51200#false} is VALID [2022-02-20 18:45:18,434 INFO L290 TraceCheckUtils]: 53: Hoare triple {51200#false} ~mode3~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~1#1; {51200#false} is VALID [2022-02-20 18:45:18,434 INFO L290 TraceCheckUtils]: 54: Hoare triple {51200#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6718~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6718~0;~__tmp_6533_0~0 := main_~main____CPAchecker_TMP_0~0#1; {51200#false} is VALID [2022-02-20 18:45:18,434 INFO L290 TraceCheckUtils]: 55: Hoare triple {51200#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6533_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {51200#false} is VALID [2022-02-20 18:45:18,435 INFO L290 TraceCheckUtils]: 56: Hoare triple {51200#false} assume 0 == main_~assert__arg~2#1 % 256; {51200#false} is VALID [2022-02-20 18:45:18,435 INFO L290 TraceCheckUtils]: 57: Hoare triple {51200#false} assume !false; {51200#false} is VALID [2022-02-20 18:45:18,435 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:45:18,435 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:18,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825095787] [2022-02-20 18:45:18,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825095787] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:18,435 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:18,436 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:45:18,436 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135782618] [2022-02-20 18:45:18,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:18,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-20 18:45:18,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:18,436 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), 4 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:45:18,469 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:45:18,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:18,470 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:18,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:18,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:18,471 INFO L87 Difference]: Start difference. First operand 2382 states and 3492 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 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:45:23,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:23,225 INFO L93 Difference]: Finished difference Result 5669 states and 8297 transitions. [2022-02-20 18:45:23,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:45:23,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-20 18:45:23,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:23,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 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:45:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 561 transitions. [2022-02-20 18:45:23,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 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:45:23,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 561 transitions. [2022-02-20 18:45:23,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 561 transitions. [2022-02-20 18:45:23,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 561 edges. 561 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:23,993 INFO L225 Difference]: With dead ends: 5669 [2022-02-20 18:45:23,993 INFO L226 Difference]: Without dead ends: 3315 [2022-02-20 18:45:23,996 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:45:23,996 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 888 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:23,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [888 Valid, 208 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:45:23,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3315 states. [2022-02-20 18:45:26,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3315 to 3288. [2022-02-20 18:45:26,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:26,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3315 states. Second operand has 3288 states, 3287 states have (on average 1.4432613325220567) internal successors, (4744), 3287 states have internal predecessors, (4744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:27,002 INFO L74 IsIncluded]: Start isIncluded. First operand 3315 states. Second operand has 3288 states, 3287 states have (on average 1.4432613325220567) internal successors, (4744), 3287 states have internal predecessors, (4744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:27,004 INFO L87 Difference]: Start difference. First operand 3315 states. Second operand has 3288 states, 3287 states have (on average 1.4432613325220567) internal successors, (4744), 3287 states have internal predecessors, (4744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:27,371 INFO L93 Difference]: Finished difference Result 3315 states and 4770 transitions. [2022-02-20 18:45:27,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3315 states and 4770 transitions. [2022-02-20 18:45:27,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:27,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:27,377 INFO L74 IsIncluded]: Start isIncluded. First operand has 3288 states, 3287 states have (on average 1.4432613325220567) internal successors, (4744), 3287 states have internal predecessors, (4744), 0 states have call successors, (0), 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 3315 states. [2022-02-20 18:45:27,379 INFO L87 Difference]: Start difference. First operand has 3288 states, 3287 states have (on average 1.4432613325220567) internal successors, (4744), 3287 states have internal predecessors, (4744), 0 states have call successors, (0), 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 3315 states. [2022-02-20 18:45:27,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:27,729 INFO L93 Difference]: Finished difference Result 3315 states and 4770 transitions. [2022-02-20 18:45:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3315 states and 4770 transitions. [2022-02-20 18:45:27,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:27,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:27,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:27,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:27,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3288 states, 3287 states have (on average 1.4432613325220567) internal successors, (4744), 3287 states have internal predecessors, (4744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:28,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 4744 transitions. [2022-02-20 18:45:28,231 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 4744 transitions. Word has length 58 [2022-02-20 18:45:28,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:28,231 INFO L470 AbstractCegarLoop]: Abstraction has 3288 states and 4744 transitions. [2022-02-20 18:45:28,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 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:45:28,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 4744 transitions. [2022-02-20 18:45:28,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:45:28,232 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:28,232 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:28,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:45:28,233 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:28,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:28,233 INFO L85 PathProgramCache]: Analyzing trace with hash 500702524, now seen corresponding path program 1 times [2022-02-20 18:45:28,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:28,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201568565] [2022-02-20 18:45:28,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:28,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:28,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {70099#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(63, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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_6321~0 := 0;~__return_6399~0 := 0;~__return_6462~0 := 0;~__tmp_6490_0~0 := 0;~__return_6532~0 := 0;~__tmp_6533_0~0 := 0;~__return_6546~0 := 0;~__return_6718~0 := 0; {70101#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:28,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {70101#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~2#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {70101#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:28,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {70101#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {70101#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:28,278 INFO L290 TraceCheckUtils]: 3: Hoare triple {70101#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {70101#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:28,278 INFO L290 TraceCheckUtils]: 4: Hoare triple {70101#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {70101#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:28,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {70101#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {70101#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:28,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {70101#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {70101#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:28,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {70101#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {70101#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:28,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {70101#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {70102#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:28,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {70102#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {70102#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:28,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {70102#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {70103#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:28,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {70103#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {70103#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:28,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {70103#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {70103#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:28,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {70103#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {70103#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:28,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {70103#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {70103#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:28,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {70103#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {70103#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:28,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {70103#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {70103#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:28,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {70103#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {70103#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:28,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {70103#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6321~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6321~0; {70103#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:28,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {70103#(<= (+ ~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; {70103#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:28,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {70103#(<= (+ ~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; {70103#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:28,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {70103#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {70103#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:28,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {70103#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256); {70103#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:28,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {70103#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send1~0 != ~id1~0); {70103#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:28,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {70103#(<= (+ ~nomsg~0 1) ~send2~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {70103#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:28,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {70103#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {70103#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:28,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {70103#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {70103#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:28,284 INFO L290 TraceCheckUtils]: 27: Hoare triple {70103#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {70100#false} is VALID [2022-02-20 18:45:28,284 INFO L290 TraceCheckUtils]: 28: Hoare triple {70100#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); {70100#false} is VALID [2022-02-20 18:45:28,284 INFO L290 TraceCheckUtils]: 29: Hoare triple {70100#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {70100#false} is VALID [2022-02-20 18:45:28,285 INFO L290 TraceCheckUtils]: 30: Hoare triple {70100#false} assume !!(0 == ~mode3~0 % 256); {70100#false} is VALID [2022-02-20 18:45:28,285 INFO L290 TraceCheckUtils]: 31: Hoare triple {70100#false} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {70100#false} is VALID [2022-02-20 18:45:28,285 INFO L290 TraceCheckUtils]: 32: Hoare triple {70100#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {70100#false} is VALID [2022-02-20 18:45:28,285 INFO L290 TraceCheckUtils]: 33: Hoare triple {70100#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); {70100#false} is VALID [2022-02-20 18:45:28,285 INFO L290 TraceCheckUtils]: 34: Hoare triple {70100#false} ~mode3~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; {70100#false} is VALID [2022-02-20 18:45:28,285 INFO L290 TraceCheckUtils]: 35: Hoare triple {70100#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {70100#false} is VALID [2022-02-20 18:45:28,285 INFO L290 TraceCheckUtils]: 36: Hoare triple {70100#false} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6399~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6399~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; {70100#false} is VALID [2022-02-20 18:45:28,285 INFO L290 TraceCheckUtils]: 37: Hoare triple {70100#false} 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; {70100#false} is VALID [2022-02-20 18:45:28,285 INFO L290 TraceCheckUtils]: 38: Hoare triple {70100#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {70100#false} is VALID [2022-02-20 18:45:28,286 INFO L290 TraceCheckUtils]: 39: Hoare triple {70100#false} 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~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {70100#false} is VALID [2022-02-20 18:45:28,286 INFO L290 TraceCheckUtils]: 40: Hoare triple {70100#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {70100#false} is VALID [2022-02-20 18:45:28,286 INFO L290 TraceCheckUtils]: 41: Hoare triple {70100#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {70100#false} is VALID [2022-02-20 18:45:28,286 INFO L290 TraceCheckUtils]: 42: Hoare triple {70100#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {70100#false} is VALID [2022-02-20 18:45:28,286 INFO L290 TraceCheckUtils]: 43: Hoare triple {70100#false} assume main_~node2__m2~1#1 != ~nomsg~0; {70100#false} is VALID [2022-02-20 18:45:28,286 INFO L290 TraceCheckUtils]: 44: Hoare triple {70100#false} assume !(0 == ~alive2~0 % 256); {70100#false} is VALID [2022-02-20 18:45:28,286 INFO L290 TraceCheckUtils]: 45: Hoare triple {70100#false} assume !(main_~node2__m2~1#1 > ~id2~0); {70100#false} is VALID [2022-02-20 18:45:28,286 INFO L290 TraceCheckUtils]: 46: Hoare triple {70100#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {70100#false} is VALID [2022-02-20 18:45:28,286 INFO L290 TraceCheckUtils]: 47: Hoare triple {70100#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {70100#false} is VALID [2022-02-20 18:45:28,286 INFO L290 TraceCheckUtils]: 48: Hoare triple {70100#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {70100#false} is VALID [2022-02-20 18:45:28,287 INFO L290 TraceCheckUtils]: 49: Hoare triple {70100#false} assume main_~node3__m3~1#1 != ~nomsg~0; {70100#false} is VALID [2022-02-20 18:45:28,287 INFO L290 TraceCheckUtils]: 50: Hoare triple {70100#false} assume !(0 == ~alive3~0 % 256); {70100#false} is VALID [2022-02-20 18:45:28,287 INFO L290 TraceCheckUtils]: 51: Hoare triple {70100#false} assume !(main_~node3__m3~1#1 > ~id3~0); {70100#false} is VALID [2022-02-20 18:45:28,287 INFO L290 TraceCheckUtils]: 52: Hoare triple {70100#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {70100#false} is VALID [2022-02-20 18:45:28,287 INFO L290 TraceCheckUtils]: 53: Hoare triple {70100#false} ~mode3~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~1#1; {70100#false} is VALID [2022-02-20 18:45:28,287 INFO L290 TraceCheckUtils]: 54: Hoare triple {70100#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6718~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6718~0;~__tmp_6533_0~0 := main_~main____CPAchecker_TMP_0~0#1; {70100#false} is VALID [2022-02-20 18:45:28,287 INFO L290 TraceCheckUtils]: 55: Hoare triple {70100#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6533_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {70100#false} is VALID [2022-02-20 18:45:28,287 INFO L290 TraceCheckUtils]: 56: Hoare triple {70100#false} assume 0 == main_~assert__arg~2#1 % 256; {70100#false} is VALID [2022-02-20 18:45:28,287 INFO L290 TraceCheckUtils]: 57: Hoare triple {70100#false} assume !false; {70100#false} is VALID [2022-02-20 18:45:28,288 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:45:28,288 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:28,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201568565] [2022-02-20 18:45:28,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201568565] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:28,288 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:28,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:45:28,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345217617] [2022-02-20 18:45:28,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:28,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-20 18:45:28,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:28,289 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), 4 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:45:28,319 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:45:28,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:28,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:28,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:28,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:28,320 INFO L87 Difference]: Start difference. First operand 3288 states and 4744 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 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:45:36,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:36,901 INFO L93 Difference]: Finished difference Result 7833 states and 11294 transitions. [2022-02-20 18:45:36,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:45:36,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-20 18:45:36,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 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:45:36,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2022-02-20 18:45:36,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 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:45:36,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2022-02-20 18:45:36,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 541 transitions. [2022-02-20 18:45:37,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 541 edges. 541 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:38,031 INFO L225 Difference]: With dead ends: 7833 [2022-02-20 18:45:38,031 INFO L226 Difference]: Without dead ends: 4591 [2022-02-20 18:45:38,037 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:45:38,038 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 876 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:38,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [876 Valid, 226 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:45:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2022-02-20 18:45:43,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4566. [2022-02-20 18:45:43,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:43,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4591 states. Second operand has 4566 states, 4565 states have (on average 1.4297918948521358) internal successors, (6527), 4565 states have internal predecessors, (6527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:43,402 INFO L74 IsIncluded]: Start isIncluded. First operand 4591 states. Second operand has 4566 states, 4565 states have (on average 1.4297918948521358) internal successors, (6527), 4565 states have internal predecessors, (6527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:43,405 INFO L87 Difference]: Start difference. First operand 4591 states. Second operand has 4566 states, 4565 states have (on average 1.4297918948521358) internal successors, (6527), 4565 states have internal predecessors, (6527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:44,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:44,060 INFO L93 Difference]: Finished difference Result 4591 states and 6551 transitions. [2022-02-20 18:45:44,060 INFO L276 IsEmpty]: Start isEmpty. Operand 4591 states and 6551 transitions. [2022-02-20 18:45:44,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:44,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:44,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 4566 states, 4565 states have (on average 1.4297918948521358) internal successors, (6527), 4565 states have internal predecessors, (6527), 0 states have call successors, (0), 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 4591 states. [2022-02-20 18:45:44,072 INFO L87 Difference]: Start difference. First operand has 4566 states, 4565 states have (on average 1.4297918948521358) internal successors, (6527), 4565 states have internal predecessors, (6527), 0 states have call successors, (0), 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 4591 states. [2022-02-20 18:45:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:44,703 INFO L93 Difference]: Finished difference Result 4591 states and 6551 transitions. [2022-02-20 18:45:44,703 INFO L276 IsEmpty]: Start isEmpty. Operand 4591 states and 6551 transitions. [2022-02-20 18:45:44,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:44,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:44,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:44,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4566 states, 4565 states have (on average 1.4297918948521358) internal successors, (6527), 4565 states have internal predecessors, (6527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:45,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4566 states to 4566 states and 6527 transitions. [2022-02-20 18:45:45,647 INFO L78 Accepts]: Start accepts. Automaton has 4566 states and 6527 transitions. Word has length 58 [2022-02-20 18:45:45,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:45,647 INFO L470 AbstractCegarLoop]: Abstraction has 4566 states and 6527 transitions. [2022-02-20 18:45:45,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 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:45:45,647 INFO L276 IsEmpty]: Start isEmpty. Operand 4566 states and 6527 transitions. [2022-02-20 18:45:45,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:45:45,649 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:45,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:45,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:45:45,649 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:45,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:45,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1531409244, now seen corresponding path program 1 times [2022-02-20 18:45:45,650 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:45,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461162908] [2022-02-20 18:45:45,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:45,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:45,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {96371#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(63, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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_6321~0 := 0;~__return_6399~0 := 0;~__return_6462~0 := 0;~__tmp_6490_0~0 := 0;~__return_6532~0 := 0;~__tmp_6533_0~0 := 0;~__return_6546~0 := 0;~__return_6718~0 := 0; {96373#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:45,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {96373#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~2#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {96373#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:45,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {96373#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {96373#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:45,708 INFO L290 TraceCheckUtils]: 3: Hoare triple {96373#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {96373#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:45,708 INFO L290 TraceCheckUtils]: 4: Hoare triple {96373#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {96373#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:45,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {96373#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {96373#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:45,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {96373#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {96373#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:45,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {96373#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {96373#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:45,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {96373#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {96373#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:45,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {96373#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {96373#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:45,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {96373#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {96373#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:45,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {96373#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {96373#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:45,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {96373#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {96374#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:45,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {96374#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {96374#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:45,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {96374#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {96375#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:45,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {96375#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {96375#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:45,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {96375#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {96375#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:45,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {96375#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {96375#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:45,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {96375#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6321~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6321~0; {96375#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:45,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {96375#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {96375#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:45,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {96375#(<= (+ ~nomsg~0 1) ~send3~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {96375#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:45,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {96375#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256); {96375#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:45,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {96375#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {96375#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:45,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {96375#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {96375#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:45,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {96375#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {96375#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:45,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {96375#(<= (+ ~nomsg~0 1) ~send3~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256); {96375#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:45,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {96375#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {96375#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:45,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {96375#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256); {96375#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:45,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {96375#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive2~0 % 256); {96375#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:45,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {96375#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send2~0 != ~id2~0); {96375#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:45,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {96375#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {96375#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:45,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {96375#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256); {96375#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:45,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {96375#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {96375#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:45,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {96375#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {96372#false} is VALID [2022-02-20 18:45:45,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {96372#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); {96372#false} is VALID [2022-02-20 18:45:45,718 INFO L290 TraceCheckUtils]: 35: Hoare triple {96372#false} ~mode3~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; {96372#false} is VALID [2022-02-20 18:45:45,718 INFO L290 TraceCheckUtils]: 36: Hoare triple {96372#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {96372#false} is VALID [2022-02-20 18:45:45,719 INFO L290 TraceCheckUtils]: 37: Hoare triple {96372#false} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6399~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6399~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; {96372#false} is VALID [2022-02-20 18:45:45,719 INFO L290 TraceCheckUtils]: 38: Hoare triple {96372#false} 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; {96372#false} is VALID [2022-02-20 18:45:45,719 INFO L290 TraceCheckUtils]: 39: Hoare triple {96372#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {96372#false} is VALID [2022-02-20 18:45:45,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {96372#false} 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~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {96372#false} is VALID [2022-02-20 18:45:45,719 INFO L290 TraceCheckUtils]: 41: Hoare triple {96372#false} assume main_~node1__m1~1#1 != ~nomsg~0; {96372#false} is VALID [2022-02-20 18:45:45,719 INFO L290 TraceCheckUtils]: 42: Hoare triple {96372#false} assume !(0 == ~alive1~0 % 256); {96372#false} is VALID [2022-02-20 18:45:45,719 INFO L290 TraceCheckUtils]: 43: Hoare triple {96372#false} assume !(main_~node1__m1~1#1 > ~id1~0); {96372#false} is VALID [2022-02-20 18:45:45,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {96372#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {96372#false} is VALID [2022-02-20 18:45:45,720 INFO L290 TraceCheckUtils]: 45: Hoare triple {96372#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {96372#false} is VALID [2022-02-20 18:45:45,720 INFO L290 TraceCheckUtils]: 46: Hoare triple {96372#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {96372#false} is VALID [2022-02-20 18:45:45,720 INFO L290 TraceCheckUtils]: 47: Hoare triple {96372#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {96372#false} is VALID [2022-02-20 18:45:45,720 INFO L290 TraceCheckUtils]: 48: Hoare triple {96372#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {96372#false} is VALID [2022-02-20 18:45:45,720 INFO L290 TraceCheckUtils]: 49: Hoare triple {96372#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {96372#false} is VALID [2022-02-20 18:45:45,720 INFO L290 TraceCheckUtils]: 50: Hoare triple {96372#false} assume main_~node3__m3~1#1 != ~nomsg~0; {96372#false} is VALID [2022-02-20 18:45:45,720 INFO L290 TraceCheckUtils]: 51: Hoare triple {96372#false} assume !(0 == ~alive3~0 % 256); {96372#false} is VALID [2022-02-20 18:45:45,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {96372#false} assume !(main_~node3__m3~1#1 > ~id3~0); {96372#false} is VALID [2022-02-20 18:45:45,721 INFO L290 TraceCheckUtils]: 53: Hoare triple {96372#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {96372#false} is VALID [2022-02-20 18:45:45,721 INFO L290 TraceCheckUtils]: 54: Hoare triple {96372#false} ~mode3~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~1#1; {96372#false} is VALID [2022-02-20 18:45:45,721 INFO L290 TraceCheckUtils]: 55: Hoare triple {96372#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6718~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6718~0;~__tmp_6533_0~0 := main_~main____CPAchecker_TMP_0~0#1; {96372#false} is VALID [2022-02-20 18:45:45,721 INFO L290 TraceCheckUtils]: 56: Hoare triple {96372#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6533_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {96372#false} is VALID [2022-02-20 18:45:45,721 INFO L290 TraceCheckUtils]: 57: Hoare triple {96372#false} assume 0 == main_~assert__arg~2#1 % 256; {96372#false} is VALID [2022-02-20 18:45:45,721 INFO L290 TraceCheckUtils]: 58: Hoare triple {96372#false} assume !false; {96372#false} is VALID [2022-02-20 18:45:45,722 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:45:45,722 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:45,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461162908] [2022-02-20 18:45:45,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461162908] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:45,722 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:45,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:45:45,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55465670] [2022-02-20 18:45:45,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:45,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 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 59 [2022-02-20 18:45:45,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:45,723 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), 4 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:45:45,758 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:45:45,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:45,758 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:45,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:45,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:45,759 INFO L87 Difference]: Start difference. First operand 4566 states and 6527 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 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)