./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.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.UNBOUNDED.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 22565549446fb10d699e81ca4083722d91d5f2743033fe3de4e7c76b9089640a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:45:10,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:45:10,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:45:10,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:45:10,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:45:10,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:45:10,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:45:10,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:45:10,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:45:10,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:45:10,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:45:10,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:45:10,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:45:10,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:45:10,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:45:10,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:45:10,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:45:10,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:45:10,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:45:10,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:45:10,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:45:10,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:45:10,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:45:10,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:45:10,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:45:10,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:45:10,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:45:10,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:45:10,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:45:10,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:45:10,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:45:10,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:45:10,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:45:10,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:45:10,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:45:10,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:45:10,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:45:10,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:45:10,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:45:10,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:45:10,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:45:10,413 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:45:10,431 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:45:10,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:45:10,432 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:45:10,432 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:45:10,433 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:45:10,433 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:45:10,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:45:10,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:45:10,433 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:45:10,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:45:10,434 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:45:10,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:45:10,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:45:10,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:45:10,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:45:10,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:45:10,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:45:10,435 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:45:10,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:45:10,436 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:45:10,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:45:10,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:45:10,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:45:10,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:45:10,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:45:10,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:45:10,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:45:10,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:45:10,438 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:45:10,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:45:10,438 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:45:10,438 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:45:10,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:45:10,438 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 -> 22565549446fb10d699e81ca4083722d91d5f2743033fe3de4e7c76b9089640a [2022-02-20 18:45:10,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:45:10,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:45:10,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:45:10,639 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:45:10,639 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:45:10,640 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.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:45:10,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97cf9f448/23381bc4dcc24e1ba86ce58996c44ce2/FLAGddb67d17e [2022-02-20 18:45:11,095 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:45:11,105 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:45:11,115 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97cf9f448/23381bc4dcc24e1ba86ce58996c44ce2/FLAGddb67d17e [2022-02-20 18:45:11,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97cf9f448/23381bc4dcc24e1ba86ce58996c44ce2 [2022-02-20 18:45:11,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:45:11,478 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:45:11,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:45:11,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:45:11,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:45:11,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:45:11" (1/1) ... [2022-02-20 18:45:11,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6918863c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:45:11, skipping insertion in model container [2022-02-20 18:45:11,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:45:11" (1/1) ... [2022-02-20 18:45:11,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:45:11,513 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:45:11,677 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.UNBOUNDED.pals.c.v+nlh-reducer.c[7163,7176] [2022-02-20 18:45:11,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:45:11,717 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:45:11,752 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.UNBOUNDED.pals.c.v+nlh-reducer.c[7163,7176] [2022-02-20 18:45:11,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:45:11,801 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:45:11,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:45:11 WrapperNode [2022-02-20 18:45:11,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:45:11,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:45:11,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:45:11,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:45:11,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:45:11" (1/1) ... [2022-02-20 18:45:11,830 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:45:11" (1/1) ... [2022-02-20 18:45:11,868 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 592 [2022-02-20 18:45:11,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:45:11,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:45:11,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:45:11,869 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:45:11,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:45:11" (1/1) ... [2022-02-20 18:45:11,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:45:11" (1/1) ... [2022-02-20 18:45:11,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:45:11" (1/1) ... [2022-02-20 18:45:11,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:45:11" (1/1) ... [2022-02-20 18:45:11,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:45:11" (1/1) ... [2022-02-20 18:45:11,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:45:11" (1/1) ... [2022-02-20 18:45:11,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:45:11" (1/1) ... [2022-02-20 18:45:11,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:45:11,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:45:11,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:45:11,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:45:11,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:45:11" (1/1) ... [2022-02-20 18:45:11,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:45:11,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:45:11,934 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:45:11,935 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:45:11,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:45:11,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:45:11,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:45:11,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:45:12,040 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:45:12,041 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:45:12,512 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:45:12,523 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:45:12,523 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:45:12,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:45:12 BoogieIcfgContainer [2022-02-20 18:45:12,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:45:12,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:45:12,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:45:12,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:45:12,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:45:11" (1/3) ... [2022-02-20 18:45:12,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b444aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:45:12, skipping insertion in model container [2022-02-20 18:45:12,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:45:11" (2/3) ... [2022-02-20 18:45:12,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b444aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:45:12, skipping insertion in model container [2022-02-20 18:45:12,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:45:12" (3/3) ... [2022-02-20 18:45:12,534 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:45:12,538 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:45:12,538 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:45:12,577 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:45:12,581 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:45:12,581 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:45:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 161 states, 159 states have (on average 1.7044025157232705) internal successors, (271), 160 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call 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,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:45:12,602 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:12,603 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:12,603 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:12,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:12,606 INFO L85 PathProgramCache]: Analyzing trace with hash 293786216, now seen corresponding path program 1 times [2022-02-20 18:45:12,612 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:12,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654424833] [2022-02-20 18:45:12,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:12,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:12,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {164#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_6326~0 := 0;~__return_6404~0 := 0;~__return_6465~0 := 0;~__return_6532~0 := 0;~__return_6719~0 := 0; {164#true} is VALID [2022-02-20 18:45:12,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {164#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_~__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_~__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_~__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;~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; {164#true} is VALID [2022-02-20 18:45:12,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {164#true} assume 0 == ~r1~0 % 256; {164#true} is VALID [2022-02-20 18:45:12,888 INFO L290 TraceCheckUtils]: 3: Hoare triple {164#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {164#true} is VALID [2022-02-20 18:45:12,888 INFO L290 TraceCheckUtils]: 4: Hoare triple {164#true} assume ~id1~0 >= 0; {164#true} is VALID [2022-02-20 18:45:12,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {164#true} assume 0 == ~st1~0; {166#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:12,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {166#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:12,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {166#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {166#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:12,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {166#(<= ~st1~0 0)} assume ~id2~0 >= 0; {166#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:12,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#(<= ~st1~0 0)} assume 0 == ~st2~0; {167#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {167#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {167#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {167#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {167#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {167#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {167#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {167#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6326~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6326~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {168#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {168#(<= (+ ~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; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,904 INFO L290 TraceCheckUtils]: 32: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6404~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6404~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; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,906 INFO L290 TraceCheckUtils]: 37: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,906 INFO L290 TraceCheckUtils]: 38: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,907 INFO L290 TraceCheckUtils]: 39: Hoare triple {168#(<= (+ ~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; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,907 INFO L290 TraceCheckUtils]: 40: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,907 INFO L290 TraceCheckUtils]: 41: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {168#(<= (+ ~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; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,908 INFO L290 TraceCheckUtils]: 43: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {168#(<= (+ ~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; {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:12,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {168#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6719~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6719~0; {165#false} is VALID [2022-02-20 18:45:12,910 INFO L290 TraceCheckUtils]: 46: Hoare triple {165#false} 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; {165#false} is VALID [2022-02-20 18:45:12,910 INFO L290 TraceCheckUtils]: 47: Hoare triple {165#false} assume 0 == main_~assert__arg~2#1 % 256; {165#false} is VALID [2022-02-20 18:45:12,910 INFO L290 TraceCheckUtils]: 48: Hoare triple {165#false} assume !false; {165#false} is VALID [2022-02-20 18:45:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:45:12,912 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:12,912 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654424833] [2022-02-20 18:45:12,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654424833] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:12,912 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:12,913 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:45:12,914 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441846176] [2022-02-20 18:45:12,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:12,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:45:12,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:12,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:12,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:12,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:12,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:12,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:12,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:12,981 INFO L87 Difference]: Start difference. First operand has 161 states, 159 states have (on average 1.7044025157232705) internal successors, (271), 160 states have internal predecessors, (271), 0 states have call successors, (0), 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 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:14,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:14,119 INFO L93 Difference]: Finished difference Result 516 states and 834 transitions. [2022-02-20 18:45:14,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:45:14,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:45:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:14,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:14,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 834 transitions. [2022-02-20 18:45:14,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 834 transitions. [2022-02-20 18:45:14,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 834 transitions. [2022-02-20 18:45:14,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 834 edges. 834 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:14,727 INFO L225 Difference]: With dead ends: 516 [2022-02-20 18:45:14,727 INFO L226 Difference]: Without dead ends: 437 [2022-02-20 18:45:14,729 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:14,732 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 908 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 1286 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:14,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [908 Valid, 1286 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:14,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-02-20 18:45:14,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 255. [2022-02-20 18:45:14,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:14,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 437 states. Second operand has 255 states, 254 states have (on average 1.515748031496063) internal successors, (385), 254 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call 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:14,822 INFO L74 IsIncluded]: Start isIncluded. First operand 437 states. Second operand has 255 states, 254 states have (on average 1.515748031496063) internal successors, (385), 254 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call 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:14,823 INFO L87 Difference]: Start difference. First operand 437 states. Second operand has 255 states, 254 states have (on average 1.515748031496063) internal successors, (385), 254 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call 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:14,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:14,835 INFO L93 Difference]: Finished difference Result 437 states and 670 transitions. [2022-02-20 18:45:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 670 transitions. [2022-02-20 18:45:14,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:14,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:14,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 255 states, 254 states have (on average 1.515748031496063) internal successors, (385), 254 states have internal predecessors, (385), 0 states have call successors, (0), 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 437 states. [2022-02-20 18:45:14,839 INFO L87 Difference]: Start difference. First operand has 255 states, 254 states have (on average 1.515748031496063) internal successors, (385), 254 states have internal predecessors, (385), 0 states have call successors, (0), 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 437 states. [2022-02-20 18:45:14,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:14,851 INFO L93 Difference]: Finished difference Result 437 states and 670 transitions. [2022-02-20 18:45:14,851 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 670 transitions. [2022-02-20 18:45:14,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:14,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:14,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:14,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.515748031496063) internal successors, (385), 254 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call 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:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 385 transitions. [2022-02-20 18:45:14,860 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 385 transitions. Word has length 49 [2022-02-20 18:45:14,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:14,861 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 385 transitions. [2022-02-20 18:45:14,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:14,861 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 385 transitions. [2022-02-20 18:45:14,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:45:14,862 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:14,862 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:14,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:45:14,863 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:14,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:14,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1697275801, now seen corresponding path program 1 times [2022-02-20 18:45:14,863 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:14,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272858208] [2022-02-20 18:45:14,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:14,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:14,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {2069#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_6326~0 := 0;~__return_6404~0 := 0;~__return_6465~0 := 0;~__return_6532~0 := 0;~__return_6719~0 := 0; {2069#true} is VALID [2022-02-20 18:45:14,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {2069#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_~__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_~__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_~__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;~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; {2069#true} is VALID [2022-02-20 18:45:14,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {2069#true} assume 0 == ~r1~0 % 256; {2069#true} is VALID [2022-02-20 18:45:14,948 INFO L290 TraceCheckUtils]: 3: Hoare triple {2069#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {2069#true} is VALID [2022-02-20 18:45:14,948 INFO L290 TraceCheckUtils]: 4: Hoare triple {2069#true} assume ~id1~0 >= 0; {2069#true} is VALID [2022-02-20 18:45:14,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {2069#true} assume 0 == ~st1~0; {2069#true} is VALID [2022-02-20 18:45:14,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {2069#true} assume ~send1~0 == ~id1~0; {2069#true} is VALID [2022-02-20 18:45:14,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {2069#true} assume 0 == ~mode1~0 % 256; {2069#true} is VALID [2022-02-20 18:45:14,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {2069#true} assume ~id2~0 >= 0; {2069#true} is VALID [2022-02-20 18:45:14,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {2069#true} assume 0 == ~st2~0; {2069#true} is VALID [2022-02-20 18:45:14,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {2069#true} assume ~send2~0 == ~id2~0; {2069#true} is VALID [2022-02-20 18:45:14,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {2069#true} assume 0 == ~mode2~0 % 256; {2069#true} is VALID [2022-02-20 18:45:14,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {2069#true} assume ~id3~0 >= 0; {2069#true} is VALID [2022-02-20 18:45:14,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {2069#true} assume 0 == ~st3~0; {2069#true} is VALID [2022-02-20 18:45:14,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {2069#true} assume ~send3~0 == ~id3~0; {2069#true} is VALID [2022-02-20 18:45:14,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {2069#true} assume 0 == ~mode3~0 % 256; {2069#true} is VALID [2022-02-20 18:45:14,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {2069#true} assume ~id1~0 != ~id2~0; {2069#true} is VALID [2022-02-20 18:45:14,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {2069#true} assume ~id1~0 != ~id3~0; {2069#true} is VALID [2022-02-20 18:45:14,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {2069#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6326~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6326~0; {2069#true} is VALID [2022-02-20 18:45:14,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {2069#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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2069#true} is VALID [2022-02-20 18:45:14,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {2069#true} assume !!(0 == ~mode1~0 % 256); {2069#true} is VALID [2022-02-20 18:45:14,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {2069#true} assume !!(0 == ~alive1~0 % 256); {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:14,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send1~0 != ~id1~0); {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:14,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:14,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode2~0 % 256); {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:14,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~alive2~0 % 256); {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:14,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send2~0 != ~id2~0); {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:14,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:14,960 INFO L290 TraceCheckUtils]: 28: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode3~0 % 256); {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:14,960 INFO L290 TraceCheckUtils]: 29: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~alive3~0 % 256); {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:14,961 INFO L290 TraceCheckUtils]: 30: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send3~0 != ~id3~0); {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:14,961 INFO L290 TraceCheckUtils]: 31: Hoare triple {2071#(= (+ ~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; {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:14,962 INFO L290 TraceCheckUtils]: 32: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:14,963 INFO L290 TraceCheckUtils]: 33: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6404~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6404~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; {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:14,963 INFO L290 TraceCheckUtils]: 34: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:14,964 INFO L290 TraceCheckUtils]: 35: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~mode1~0 % 256); {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:14,964 INFO L290 TraceCheckUtils]: 36: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:14,965 INFO L290 TraceCheckUtils]: 37: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:45:14,965 INFO L290 TraceCheckUtils]: 38: Hoare triple {2071#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~alive1~0 % 256); {2070#false} is VALID [2022-02-20 18:45:14,966 INFO L290 TraceCheckUtils]: 39: Hoare triple {2070#false} assume !(main_~node1__m1~1#1 > ~id1~0); {2070#false} is VALID [2022-02-20 18:45:14,966 INFO L290 TraceCheckUtils]: 40: Hoare triple {2070#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {2070#false} is VALID [2022-02-20 18:45:14,966 INFO L290 TraceCheckUtils]: 41: Hoare triple {2070#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {2070#false} is VALID [2022-02-20 18:45:14,966 INFO L290 TraceCheckUtils]: 42: Hoare triple {2070#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2070#false} is VALID [2022-02-20 18:45:14,966 INFO L290 TraceCheckUtils]: 43: Hoare triple {2070#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {2070#false} is VALID [2022-02-20 18:45:14,966 INFO L290 TraceCheckUtils]: 44: Hoare triple {2070#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {2070#false} is VALID [2022-02-20 18:45:14,967 INFO L290 TraceCheckUtils]: 45: Hoare triple {2070#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2070#false} is VALID [2022-02-20 18:45:14,967 INFO L290 TraceCheckUtils]: 46: Hoare triple {2070#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {2070#false} is VALID [2022-02-20 18:45:14,967 INFO L290 TraceCheckUtils]: 47: Hoare triple {2070#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; {2070#false} is VALID [2022-02-20 18:45:14,967 INFO L290 TraceCheckUtils]: 48: Hoare triple {2070#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6719~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6719~0; {2070#false} is VALID [2022-02-20 18:45:14,967 INFO L290 TraceCheckUtils]: 49: Hoare triple {2070#false} 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; {2070#false} is VALID [2022-02-20 18:45:14,967 INFO L290 TraceCheckUtils]: 50: Hoare triple {2070#false} assume 0 == main_~assert__arg~2#1 % 256; {2070#false} is VALID [2022-02-20 18:45:14,968 INFO L290 TraceCheckUtils]: 51: Hoare triple {2070#false} assume !false; {2070#false} is VALID [2022-02-20 18:45:14,968 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:14,968 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:14,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272858208] [2022-02-20 18:45:14,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272858208] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:14,969 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:14,969 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:45:14,969 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813059495] [2022-02-20 18:45:14,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:14,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:45:14,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:14,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:14,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:14,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:45:14,999 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:15,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:45:15,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:45:15,000 INFO L87 Difference]: Start difference. First operand 255 states and 385 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:15,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:15,374 INFO L93 Difference]: Finished difference Result 627 states and 965 transitions. [2022-02-20 18:45:15,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:45:15,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:45:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:15,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2022-02-20 18:45:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2022-02-20 18:45:15,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 552 transitions. [2022-02-20 18:45:15,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 552 edges. 552 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:15,740 INFO L225 Difference]: With dead ends: 627 [2022-02-20 18:45:15,740 INFO L226 Difference]: Without dead ends: 429 [2022-02-20 18:45:15,741 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:15,742 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 160 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 422 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:15,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 422 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:15,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-02-20 18:45:15,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2022-02-20 18:45:15,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:15,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand has 427 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 426 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call 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,846 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand has 427 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 426 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call 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,847 INFO L87 Difference]: Start difference. First operand 429 states. Second operand has 427 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 426 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call 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,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:15,857 INFO L93 Difference]: Finished difference Result 429 states and 642 transitions. [2022-02-20 18:45:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 642 transitions. [2022-02-20 18:45:15,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:15,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:15,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 427 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 426 states have internal predecessors, (641), 0 states have call successors, (0), 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 429 states. [2022-02-20 18:45:15,867 INFO L87 Difference]: Start difference. First operand has 427 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 426 states have internal predecessors, (641), 0 states have call successors, (0), 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 429 states. [2022-02-20 18:45:15,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:15,881 INFO L93 Difference]: Finished difference Result 429 states and 642 transitions. [2022-02-20 18:45:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 642 transitions. [2022-02-20 18:45:15,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:15,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:15,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:15,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:15,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 426 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call 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,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 641 transitions. [2022-02-20 18:45:15,902 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 641 transitions. Word has length 52 [2022-02-20 18:45:15,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:15,904 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 641 transitions. [2022-02-20 18:45:15,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:15,905 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 641 transitions. [2022-02-20 18:45:15,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:45:15,907 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:15,907 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:15,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:45:15,907 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:15,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:15,908 INFO L85 PathProgramCache]: Analyzing trace with hash -195371450, now seen corresponding path program 1 times [2022-02-20 18:45:15,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:15,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118076622] [2022-02-20 18:45:15,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:15,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:15,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {4324#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_6326~0 := 0;~__return_6404~0 := 0;~__return_6465~0 := 0;~__return_6532~0 := 0;~__return_6719~0 := 0; {4324#true} is VALID [2022-02-20 18:45:15,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {4324#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_~__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_~__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_~__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;~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; {4324#true} is VALID [2022-02-20 18:45:15,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {4324#true} assume 0 == ~r1~0 % 256; {4324#true} is VALID [2022-02-20 18:45:15,995 INFO L290 TraceCheckUtils]: 3: Hoare triple {4324#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {4324#true} is VALID [2022-02-20 18:45:15,995 INFO L290 TraceCheckUtils]: 4: Hoare triple {4324#true} assume ~id1~0 >= 0; {4324#true} is VALID [2022-02-20 18:45:15,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {4324#true} assume 0 == ~st1~0; {4324#true} is VALID [2022-02-20 18:45:15,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {4324#true} assume ~send1~0 == ~id1~0; {4324#true} is VALID [2022-02-20 18:45:15,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {4324#true} assume 0 == ~mode1~0 % 256; {4324#true} is VALID [2022-02-20 18:45:15,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {4324#true} assume ~id2~0 >= 0; {4324#true} is VALID [2022-02-20 18:45:15,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {4324#true} assume 0 == ~st2~0; {4324#true} is VALID [2022-02-20 18:45:15,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {4324#true} assume ~send2~0 == ~id2~0; {4324#true} is VALID [2022-02-20 18:45:15,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {4324#true} assume 0 == ~mode2~0 % 256; {4324#true} is VALID [2022-02-20 18:45:15,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {4324#true} assume ~id3~0 >= 0; {4324#true} is VALID [2022-02-20 18:45:15,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {4324#true} assume 0 == ~st3~0; {4324#true} is VALID [2022-02-20 18:45:15,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {4324#true} assume ~send3~0 == ~id3~0; {4324#true} is VALID [2022-02-20 18:45:15,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {4324#true} assume 0 == ~mode3~0 % 256; {4324#true} is VALID [2022-02-20 18:45:15,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {4324#true} assume ~id1~0 != ~id2~0; {4324#true} is VALID [2022-02-20 18:45:15,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {4324#true} assume ~id1~0 != ~id3~0; {4324#true} is VALID [2022-02-20 18:45:15,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {4324#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6326~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6326~0; {4324#true} is VALID [2022-02-20 18:45:15,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {4324#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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4324#true} is VALID [2022-02-20 18:45:15,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {4324#true} assume !!(0 == ~mode1~0 % 256); {4324#true} is VALID [2022-02-20 18:45:15,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {4324#true} assume !!(0 == ~alive1~0 % 256); {4324#true} is VALID [2022-02-20 18:45:15,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {4324#true} assume !(~send1~0 != ~id1~0); {4324#true} is VALID [2022-02-20 18:45:15,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {4324#true} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {4324#true} is VALID [2022-02-20 18:45:15,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {4324#true} assume !!(0 == ~mode2~0 % 256); {4324#true} is VALID [2022-02-20 18:45:15,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {4324#true} assume !!(0 == ~alive2~0 % 256); {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:15,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(~send2~0 != ~id2~0); {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:15,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:16,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !!(0 == ~mode3~0 % 256); {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:16,000 INFO L290 TraceCheckUtils]: 29: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !!(0 == ~alive3~0 % 256); {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:16,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(~send3~0 != ~id3~0); {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:16,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {4326#(= (+ (* (- 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; {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:16,010 INFO L290 TraceCheckUtils]: 32: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:16,011 INFO L290 TraceCheckUtils]: 33: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6404~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6404~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; {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:16,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:16,012 INFO L290 TraceCheckUtils]: 35: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~mode1~0 % 256); {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:16,012 INFO L290 TraceCheckUtils]: 36: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:16,013 INFO L290 TraceCheckUtils]: 37: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:16,013 INFO L290 TraceCheckUtils]: 38: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:16,013 INFO L290 TraceCheckUtils]: 39: Hoare triple {4326#(= (+ (* (- 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; {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:16,014 INFO L290 TraceCheckUtils]: 40: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:45:16,014 INFO L290 TraceCheckUtils]: 41: Hoare triple {4326#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~alive2~0 % 256); {4325#false} is VALID [2022-02-20 18:45:16,014 INFO L290 TraceCheckUtils]: 42: Hoare triple {4325#false} assume !(main_~node2__m2~1#1 > ~id2~0); {4325#false} is VALID [2022-02-20 18:45:16,015 INFO L290 TraceCheckUtils]: 43: Hoare triple {4325#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {4325#false} is VALID [2022-02-20 18:45:16,015 INFO L290 TraceCheckUtils]: 44: Hoare triple {4325#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {4325#false} is VALID [2022-02-20 18:45:16,015 INFO L290 TraceCheckUtils]: 45: Hoare triple {4325#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4325#false} is VALID [2022-02-20 18:45:16,015 INFO L290 TraceCheckUtils]: 46: Hoare triple {4325#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {4325#false} is VALID [2022-02-20 18:45:16,015 INFO L290 TraceCheckUtils]: 47: Hoare triple {4325#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; {4325#false} is VALID [2022-02-20 18:45:16,017 INFO L290 TraceCheckUtils]: 48: Hoare triple {4325#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6719~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6719~0; {4325#false} is VALID [2022-02-20 18:45:16,017 INFO L290 TraceCheckUtils]: 49: Hoare triple {4325#false} 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; {4325#false} is VALID [2022-02-20 18:45:16,017 INFO L290 TraceCheckUtils]: 50: Hoare triple {4325#false} assume 0 == main_~assert__arg~2#1 % 256; {4325#false} is VALID [2022-02-20 18:45:16,017 INFO L290 TraceCheckUtils]: 51: Hoare triple {4325#false} assume !false; {4325#false} is VALID [2022-02-20 18:45:16,018 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:16,018 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:16,018 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118076622] [2022-02-20 18:45:16,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118076622] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:16,019 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:16,019 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:45:16,019 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587701720] [2022-02-20 18:45:16,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:16,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:45:16,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:16,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:16,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:16,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:45:16,050 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:16,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:45:16,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:45:16,051 INFO L87 Difference]: Start difference. First operand 427 states and 641 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:16,533 INFO L93 Difference]: Finished difference Result 1077 states and 1638 transitions. [2022-02-20 18:45:16,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:45:16,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:45:16,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:16,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:16,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 546 transitions. [2022-02-20 18:45:16,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:16,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 546 transitions. [2022-02-20 18:45:16,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 546 transitions. [2022-02-20 18:45:16,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 546 edges. 546 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:16,910 INFO L225 Difference]: With dead ends: 1077 [2022-02-20 18:45:16,910 INFO L226 Difference]: Without dead ends: 749 [2022-02-20 18:45:16,912 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:16,917 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 159 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 436 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:16,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 436 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:16,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2022-02-20 18:45:17,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 747. [2022-02-20 18:45:17,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:17,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 749 states. Second operand has 747 states, 746 states have (on average 1.4946380697050938) internal successors, (1115), 746 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call 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,132 INFO L74 IsIncluded]: Start isIncluded. First operand 749 states. Second operand has 747 states, 746 states have (on average 1.4946380697050938) internal successors, (1115), 746 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call 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,133 INFO L87 Difference]: Start difference. First operand 749 states. Second operand has 747 states, 746 states have (on average 1.4946380697050938) internal successors, (1115), 746 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call 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,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:17,151 INFO L93 Difference]: Finished difference Result 749 states and 1116 transitions. [2022-02-20 18:45:17,151 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1116 transitions. [2022-02-20 18:45:17,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:17,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:17,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 747 states, 746 states have (on average 1.4946380697050938) internal successors, (1115), 746 states have internal predecessors, (1115), 0 states have call successors, (0), 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 749 states. [2022-02-20 18:45:17,155 INFO L87 Difference]: Start difference. First operand has 747 states, 746 states have (on average 1.4946380697050938) internal successors, (1115), 746 states have internal predecessors, (1115), 0 states have call successors, (0), 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 749 states. [2022-02-20 18:45:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:17,173 INFO L93 Difference]: Finished difference Result 749 states and 1116 transitions. [2022-02-20 18:45:17,173 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1116 transitions. [2022-02-20 18:45:17,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:17,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:17,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:17,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 746 states have (on average 1.4946380697050938) internal successors, (1115), 746 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call 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,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1115 transitions. [2022-02-20 18:45:17,199 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1115 transitions. Word has length 52 [2022-02-20 18:45:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:17,200 INFO L470 AbstractCegarLoop]: Abstraction has 747 states and 1115 transitions. [2022-02-20 18:45:17,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1115 transitions. [2022-02-20 18:45:17,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:45:17,201 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:17,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:17,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:45:17,201 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:17,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:17,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1046972601, now seen corresponding path program 1 times [2022-02-20 18:45:17,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:17,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050298823] [2022-02-20 18:45:17,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:17,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:17,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {8257#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_6326~0 := 0;~__return_6404~0 := 0;~__return_6465~0 := 0;~__return_6532~0 := 0;~__return_6719~0 := 0; {8257#true} is VALID [2022-02-20 18:45:17,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {8257#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_~__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_~__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_~__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;~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; {8257#true} is VALID [2022-02-20 18:45:17,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {8257#true} assume 0 == ~r1~0 % 256; {8257#true} is VALID [2022-02-20 18:45:17,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {8257#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {8257#true} is VALID [2022-02-20 18:45:17,242 INFO L290 TraceCheckUtils]: 4: Hoare triple {8257#true} assume ~id1~0 >= 0; {8257#true} is VALID [2022-02-20 18:45:17,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {8257#true} assume 0 == ~st1~0; {8257#true} is VALID [2022-02-20 18:45:17,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {8257#true} assume ~send1~0 == ~id1~0; {8257#true} is VALID [2022-02-20 18:45:17,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {8257#true} assume 0 == ~mode1~0 % 256; {8257#true} is VALID [2022-02-20 18:45:17,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {8257#true} assume ~id2~0 >= 0; {8257#true} is VALID [2022-02-20 18:45:17,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {8257#true} assume 0 == ~st2~0; {8257#true} is VALID [2022-02-20 18:45:17,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {8257#true} assume ~send2~0 == ~id2~0; {8257#true} is VALID [2022-02-20 18:45:17,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {8257#true} assume 0 == ~mode2~0 % 256; {8257#true} is VALID [2022-02-20 18:45:17,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {8257#true} assume ~id3~0 >= 0; {8257#true} is VALID [2022-02-20 18:45:17,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {8257#true} assume 0 == ~st3~0; {8257#true} is VALID [2022-02-20 18:45:17,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {8257#true} assume ~send3~0 == ~id3~0; {8257#true} is VALID [2022-02-20 18:45:17,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {8257#true} assume 0 == ~mode3~0 % 256; {8257#true} is VALID [2022-02-20 18:45:17,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {8257#true} assume ~id1~0 != ~id2~0; {8257#true} is VALID [2022-02-20 18:45:17,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {8257#true} assume ~id1~0 != ~id3~0; {8257#true} is VALID [2022-02-20 18:45:17,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {8257#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6326~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6326~0; {8257#true} is VALID [2022-02-20 18:45:17,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {8257#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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {8257#true} is VALID [2022-02-20 18:45:17,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {8257#true} assume !!(0 == ~mode1~0 % 256); {8257#true} is VALID [2022-02-20 18:45:17,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {8257#true} assume !!(0 == ~alive1~0 % 256); {8257#true} is VALID [2022-02-20 18:45:17,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {8257#true} assume !(~send1~0 != ~id1~0); {8257#true} is VALID [2022-02-20 18:45:17,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {8257#true} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {8257#true} is VALID [2022-02-20 18:45:17,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {8257#true} assume !!(0 == ~mode2~0 % 256); {8257#true} is VALID [2022-02-20 18:45:17,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {8257#true} assume !!(0 == ~alive2~0 % 256); {8257#true} is VALID [2022-02-20 18:45:17,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {8257#true} assume !(~send2~0 != ~id2~0); {8257#true} is VALID [2022-02-20 18:45:17,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {8257#true} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {8257#true} is VALID [2022-02-20 18:45:17,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {8257#true} assume !!(0 == ~mode3~0 % 256); {8257#true} is VALID [2022-02-20 18:45:17,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {8257#true} assume !!(0 == ~alive3~0 % 256); {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:17,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(~send3~0 != ~id3~0); {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:17,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {8259#(= (+ (* (- 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; {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:17,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:17,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6404~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6404~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; {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:17,249 INFO L290 TraceCheckUtils]: 34: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:17,249 INFO L290 TraceCheckUtils]: 35: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode1~0 % 256); {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:17,250 INFO L290 TraceCheckUtils]: 36: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:17,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:17,250 INFO L290 TraceCheckUtils]: 38: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:17,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {8259#(= (+ (* (- 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; {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:17,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:17,252 INFO L290 TraceCheckUtils]: 41: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:17,260 INFO L290 TraceCheckUtils]: 42: Hoare triple {8259#(= (+ (* (- 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; {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:17,261 INFO L290 TraceCheckUtils]: 43: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:45:17,261 INFO L290 TraceCheckUtils]: 44: Hoare triple {8259#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~alive3~0 % 256); {8258#false} is VALID [2022-02-20 18:45:17,261 INFO L290 TraceCheckUtils]: 45: Hoare triple {8258#false} assume !(main_~node3__m3~1#1 > ~id3~0); {8258#false} is VALID [2022-02-20 18:45:17,261 INFO L290 TraceCheckUtils]: 46: Hoare triple {8258#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {8258#false} is VALID [2022-02-20 18:45:17,262 INFO L290 TraceCheckUtils]: 47: Hoare triple {8258#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; {8258#false} is VALID [2022-02-20 18:45:17,262 INFO L290 TraceCheckUtils]: 48: Hoare triple {8258#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6719~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6719~0; {8258#false} is VALID [2022-02-20 18:45:17,262 INFO L290 TraceCheckUtils]: 49: Hoare triple {8258#false} 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; {8258#false} is VALID [2022-02-20 18:45:17,262 INFO L290 TraceCheckUtils]: 50: Hoare triple {8258#false} assume 0 == main_~assert__arg~2#1 % 256; {8258#false} is VALID [2022-02-20 18:45:17,262 INFO L290 TraceCheckUtils]: 51: Hoare triple {8258#false} assume !false; {8258#false} is VALID [2022-02-20 18:45:17,263 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:17,263 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:17,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050298823] [2022-02-20 18:45:17,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050298823] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:17,263 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:17,263 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:45:17,263 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254766107] [2022-02-20 18:45:17,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:17,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:45:17,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:17,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:17,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:17,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:45:17,297 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:17,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:45:17,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:45:17,297 INFO L87 Difference]: Start difference. First operand 747 states and 1115 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:18,002 INFO L93 Difference]: Finished difference Result 1857 states and 2792 transitions. [2022-02-20 18:45:18,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:45:18,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:45:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:18,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2022-02-20 18:45:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2022-02-20 18:45:18,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 522 transitions. [2022-02-20 18:45:18,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 522 edges. 522 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:18,373 INFO L225 Difference]: With dead ends: 1857 [2022-02-20 18:45:18,373 INFO L226 Difference]: Without dead ends: 1293 [2022-02-20 18:45:18,374 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:18,375 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 146 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 436 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:18,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 436 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:18,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2022-02-20 18:45:18,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1291. [2022-02-20 18:45:18,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:18,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1293 states. Second operand has 1291 states, 1290 states have (on average 1.4751937984496124) internal successors, (1903), 1290 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call 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,723 INFO L74 IsIncluded]: Start isIncluded. First operand 1293 states. Second operand has 1291 states, 1290 states have (on average 1.4751937984496124) internal successors, (1903), 1290 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call 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,725 INFO L87 Difference]: Start difference. First operand 1293 states. Second operand has 1291 states, 1290 states have (on average 1.4751937984496124) internal successors, (1903), 1290 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call 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,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:18,775 INFO L93 Difference]: Finished difference Result 1293 states and 1904 transitions. [2022-02-20 18:45:18,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1904 transitions. [2022-02-20 18:45:18,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:18,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:18,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 1291 states, 1290 states have (on average 1.4751937984496124) internal successors, (1903), 1290 states have internal predecessors, (1903), 0 states have call successors, (0), 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 1293 states. [2022-02-20 18:45:18,781 INFO L87 Difference]: Start difference. First operand has 1291 states, 1290 states have (on average 1.4751937984496124) internal successors, (1903), 1290 states have internal predecessors, (1903), 0 states have call successors, (0), 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 1293 states. [2022-02-20 18:45:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:18,831 INFO L93 Difference]: Finished difference Result 1293 states and 1904 transitions. [2022-02-20 18:45:18,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1904 transitions. [2022-02-20 18:45:18,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:18,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:18,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:18,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1290 states have (on average 1.4751937984496124) internal successors, (1903), 1290 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call 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,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1903 transitions. [2022-02-20 18:45:18,902 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1903 transitions. Word has length 52 [2022-02-20 18:45:18,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:18,902 INFO L470 AbstractCegarLoop]: Abstraction has 1291 states and 1903 transitions. [2022-02-20 18:45:18,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1903 transitions. [2022-02-20 18:45:18,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:45:18,903 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:18,903 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:18,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:45:18,904 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:18,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:18,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1633425885, now seen corresponding path program 1 times [2022-02-20 18:45:18,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:18,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066622920] [2022-02-20 18:45:18,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:18,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:18,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {15076#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_6326~0 := 0;~__return_6404~0 := 0;~__return_6465~0 := 0;~__return_6532~0 := 0;~__return_6719~0 := 0; {15076#true} is VALID [2022-02-20 18:45:18,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {15076#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_~__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_~__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_~__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;~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; {15076#true} is VALID [2022-02-20 18:45:18,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {15076#true} assume 0 == ~r1~0 % 256; {15076#true} is VALID [2022-02-20 18:45:18,979 INFO L290 TraceCheckUtils]: 3: Hoare triple {15076#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {15076#true} is VALID [2022-02-20 18:45:18,979 INFO L290 TraceCheckUtils]: 4: Hoare triple {15076#true} assume ~id1~0 >= 0; {15076#true} is VALID [2022-02-20 18:45:18,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {15076#true} assume 0 == ~st1~0; {15076#true} is VALID [2022-02-20 18:45:18,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {15076#true} assume ~send1~0 == ~id1~0; {15076#true} is VALID [2022-02-20 18:45:18,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {15076#true} assume 0 == ~mode1~0 % 256; {15076#true} is VALID [2022-02-20 18:45:18,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {15076#true} assume ~id2~0 >= 0; {15076#true} is VALID [2022-02-20 18:45:18,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {15076#true} assume 0 == ~st2~0; {15078#(<= ~st2~0 0)} is VALID [2022-02-20 18:45:18,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {15078#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {15078#(<= ~st2~0 0)} is VALID [2022-02-20 18:45:18,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {15078#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {15078#(<= ~st2~0 0)} is VALID [2022-02-20 18:45:18,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {15078#(<= ~st2~0 0)} assume ~id3~0 >= 0; {15078#(<= ~st2~0 0)} is VALID [2022-02-20 18:45:18,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {15078#(<= ~st2~0 0)} assume 0 == ~st3~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6326~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6326~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {15079#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {15079#(<= (+ ~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); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~alive2~0 % 256); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send2~0 != ~id2~0); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,987 INFO L290 TraceCheckUtils]: 30: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~alive3~0 % 256); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send3~0 != ~id3~0); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {15079#(<= (+ ~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; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,988 INFO L290 TraceCheckUtils]: 33: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,988 INFO L290 TraceCheckUtils]: 34: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6404~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6404~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; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,988 INFO L290 TraceCheckUtils]: 35: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,988 INFO L290 TraceCheckUtils]: 36: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~mode1~0 % 256); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,989 INFO L290 TraceCheckUtils]: 37: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,989 INFO L290 TraceCheckUtils]: 38: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,989 INFO L290 TraceCheckUtils]: 39: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~alive1~0 % 256); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,990 INFO L290 TraceCheckUtils]: 40: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~1#1 > ~id1~0); {15079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:45:18,990 INFO L290 TraceCheckUtils]: 41: Hoare triple {15079#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {15080#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:45:18,991 INFO L290 TraceCheckUtils]: 42: Hoare triple {15080#(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; {15080#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:45:18,999 INFO L290 TraceCheckUtils]: 43: Hoare triple {15080#(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; {15080#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:45:19,001 INFO L290 TraceCheckUtils]: 44: Hoare triple {15080#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {15080#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:45:19,002 INFO L290 TraceCheckUtils]: 45: Hoare triple {15080#(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; {15080#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:45:19,002 INFO L290 TraceCheckUtils]: 46: Hoare triple {15080#(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; {15080#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:45:19,002 INFO L290 TraceCheckUtils]: 47: Hoare triple {15080#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {15080#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:45:19,005 INFO L290 TraceCheckUtils]: 48: Hoare triple {15080#(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; {15080#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:45:19,006 INFO L290 TraceCheckUtils]: 49: Hoare triple {15080#(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_6719~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6719~0; {15077#false} is VALID [2022-02-20 18:45:19,007 INFO L290 TraceCheckUtils]: 50: Hoare triple {15077#false} 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; {15077#false} is VALID [2022-02-20 18:45:19,008 INFO L290 TraceCheckUtils]: 51: Hoare triple {15077#false} assume 0 == main_~assert__arg~2#1 % 256; {15077#false} is VALID [2022-02-20 18:45:19,008 INFO L290 TraceCheckUtils]: 52: Hoare triple {15077#false} assume !false; {15077#false} is VALID [2022-02-20 18:45:19,009 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:19,010 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:19,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066622920] [2022-02-20 18:45:19,010 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066622920] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:19,010 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:19,010 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:45:19,010 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063146540] [2022-02-20 18:45:19,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:19,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:19,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:19,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:19,040 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:19,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:19,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:19,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:19,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:19,042 INFO L87 Difference]: Start difference. First operand 1291 states and 1903 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:20,643 INFO L93 Difference]: Finished difference Result 2511 states and 3768 transitions. [2022-02-20 18:45:20,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:45:20,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:20,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:20,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 771 transitions. [2022-02-20 18:45:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 771 transitions. [2022-02-20 18:45:20,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 771 transitions. [2022-02-20 18:45:21,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 771 edges. 771 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:21,267 INFO L225 Difference]: With dead ends: 2511 [2022-02-20 18:45:21,267 INFO L226 Difference]: Without dead ends: 2145 [2022-02-20 18:45:21,268 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:21,268 INFO L933 BasicCegarLoop]: 448 mSDtfsCounter, 643 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:21,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [643 Valid, 1065 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:45:21,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2022-02-20 18:45:21,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 1740. [2022-02-20 18:45:21,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:21,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2145 states. Second operand has 1740 states, 1739 states have (on average 1.4836112708453133) internal successors, (2580), 1739 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call 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:21,986 INFO L74 IsIncluded]: Start isIncluded. First operand 2145 states. Second operand has 1740 states, 1739 states have (on average 1.4836112708453133) internal successors, (2580), 1739 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call 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:21,988 INFO L87 Difference]: Start difference. First operand 2145 states. Second operand has 1740 states, 1739 states have (on average 1.4836112708453133) internal successors, (2580), 1739 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call 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:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:22,153 INFO L93 Difference]: Finished difference Result 2145 states and 3195 transitions. [2022-02-20 18:45:22,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3195 transitions. [2022-02-20 18:45:22,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:22,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:22,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 1740 states, 1739 states have (on average 1.4836112708453133) internal successors, (2580), 1739 states have internal predecessors, (2580), 0 states have call successors, (0), 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 2145 states. [2022-02-20 18:45:22,171 INFO L87 Difference]: Start difference. First operand has 1740 states, 1739 states have (on average 1.4836112708453133) internal successors, (2580), 1739 states have internal predecessors, (2580), 0 states have call successors, (0), 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 2145 states. [2022-02-20 18:45:22,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:22,302 INFO L93 Difference]: Finished difference Result 2145 states and 3195 transitions. [2022-02-20 18:45:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3195 transitions. [2022-02-20 18:45:22,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:22,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:22,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:22,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1739 states have (on average 1.4836112708453133) internal successors, (2580), 1739 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call 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:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2580 transitions. [2022-02-20 18:45:22,425 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2580 transitions. Word has length 53 [2022-02-20 18:45:22,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:22,425 INFO L470 AbstractCegarLoop]: Abstraction has 1740 states and 2580 transitions. [2022-02-20 18:45:22,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:22,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2580 transitions. [2022-02-20 18:45:22,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:45:22,426 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:22,426 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:22,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:45:22,427 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:22,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:22,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1286312845, now seen corresponding path program 1 times [2022-02-20 18:45:22,428 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:22,428 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705425251] [2022-02-20 18:45:22,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:22,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:22,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {25153#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_6326~0 := 0;~__return_6404~0 := 0;~__return_6465~0 := 0;~__return_6532~0 := 0;~__return_6719~0 := 0; {25153#true} is VALID [2022-02-20 18:45:22,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {25153#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_~__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_~__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_~__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;~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; {25153#true} is VALID [2022-02-20 18:45:22,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {25153#true} assume 0 == ~r1~0 % 256; {25153#true} is VALID [2022-02-20 18:45:22,507 INFO L290 TraceCheckUtils]: 3: Hoare triple {25153#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {25153#true} is VALID [2022-02-20 18:45:22,507 INFO L290 TraceCheckUtils]: 4: Hoare triple {25153#true} assume ~id1~0 >= 0; {25153#true} is VALID [2022-02-20 18:45:22,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {25153#true} assume 0 == ~st1~0; {25155#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:22,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {25155#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {25155#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:22,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {25155#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {25155#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:22,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {25155#(<= ~st1~0 0)} assume ~id2~0 >= 0; {25155#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:22,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {25155#(<= ~st1~0 0)} assume 0 == ~st2~0; {25155#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:22,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {25155#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {25155#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:22,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {25155#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {25155#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:22,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {25155#(<= ~st1~0 0)} assume ~id3~0 >= 0; {25155#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:22,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {25155#(<= ~st1~0 0)} assume 0 == ~st3~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6326~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6326~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {25156#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {25156#(<= (+ ~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); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {25156#(<= (+ ~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; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,517 INFO L290 TraceCheckUtils]: 34: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6404~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6404~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; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,517 INFO L290 TraceCheckUtils]: 35: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,517 INFO L290 TraceCheckUtils]: 36: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,518 INFO L290 TraceCheckUtils]: 37: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,518 INFO L290 TraceCheckUtils]: 38: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,518 INFO L290 TraceCheckUtils]: 39: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,518 INFO L290 TraceCheckUtils]: 40: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,519 INFO L290 TraceCheckUtils]: 41: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,519 INFO L290 TraceCheckUtils]: 42: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~alive2~0 % 256); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,519 INFO L290 TraceCheckUtils]: 43: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 > ~id2~0); {25156#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:22,520 INFO L290 TraceCheckUtils]: 44: Hoare triple {25156#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {25157#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:45:22,520 INFO L290 TraceCheckUtils]: 45: Hoare triple {25157#(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; {25157#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:45:22,520 INFO L290 TraceCheckUtils]: 46: Hoare triple {25157#(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; {25157#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:45:22,521 INFO L290 TraceCheckUtils]: 47: Hoare triple {25157#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {25157#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:45:22,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {25157#(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; {25157#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:45:22,523 INFO L290 TraceCheckUtils]: 49: Hoare triple {25157#(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_6719~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6719~0; {25154#false} is VALID [2022-02-20 18:45:22,523 INFO L290 TraceCheckUtils]: 50: Hoare triple {25154#false} 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; {25154#false} is VALID [2022-02-20 18:45:22,523 INFO L290 TraceCheckUtils]: 51: Hoare triple {25154#false} assume 0 == main_~assert__arg~2#1 % 256; {25154#false} is VALID [2022-02-20 18:45:22,523 INFO L290 TraceCheckUtils]: 52: Hoare triple {25154#false} assume !false; {25154#false} is VALID [2022-02-20 18:45:22,525 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:22,525 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:22,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705425251] [2022-02-20 18:45:22,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705425251] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:22,525 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:22,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:45:22,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753527842] [2022-02-20 18:45:22,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:22,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:22,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:22,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:22,553 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:22,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:22,553 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:22,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:22,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:22,555 INFO L87 Difference]: Start difference. First operand 1740 states and 2580 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:24,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:24,663 INFO L93 Difference]: Finished difference Result 2960 states and 4445 transitions. [2022-02-20 18:45:24,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:45:24,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:24,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:24,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:24,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 771 transitions. [2022-02-20 18:45:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:24,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 771 transitions. [2022-02-20 18:45:24,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 771 transitions. [2022-02-20 18:45:25,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 771 edges. 771 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:25,336 INFO L225 Difference]: With dead ends: 2960 [2022-02-20 18:45:25,336 INFO L226 Difference]: Without dead ends: 2594 [2022-02-20 18:45:25,337 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:25,337 INFO L933 BasicCegarLoop]: 402 mSDtfsCounter, 630 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:25,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 1040 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:45:25,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2022-02-20 18:45:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 2085. [2022-02-20 18:45:26,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:26,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2594 states. Second operand has 2085 states, 2084 states have (on average 1.4889635316698657) internal successors, (3103), 2084 states have internal predecessors, (3103), 0 states have call successors, (0), 0 states have call 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:26,468 INFO L74 IsIncluded]: Start isIncluded. First operand 2594 states. Second operand has 2085 states, 2084 states have (on average 1.4889635316698657) internal successors, (3103), 2084 states have internal predecessors, (3103), 0 states have call successors, (0), 0 states have call 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:26,469 INFO L87 Difference]: Start difference. First operand 2594 states. Second operand has 2085 states, 2084 states have (on average 1.4889635316698657) internal successors, (3103), 2084 states have internal predecessors, (3103), 0 states have call successors, (0), 0 states have call 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:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:26,650 INFO L93 Difference]: Finished difference Result 2594 states and 3872 transitions. [2022-02-20 18:45:26,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3872 transitions. [2022-02-20 18:45:26,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:26,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:26,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 2085 states, 2084 states have (on average 1.4889635316698657) internal successors, (3103), 2084 states have internal predecessors, (3103), 0 states have call successors, (0), 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 2594 states. [2022-02-20 18:45:26,657 INFO L87 Difference]: Start difference. First operand has 2085 states, 2084 states have (on average 1.4889635316698657) internal successors, (3103), 2084 states have internal predecessors, (3103), 0 states have call successors, (0), 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 2594 states. [2022-02-20 18:45:26,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:26,831 INFO L93 Difference]: Finished difference Result 2594 states and 3872 transitions. [2022-02-20 18:45:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3872 transitions. [2022-02-20 18:45:26,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:26,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:26,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:26,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:26,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 2084 states have (on average 1.4889635316698657) internal successors, (3103), 2084 states have internal predecessors, (3103), 0 states have call successors, (0), 0 states have call 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:26,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 3103 transitions. [2022-02-20 18:45:26,998 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 3103 transitions. Word has length 53 [2022-02-20 18:45:26,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:26,998 INFO L470 AbstractCegarLoop]: Abstraction has 2085 states and 3103 transitions. [2022-02-20 18:45:26,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 3103 transitions. [2022-02-20 18:45:26,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:45:26,999 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:26,999 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:26,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:45:26,999 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:27,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1015763425, now seen corresponding path program 1 times [2022-02-20 18:45:27,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:27,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337074225] [2022-02-20 18:45:27,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:27,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:27,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {37230#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_6326~0 := 0;~__return_6404~0 := 0;~__return_6465~0 := 0;~__return_6532~0 := 0;~__return_6719~0 := 0; {37230#true} is VALID [2022-02-20 18:45:27,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {37230#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_~__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_~__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_~__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;~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; {37230#true} is VALID [2022-02-20 18:45:27,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {37230#true} assume 0 == ~r1~0 % 256; {37230#true} is VALID [2022-02-20 18:45:27,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {37230#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {37230#true} is VALID [2022-02-20 18:45:27,084 INFO L290 TraceCheckUtils]: 4: Hoare triple {37230#true} assume ~id1~0 >= 0; {37230#true} is VALID [2022-02-20 18:45:27,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {37230#true} assume 0 == ~st1~0; {37232#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:27,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {37232#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {37232#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:27,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {37232#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {37232#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:27,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {37232#(<= ~st1~0 0)} assume ~id2~0 >= 0; {37232#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:27,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {37232#(<= ~st1~0 0)} assume 0 == ~st2~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6326~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6326~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {37233#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,097 INFO L290 TraceCheckUtils]: 30: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,097 INFO L290 TraceCheckUtils]: 31: Hoare triple {37233#(<= (+ ~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); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,097 INFO L290 TraceCheckUtils]: 32: Hoare triple {37233#(<= (+ ~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; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6404~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6404~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; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,098 INFO L290 TraceCheckUtils]: 35: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,098 INFO L290 TraceCheckUtils]: 36: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,099 INFO L290 TraceCheckUtils]: 37: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,099 INFO L290 TraceCheckUtils]: 39: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,100 INFO L290 TraceCheckUtils]: 41: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,100 INFO L290 TraceCheckUtils]: 42: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,101 INFO L290 TraceCheckUtils]: 43: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,101 INFO L290 TraceCheckUtils]: 44: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,101 INFO L290 TraceCheckUtils]: 45: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~alive3~0 % 256); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 > ~id3~0); {37233#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:27,102 INFO L290 TraceCheckUtils]: 47: Hoare triple {37233#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {37234#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:45:27,102 INFO L290 TraceCheckUtils]: 48: Hoare triple {37234#(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; {37234#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:45:27,103 INFO L290 TraceCheckUtils]: 49: Hoare triple {37234#(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_6719~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6719~0; {37231#false} is VALID [2022-02-20 18:45:27,103 INFO L290 TraceCheckUtils]: 50: Hoare triple {37231#false} 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; {37231#false} is VALID [2022-02-20 18:45:27,103 INFO L290 TraceCheckUtils]: 51: Hoare triple {37231#false} assume 0 == main_~assert__arg~2#1 % 256; {37231#false} is VALID [2022-02-20 18:45:27,103 INFO L290 TraceCheckUtils]: 52: Hoare triple {37231#false} assume !false; {37231#false} is VALID [2022-02-20 18:45:27,104 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:27,104 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:27,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337074225] [2022-02-20 18:45:27,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337074225] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:27,105 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:27,105 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:45:27,105 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941445917] [2022-02-20 18:45:27,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:27,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:27,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:27,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:27,134 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:27,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:27,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:27,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:27,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:27,135 INFO L87 Difference]: Start difference. First operand 2085 states and 3103 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:29,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:29,524 INFO L93 Difference]: Finished difference Result 3359 states and 5045 transitions. [2022-02-20 18:45:29,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:45:29,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:29,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 771 transitions. [2022-02-20 18:45:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 771 transitions. [2022-02-20 18:45:29,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 771 transitions. [2022-02-20 18:45:29,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 771 edges. 771 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:30,281 INFO L225 Difference]: With dead ends: 3359 [2022-02-20 18:45:30,281 INFO L226 Difference]: Without dead ends: 2993 [2022-02-20 18:45:30,282 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:30,283 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 636 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1068 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:30,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [636 Valid, 1068 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:30,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2022-02-20 18:45:31,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 2375. [2022-02-20 18:45:31,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:31,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2993 states. Second operand has 2375 states, 2374 states have (on average 1.4928390901432183) internal successors, (3544), 2374 states have internal predecessors, (3544), 0 states have call successors, (0), 0 states have call 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:31,500 INFO L74 IsIncluded]: Start isIncluded. First operand 2993 states. Second operand has 2375 states, 2374 states have (on average 1.4928390901432183) internal successors, (3544), 2374 states have internal predecessors, (3544), 0 states have call successors, (0), 0 states have call 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:31,502 INFO L87 Difference]: Start difference. First operand 2993 states. Second operand has 2375 states, 2374 states have (on average 1.4928390901432183) internal successors, (3544), 2374 states have internal predecessors, (3544), 0 states have call successors, (0), 0 states have call 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:31,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:31,737 INFO L93 Difference]: Finished difference Result 2993 states and 4472 transitions. [2022-02-20 18:45:31,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4472 transitions. [2022-02-20 18:45:31,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:31,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:31,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 2375 states, 2374 states have (on average 1.4928390901432183) internal successors, (3544), 2374 states have internal predecessors, (3544), 0 states have call successors, (0), 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 2993 states. [2022-02-20 18:45:31,744 INFO L87 Difference]: Start difference. First operand has 2375 states, 2374 states have (on average 1.4928390901432183) internal successors, (3544), 2374 states have internal predecessors, (3544), 0 states have call successors, (0), 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 2993 states. [2022-02-20 18:45:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:31,969 INFO L93 Difference]: Finished difference Result 2993 states and 4472 transitions. [2022-02-20 18:45:31,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4472 transitions. [2022-02-20 18:45:31,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:31,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:31,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:31,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2374 states have (on average 1.4928390901432183) internal successors, (3544), 2374 states have internal predecessors, (3544), 0 states have call successors, (0), 0 states have call 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:32,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 3544 transitions. [2022-02-20 18:45:32,192 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 3544 transitions. Word has length 53 [2022-02-20 18:45:32,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:32,192 INFO L470 AbstractCegarLoop]: Abstraction has 2375 states and 3544 transitions. [2022-02-20 18:45:32,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:32,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3544 transitions. [2022-02-20 18:45:32,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:45:32,193 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:32,193 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:32,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:45:32,194 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:32,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:32,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1968890954, now seen corresponding path program 1 times [2022-02-20 18:45:32,194 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:32,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078157133] [2022-02-20 18:45:32,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:32,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:32,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {51062#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_6326~0 := 0;~__return_6404~0 := 0;~__return_6465~0 := 0;~__return_6532~0 := 0;~__return_6719~0 := 0; {51064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:32,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {51064#(<= (+ ~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_~__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_~__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_~__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;~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; {51064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:32,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {51064#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {51064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:32,264 INFO L290 TraceCheckUtils]: 3: Hoare triple {51064#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {51064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:32,264 INFO L290 TraceCheckUtils]: 4: Hoare triple {51064#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {51065#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:32,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {51065#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {51065#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:32,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {51065#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:32,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:32,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:32,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:32,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:32,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:32,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:32,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:32,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:32,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:32,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:32,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:32,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6326~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6326~0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:32,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {51066#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:32,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256); {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:32,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {51066#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:32,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {51066#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {51063#false} is VALID [2022-02-20 18:45:32,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {51063#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); {51063#false} is VALID [2022-02-20 18:45:32,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {51063#false} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {51063#false} is VALID [2022-02-20 18:45:32,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {51063#false} assume !!(0 == ~mode2~0 % 256); {51063#false} is VALID [2022-02-20 18:45:32,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {51063#false} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {51063#false} is VALID [2022-02-20 18:45:32,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {51063#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {51063#false} is VALID [2022-02-20 18:45:32,270 INFO L290 TraceCheckUtils]: 28: Hoare triple {51063#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); {51063#false} is VALID [2022-02-20 18:45:32,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {51063#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {51063#false} is VALID [2022-02-20 18:45:32,270 INFO L290 TraceCheckUtils]: 30: Hoare triple {51063#false} assume !!(0 == ~mode3~0 % 256); {51063#false} is VALID [2022-02-20 18:45:32,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {51063#false} assume !!(0 == ~alive3~0 % 256); {51063#false} is VALID [2022-02-20 18:45:32,274 INFO L290 TraceCheckUtils]: 32: Hoare triple {51063#false} assume !(~send3~0 != ~id3~0); {51063#false} is VALID [2022-02-20 18:45:32,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {51063#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; {51063#false} is VALID [2022-02-20 18:45:32,275 INFO L290 TraceCheckUtils]: 34: Hoare triple {51063#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {51063#false} is VALID [2022-02-20 18:45:32,275 INFO L290 TraceCheckUtils]: 35: Hoare triple {51063#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6404~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6404~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; {51063#false} is VALID [2022-02-20 18:45:32,275 INFO L290 TraceCheckUtils]: 36: Hoare triple {51063#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {51063#false} is VALID [2022-02-20 18:45:32,275 INFO L290 TraceCheckUtils]: 37: Hoare triple {51063#false} assume !(0 == ~mode1~0 % 256); {51063#false} is VALID [2022-02-20 18:45:32,275 INFO L290 TraceCheckUtils]: 38: Hoare triple {51063#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {51063#false} is VALID [2022-02-20 18:45:32,275 INFO L290 TraceCheckUtils]: 39: Hoare triple {51063#false} assume main_~node1__m1~1#1 != ~nomsg~0; {51063#false} is VALID [2022-02-20 18:45:32,275 INFO L290 TraceCheckUtils]: 40: Hoare triple {51063#false} assume !(0 == ~alive1~0 % 256); {51063#false} is VALID [2022-02-20 18:45:32,275 INFO L290 TraceCheckUtils]: 41: Hoare triple {51063#false} assume !(main_~node1__m1~1#1 > ~id1~0); {51063#false} is VALID [2022-02-20 18:45:32,275 INFO L290 TraceCheckUtils]: 42: Hoare triple {51063#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {51063#false} is VALID [2022-02-20 18:45:32,276 INFO L290 TraceCheckUtils]: 43: Hoare triple {51063#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {51063#false} is VALID [2022-02-20 18:45:32,276 INFO L290 TraceCheckUtils]: 44: Hoare triple {51063#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {51063#false} is VALID [2022-02-20 18:45:32,276 INFO L290 TraceCheckUtils]: 45: Hoare triple {51063#false} assume main_~node2__m2~1#1 != ~nomsg~0; {51063#false} is VALID [2022-02-20 18:45:32,276 INFO L290 TraceCheckUtils]: 46: Hoare triple {51063#false} assume !(0 == ~alive2~0 % 256); {51063#false} is VALID [2022-02-20 18:45:32,276 INFO L290 TraceCheckUtils]: 47: Hoare triple {51063#false} assume !(main_~node2__m2~1#1 > ~id2~0); {51063#false} is VALID [2022-02-20 18:45:32,276 INFO L290 TraceCheckUtils]: 48: Hoare triple {51063#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {51063#false} is VALID [2022-02-20 18:45:32,276 INFO L290 TraceCheckUtils]: 49: Hoare triple {51063#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {51063#false} is VALID [2022-02-20 18:45:32,276 INFO L290 TraceCheckUtils]: 50: Hoare triple {51063#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {51063#false} is VALID [2022-02-20 18:45:32,277 INFO L290 TraceCheckUtils]: 51: Hoare triple {51063#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {51063#false} is VALID [2022-02-20 18:45:32,277 INFO L290 TraceCheckUtils]: 52: Hoare triple {51063#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; {51063#false} is VALID [2022-02-20 18:45:32,277 INFO L290 TraceCheckUtils]: 53: Hoare triple {51063#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6719~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6719~0; {51063#false} is VALID [2022-02-20 18:45:32,277 INFO L290 TraceCheckUtils]: 54: Hoare triple {51063#false} 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; {51063#false} is VALID [2022-02-20 18:45:32,277 INFO L290 TraceCheckUtils]: 55: Hoare triple {51063#false} assume 0 == main_~assert__arg~2#1 % 256; {51063#false} is VALID [2022-02-20 18:45:32,277 INFO L290 TraceCheckUtils]: 56: Hoare triple {51063#false} assume !false; {51063#false} is VALID [2022-02-20 18:45:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:45:32,278 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:32,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078157133] [2022-02-20 18:45:32,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078157133] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:32,278 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:32,278 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:45:32,278 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005353279] [2022-02-20 18:45:32,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:32,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-20 18:45:32,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:32,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:32,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:32,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:32,315 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:32,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:32,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:32,316 INFO L87 Difference]: Start difference. First operand 2375 states and 3544 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18: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 5650 states and 8421 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,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-20 18:45:36,902 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.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-02-20 18:45:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-02-20 18:45:36,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 566 transitions. [2022-02-20 18:45:37,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 566 edges. 566 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:37,683 INFO L225 Difference]: With dead ends: 5650 [2022-02-20 18:45:37,683 INFO L226 Difference]: Without dead ends: 3302 [2022-02-20 18:45:37,685 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:37,686 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 896 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:37,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [896 Valid, 212 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:45:37,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2022-02-20 18:45:40,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 3275. [2022-02-20 18:45:40,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:40,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3302 states. Second operand has 3275 states, 3274 states have (on average 1.4706780696395847) internal successors, (4815), 3274 states have internal predecessors, (4815), 0 states have call successors, (0), 0 states have call 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:40,699 INFO L74 IsIncluded]: Start isIncluded. First operand 3302 states. Second operand has 3275 states, 3274 states have (on average 1.4706780696395847) internal successors, (4815), 3274 states have internal predecessors, (4815), 0 states have call successors, (0), 0 states have call 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:40,701 INFO L87 Difference]: Start difference. First operand 3302 states. Second operand has 3275 states, 3274 states have (on average 1.4706780696395847) internal successors, (4815), 3274 states have internal predecessors, (4815), 0 states have call successors, (0), 0 states have call 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:41,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:41,017 INFO L93 Difference]: Finished difference Result 3302 states and 4841 transitions. [2022-02-20 18:45:41,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 4841 transitions. [2022-02-20 18:45:41,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:41,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:41,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 3275 states, 3274 states have (on average 1.4706780696395847) internal successors, (4815), 3274 states have internal predecessors, (4815), 0 states have call successors, (0), 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 3302 states. [2022-02-20 18:45:41,025 INFO L87 Difference]: Start difference. First operand has 3275 states, 3274 states have (on average 1.4706780696395847) internal successors, (4815), 3274 states have internal predecessors, (4815), 0 states have call successors, (0), 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 3302 states. [2022-02-20 18:45:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:41,337 INFO L93 Difference]: Finished difference Result 3302 states and 4841 transitions. [2022-02-20 18:45:41,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 4841 transitions. [2022-02-20 18:45:41,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:41,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:41,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:41,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 3274 states have (on average 1.4706780696395847) internal successors, (4815), 3274 states have internal predecessors, (4815), 0 states have call successors, (0), 0 states have call 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:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 4815 transitions. [2022-02-20 18:45:41,797 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 4815 transitions. Word has length 57 [2022-02-20 18:45:41,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:41,797 INFO L470 AbstractCegarLoop]: Abstraction has 3275 states and 4815 transitions. [2022-02-20 18:45:41,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:41,798 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 4815 transitions. [2022-02-20 18:45:41,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:45:41,799 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:41,799 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:41,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:45:41,799 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:41,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:41,799 INFO L85 PathProgramCache]: Analyzing trace with hash -108107112, now seen corresponding path program 1 times [2022-02-20 18:45:41,800 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:41,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784953740] [2022-02-20 18:45:41,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:41,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:41,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {69874#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_6326~0 := 0;~__return_6404~0 := 0;~__return_6465~0 := 0;~__return_6532~0 := 0;~__return_6719~0 := 0; {69876#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:41,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {69876#(<= (+ ~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_~__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_~__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_~__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;~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; {69876#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:41,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {69876#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {69876#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:41,881 INFO L290 TraceCheckUtils]: 3: Hoare triple {69876#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {69876#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:41,882 INFO L290 TraceCheckUtils]: 4: Hoare triple {69876#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {69876#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:41,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {69876#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {69876#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:41,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {69876#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {69876#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:41,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {69876#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {69876#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:41,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {69876#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {69877#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:41,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {69877#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {69877#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:41,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {69877#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {69878#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:41,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {69878#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {69878#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:41,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {69878#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {69878#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:41,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {69878#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {69878#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:41,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {69878#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {69878#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:41,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {69878#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {69878#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:41,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {69878#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {69878#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:41,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {69878#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {69878#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:41,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {69878#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6326~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6326~0; {69878#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:41,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {69878#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {69878#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:41,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {69878#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {69878#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:41,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {69878#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256); {69878#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:41,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {69878#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send1~0 != ~id1~0); {69878#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:41,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {69878#(<= (+ ~nomsg~0 1) ~send2~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {69878#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:41,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {69878#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {69878#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:41,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {69878#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {69878#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:45:41,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {69878#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {69875#false} is VALID [2022-02-20 18:45:41,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {69875#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); {69875#false} is VALID [2022-02-20 18:45:41,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {69875#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {69875#false} is VALID [2022-02-20 18:45:41,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {69875#false} assume !!(0 == ~mode3~0 % 256); {69875#false} is VALID [2022-02-20 18:45:41,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {69875#false} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {69875#false} is VALID [2022-02-20 18:45:41,888 INFO L290 TraceCheckUtils]: 31: Hoare triple {69875#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {69875#false} is VALID [2022-02-20 18:45:41,888 INFO L290 TraceCheckUtils]: 32: Hoare triple {69875#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); {69875#false} is VALID [2022-02-20 18:45:41,888 INFO L290 TraceCheckUtils]: 33: Hoare triple {69875#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; {69875#false} is VALID [2022-02-20 18:45:41,888 INFO L290 TraceCheckUtils]: 34: Hoare triple {69875#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {69875#false} is VALID [2022-02-20 18:45:41,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {69875#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6404~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6404~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; {69875#false} is VALID [2022-02-20 18:45:41,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {69875#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {69875#false} is VALID [2022-02-20 18:45:41,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {69875#false} assume !(0 == ~mode1~0 % 256); {69875#false} is VALID [2022-02-20 18:45:41,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {69875#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {69875#false} is VALID [2022-02-20 18:45:41,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {69875#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {69875#false} is VALID [2022-02-20 18:45:41,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {69875#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {69875#false} is VALID [2022-02-20 18:45:41,889 INFO L290 TraceCheckUtils]: 41: Hoare triple {69875#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {69875#false} is VALID [2022-02-20 18:45:41,889 INFO L290 TraceCheckUtils]: 42: Hoare triple {69875#false} assume main_~node2__m2~1#1 != ~nomsg~0; {69875#false} is VALID [2022-02-20 18:45:41,889 INFO L290 TraceCheckUtils]: 43: Hoare triple {69875#false} assume !(0 == ~alive2~0 % 256); {69875#false} is VALID [2022-02-20 18:45:41,889 INFO L290 TraceCheckUtils]: 44: Hoare triple {69875#false} assume !(main_~node2__m2~1#1 > ~id2~0); {69875#false} is VALID [2022-02-20 18:45:41,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {69875#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {69875#false} is VALID [2022-02-20 18:45:41,889 INFO L290 TraceCheckUtils]: 46: Hoare triple {69875#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {69875#false} is VALID [2022-02-20 18:45:41,889 INFO L290 TraceCheckUtils]: 47: Hoare triple {69875#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {69875#false} is VALID [2022-02-20 18:45:41,889 INFO L290 TraceCheckUtils]: 48: Hoare triple {69875#false} assume main_~node3__m3~1#1 != ~nomsg~0; {69875#false} is VALID [2022-02-20 18:45:41,889 INFO L290 TraceCheckUtils]: 49: Hoare triple {69875#false} assume !(0 == ~alive3~0 % 256); {69875#false} is VALID [2022-02-20 18:45:41,889 INFO L290 TraceCheckUtils]: 50: Hoare triple {69875#false} assume !(main_~node3__m3~1#1 > ~id3~0); {69875#false} is VALID [2022-02-20 18:45:41,889 INFO L290 TraceCheckUtils]: 51: Hoare triple {69875#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {69875#false} is VALID [2022-02-20 18:45:41,889 INFO L290 TraceCheckUtils]: 52: Hoare triple {69875#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; {69875#false} is VALID [2022-02-20 18:45:41,889 INFO L290 TraceCheckUtils]: 53: Hoare triple {69875#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6719~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6719~0; {69875#false} is VALID [2022-02-20 18:45:41,889 INFO L290 TraceCheckUtils]: 54: Hoare triple {69875#false} 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; {69875#false} is VALID [2022-02-20 18:45:41,889 INFO L290 TraceCheckUtils]: 55: Hoare triple {69875#false} assume 0 == main_~assert__arg~2#1 % 256; {69875#false} is VALID [2022-02-20 18:45:41,889 INFO L290 TraceCheckUtils]: 56: Hoare triple {69875#false} assume !false; {69875#false} is VALID [2022-02-20 18:45:41,890 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:41,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:41,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784953740] [2022-02-20 18:45:41,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784953740] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:41,890 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:41,890 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:45:41,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581939728] [2022-02-20 18:45:41,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:41,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-20 18:45:41,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:41,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:41,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:41,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:41,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:41,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:41,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:41,922 INFO L87 Difference]: Start difference. First operand 3275 states and 4815 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:50,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:50,198 INFO L93 Difference]: Finished difference Result 7802 states and 11466 transitions. [2022-02-20 18:45:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:45:50,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-20 18:45:50,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:50,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 546 transitions. [2022-02-20 18:45:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 546 transitions. [2022-02-20 18:45:50,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 546 transitions. [2022-02-20 18:45:50,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 546 edges. 546 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:51,389 INFO L225 Difference]: With dead ends: 7802 [2022-02-20 18:45:51,389 INFO L226 Difference]: Without dead ends: 4572 [2022-02-20 18:45:51,392 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:51,392 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 884 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:51,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [884 Valid, 230 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:45:51,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4572 states. [2022-02-20 18:45:56,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4572 to 4547. [2022-02-20 18:45:56,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:56,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4572 states. Second operand has 4547 states, 4546 states have (on average 1.457765068191817) internal successors, (6627), 4546 states have internal predecessors, (6627), 0 states have call successors, (0), 0 states have call 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:56,826 INFO L74 IsIncluded]: Start isIncluded. First operand 4572 states. Second operand has 4547 states, 4546 states have (on average 1.457765068191817) internal successors, (6627), 4546 states have internal predecessors, (6627), 0 states have call successors, (0), 0 states have call 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:56,828 INFO L87 Difference]: Start difference. First operand 4572 states. Second operand has 4547 states, 4546 states have (on average 1.457765068191817) internal successors, (6627), 4546 states have internal predecessors, (6627), 0 states have call successors, (0), 0 states have call 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:57,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:57,378 INFO L93 Difference]: Finished difference Result 4572 states and 6651 transitions. [2022-02-20 18:45:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 4572 states and 6651 transitions. [2022-02-20 18:45:57,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:57,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:57,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 4547 states, 4546 states have (on average 1.457765068191817) internal successors, (6627), 4546 states have internal predecessors, (6627), 0 states have call successors, (0), 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 4572 states. [2022-02-20 18:45:57,389 INFO L87 Difference]: Start difference. First operand has 4547 states, 4546 states have (on average 1.457765068191817) internal successors, (6627), 4546 states have internal predecessors, (6627), 0 states have call successors, (0), 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 4572 states. [2022-02-20 18:45:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:57,940 INFO L93 Difference]: Finished difference Result 4572 states and 6651 transitions. [2022-02-20 18:45:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 4572 states and 6651 transitions. [2022-02-20 18:45:57,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:57,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:57,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:57,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4547 states, 4546 states have (on average 1.457765068191817) internal successors, (6627), 4546 states have internal predecessors, (6627), 0 states have call successors, (0), 0 states have call 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:58,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4547 states to 4547 states and 6627 transitions. [2022-02-20 18:45:58,763 INFO L78 Accepts]: Start accepts. Automaton has 4547 states and 6627 transitions. Word has length 57 [2022-02-20 18:45:58,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:58,763 INFO L470 AbstractCegarLoop]: Abstraction has 4547 states and 6627 transitions. [2022-02-20 18:45:58,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:58,764 INFO L276 IsEmpty]: Start isEmpty. Operand 4547 states and 6627 transitions. [2022-02-20 18:45:58,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:45:58,765 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:58,765 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:58,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:45:58,765 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:58,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:58,766 INFO L85 PathProgramCache]: Analyzing trace with hash 871846780, now seen corresponding path program 1 times [2022-02-20 18:45:58,766 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:58,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814151942] [2022-02-20 18:45:58,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:58,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:58,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {96010#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_6326~0 := 0;~__return_6404~0 := 0;~__return_6465~0 := 0;~__return_6532~0 := 0;~__return_6719~0 := 0; {96012#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:58,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {96012#(<= (+ ~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_~__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_~__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_~__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;~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; {96012#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:58,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {96012#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {96012#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:58,814 INFO L290 TraceCheckUtils]: 3: Hoare triple {96012#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {96012#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:58,814 INFO L290 TraceCheckUtils]: 4: Hoare triple {96012#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {96012#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:58,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {96012#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {96012#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:58,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {96012#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {96012#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:58,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {96012#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {96012#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:58,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {96012#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {96012#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:58,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {96012#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {96012#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:58,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {96012#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {96012#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:58,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {96012#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {96012#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:58,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {96012#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {96013#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:58,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {96013#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {96013#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:58,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {96013#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {96014#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:58,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {96014#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {96014#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:58,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {96014#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {96014#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:58,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {96014#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {96014#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:58,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {96014#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6326~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6326~0; {96014#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:58,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {96014#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {96014#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:58,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {96014#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256); {96014#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:58,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {96014#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {96014#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:58,819 INFO L290 TraceCheckUtils]: 22: Hoare triple {96014#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {96014#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:58,819 INFO L290 TraceCheckUtils]: 23: Hoare triple {96014#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {96014#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:58,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {96014#(<= (+ ~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); {96014#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:58,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {96014#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {96014#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:58,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {96014#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256); {96014#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:58,820 INFO L290 TraceCheckUtils]: 27: Hoare triple {96014#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive2~0 % 256); {96014#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:58,821 INFO L290 TraceCheckUtils]: 28: Hoare triple {96014#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send2~0 != ~id2~0); {96014#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:58,821 INFO L290 TraceCheckUtils]: 29: Hoare triple {96014#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {96014#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:58,821 INFO L290 TraceCheckUtils]: 30: Hoare triple {96014#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256); {96014#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:58,821 INFO L290 TraceCheckUtils]: 31: Hoare triple {96014#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {96014#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:58,822 INFO L290 TraceCheckUtils]: 32: Hoare triple {96014#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {96011#false} is VALID [2022-02-20 18:45:58,822 INFO L290 TraceCheckUtils]: 33: Hoare triple {96011#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); {96011#false} is VALID [2022-02-20 18:45:58,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {96011#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; {96011#false} is VALID [2022-02-20 18:45:58,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {96011#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {96011#false} is VALID [2022-02-20 18:45:58,822 INFO L290 TraceCheckUtils]: 36: Hoare triple {96011#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_6404~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6404~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; {96011#false} is VALID [2022-02-20 18:45:58,822 INFO L290 TraceCheckUtils]: 37: Hoare triple {96011#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {96011#false} is VALID [2022-02-20 18:45:58,822 INFO L290 TraceCheckUtils]: 38: Hoare triple {96011#false} assume !(0 == ~mode1~0 % 256); {96011#false} is VALID [2022-02-20 18:45:58,823 INFO L290 TraceCheckUtils]: 39: Hoare triple {96011#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {96011#false} is VALID [2022-02-20 18:45:58,823 INFO L290 TraceCheckUtils]: 40: Hoare triple {96011#false} assume main_~node1__m1~1#1 != ~nomsg~0; {96011#false} is VALID [2022-02-20 18:45:58,823 INFO L290 TraceCheckUtils]: 41: Hoare triple {96011#false} assume !(0 == ~alive1~0 % 256); {96011#false} is VALID [2022-02-20 18:45:58,823 INFO L290 TraceCheckUtils]: 42: Hoare triple {96011#false} assume !(main_~node1__m1~1#1 > ~id1~0); {96011#false} is VALID [2022-02-20 18:45:58,823 INFO L290 TraceCheckUtils]: 43: Hoare triple {96011#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {96011#false} is VALID [2022-02-20 18:45:58,823 INFO L290 TraceCheckUtils]: 44: Hoare triple {96011#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {96011#false} is VALID [2022-02-20 18:45:58,823 INFO L290 TraceCheckUtils]: 45: Hoare triple {96011#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {96011#false} is VALID [2022-02-20 18:45:58,823 INFO L290 TraceCheckUtils]: 46: Hoare triple {96011#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {96011#false} is VALID [2022-02-20 18:45:58,823 INFO L290 TraceCheckUtils]: 47: Hoare triple {96011#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {96011#false} is VALID [2022-02-20 18:45:58,824 INFO L290 TraceCheckUtils]: 48: Hoare triple {96011#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {96011#false} is VALID [2022-02-20 18:45:58,824 INFO L290 TraceCheckUtils]: 49: Hoare triple {96011#false} assume main_~node3__m3~1#1 != ~nomsg~0; {96011#false} is VALID [2022-02-20 18:45:58,824 INFO L290 TraceCheckUtils]: 50: Hoare triple {96011#false} assume !(0 == ~alive3~0 % 256); {96011#false} is VALID [2022-02-20 18:45:58,824 INFO L290 TraceCheckUtils]: 51: Hoare triple {96011#false} assume !(main_~node3__m3~1#1 > ~id3~0); {96011#false} is VALID [2022-02-20 18:45:58,824 INFO L290 TraceCheckUtils]: 52: Hoare triple {96011#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {96011#false} is VALID [2022-02-20 18:45:58,824 INFO L290 TraceCheckUtils]: 53: Hoare triple {96011#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; {96011#false} is VALID [2022-02-20 18:45:58,824 INFO L290 TraceCheckUtils]: 54: Hoare triple {96011#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6719~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6719~0; {96011#false} is VALID [2022-02-20 18:45:58,824 INFO L290 TraceCheckUtils]: 55: Hoare triple {96011#false} 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; {96011#false} is VALID [2022-02-20 18:45:58,825 INFO L290 TraceCheckUtils]: 56: Hoare triple {96011#false} assume 0 == main_~assert__arg~2#1 % 256; {96011#false} is VALID [2022-02-20 18:45:58,825 INFO L290 TraceCheckUtils]: 57: Hoare triple {96011#false} assume !false; {96011#false} is VALID [2022-02-20 18:45:58,825 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:58,825 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:58,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814151942] [2022-02-20 18:45:58,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814151942] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:58,825 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:58,826 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:45:58,826 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822765084] [2022-02-20 18:45:58,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:58,826 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:58,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:58,826 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:58,854 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:58,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:58,855 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:58,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:58,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:58,855 INFO L87 Difference]: Start difference. First operand 4547 states and 6627 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:46:12,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:12,888 INFO L93 Difference]: Finished difference Result 10777 states and 15690 transitions. [2022-02-20 18:46:12,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:46:12,888 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:46:12,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:46:12,888 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:46:12,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 517 transitions. [2022-02-20 18:46:12,890 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:46:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 517 transitions. [2022-02-20 18:46:12,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 517 transitions. [2022-02-20 18:46:13,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 517 edges. 517 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.