./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+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a7994e4b0bfbe275d233e5a25c7b22888e2d55ba388328f1fc4435f77ac9412d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:45:03,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:45:03,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:45:03,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:45:03,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:45:03,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:45:03,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:45:03,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:45:03,576 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:45:03,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:45:03,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:45:03,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:45:03,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:45:03,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:45:03,588 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:45:03,590 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:45:03,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:45:03,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:45:03,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:45:03,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:45:03,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:45:03,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:45:03,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:45:03,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:45:03,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:45:03,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:45:03,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:45:03,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:45:03,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:45:03,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:45:03,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:45:03,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:45:03,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:45:03,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:45:03,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:45:03,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:45:03,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:45:03,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:45:03,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:45:03,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:45:03,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:45:03,620 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:03,650 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:45:03,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:45:03,651 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:45:03,651 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:45:03,651 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:45:03,652 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:45:03,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:45:03,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:45:03,653 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:45:03,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:45:03,653 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:45:03,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:45:03,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:45:03,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:45:03,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:45:03,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:45:03,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:45:03,655 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:45:03,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:45:03,655 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:45:03,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:45:03,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:45:03,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:45:03,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:45:03,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:45:03,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:45:03,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:45:03,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:45:03,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:45:03,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:45:03,657 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:45:03,657 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:45:03,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:45:03,658 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 -> a7994e4b0bfbe275d233e5a25c7b22888e2d55ba388328f1fc4435f77ac9412d [2022-02-20 18:45:03,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:45:03,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:45:03,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:45:03,910 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:45:03,911 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:45:03,912 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+cfa-reducer.c [2022-02-20 18:45:03,971 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad7a991e/827f2f473b0848d2b2ec3013ff275f4f/FLAG4abc42814 [2022-02-20 18:45:04,381 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:45:04,382 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+cfa-reducer.c [2022-02-20 18:45:04,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad7a991e/827f2f473b0848d2b2ec3013ff275f4f/FLAG4abc42814 [2022-02-20 18:45:04,765 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad7a991e/827f2f473b0848d2b2ec3013ff275f4f [2022-02-20 18:45:04,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:45:04,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:45:04,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:45:04,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:45:04,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:45:04,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:45:04" (1/1) ... [2022-02-20 18:45:04,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d8c39a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:45:04, skipping insertion in model container [2022-02-20 18:45:04,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:45:04" (1/1) ... [2022-02-20 18:45:04,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:45:04,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:45:04,991 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+cfa-reducer.c[4409,4422] [2022-02-20 18:45:05,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:45:05,021 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:45:05,047 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+cfa-reducer.c[4409,4422] [2022-02-20 18:45:05,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:45:05,074 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:45:05,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:45:05 WrapperNode [2022-02-20 18:45:05,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:45:05,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:45:05,076 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:45:05,076 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:45:05,082 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:05" (1/1) ... [2022-02-20 18:45:05,088 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:05" (1/1) ... [2022-02-20 18:45:05,131 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 328 [2022-02-20 18:45:05,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:45:05,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:45:05,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:45:05,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:45:05,140 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:05" (1/1) ... [2022-02-20 18:45:05,140 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:05" (1/1) ... [2022-02-20 18:45:05,150 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:05" (1/1) ... [2022-02-20 18:45:05,150 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:05" (1/1) ... [2022-02-20 18:45:05,160 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:05" (1/1) ... [2022-02-20 18:45:05,175 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:05" (1/1) ... [2022-02-20 18:45:05,176 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:05" (1/1) ... [2022-02-20 18:45:05,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:45:05,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:45:05,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:45:05,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:45:05,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:45:05" (1/1) ... [2022-02-20 18:45:05,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:45:05,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:45:05,224 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:05,225 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:05,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:45:05,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:45:05,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:45:05,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:45:05,383 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:45:05,385 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:45:05,856 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:45:05,880 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:45:05,881 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:45:05,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:45:05 BoogieIcfgContainer [2022-02-20 18:45:05,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:45:05,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:45:05,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:45:05,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:45:05,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:45:04" (1/3) ... [2022-02-20 18:45:05,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e5fbe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:45:05, skipping insertion in model container [2022-02-20 18:45:05,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:45:05" (2/3) ... [2022-02-20 18:45:05,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e5fbe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:45:05, skipping insertion in model container [2022-02-20 18:45:05,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:45:05" (3/3) ... [2022-02-20 18:45:05,889 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:45:05,893 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:45:05,893 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:45:05,942 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:45:05,947 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:05,948 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:45:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 85 states have (on average 1.6705882352941177) internal successors, (142), 86 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:05,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 18:45:05,974 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:05,975 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:05,975 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:05,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:05,980 INFO L85 PathProgramCache]: Analyzing trace with hash 716810707, now seen corresponding path program 1 times [2022-02-20 18:45:05,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:05,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179675122] [2022-02-20 18:45:05,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:05,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:06,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {90#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_6431~0 := 0; {90#true} is VALID [2022-02-20 18:45:06,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#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_~__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~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {90#true} is VALID [2022-02-20 18:45:06,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {90#true} assume 0 == ~r1~0 % 256; {90#true} is VALID [2022-02-20 18:45:06,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {90#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {90#true} is VALID [2022-02-20 18:45:06,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {90#true} assume ~id1~0 >= 0; {90#true} is VALID [2022-02-20 18:45:06,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {90#true} assume 0 == ~st1~0; {90#true} is VALID [2022-02-20 18:45:06,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {90#true} assume ~send1~0 == ~id1~0; {90#true} is VALID [2022-02-20 18:45:06,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {90#true} assume 0 == ~mode1~0 % 256; {90#true} is VALID [2022-02-20 18:45:06,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {90#true} assume ~id2~0 >= 0; {90#true} is VALID [2022-02-20 18:45:06,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {90#true} assume 0 == ~st2~0; {90#true} is VALID [2022-02-20 18:45:06,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {90#true} assume ~send2~0 == ~id2~0; {90#true} is VALID [2022-02-20 18:45:06,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {90#true} assume 0 == ~mode2~0 % 256; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:45:06,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:45:06,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:45:06,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:45:06,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:45:06,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:45:06,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:45:06,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~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; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:45:06,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:45:06,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:45:06,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256); {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:45:06,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~alive1~0 % 256); {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:45:06,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~id1~0); {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:45:06,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:45:06,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:45:06,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {92#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {91#false} is VALID [2022-02-20 18:45:06,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {91#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {91#false} is VALID [2022-02-20 18:45:06,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {91#false} ~mode2~0 := 0; {91#false} is VALID [2022-02-20 18:45:06,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {91#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {91#false} is VALID [2022-02-20 18:45:06,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {91#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {91#false} is VALID [2022-02-20 18:45:06,311 INFO L290 TraceCheckUtils]: 31: Hoare triple {91#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {91#false} is VALID [2022-02-20 18:45:06,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {91#false} ~mode3~0 := 0; {91#false} is VALID [2022-02-20 18:45:06,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {91#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {91#false} is VALID [2022-02-20 18:45:06,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {91#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {91#false} is VALID [2022-02-20 18:45:06,312 INFO L290 TraceCheckUtils]: 35: Hoare triple {91#false} ~__return_6431~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6431~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; {91#false} is VALID [2022-02-20 18:45:06,312 INFO L290 TraceCheckUtils]: 36: Hoare triple {91#false} assume 0 == main_~assert__arg~0#1 % 256; {91#false} is VALID [2022-02-20 18:45:06,312 INFO L290 TraceCheckUtils]: 37: Hoare triple {91#false} assume !false; {91#false} is VALID [2022-02-20 18:45:06,314 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:06,314 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:06,315 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179675122] [2022-02-20 18:45:06,315 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179675122] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:06,315 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:06,316 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:45:06,318 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569665338] [2022-02-20 18:45:06,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:06,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-02-20 18:45:06,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:06,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:06,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:06,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:45:06,383 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:06,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:45:06,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:45:06,409 INFO L87 Difference]: Start difference. First operand has 87 states, 85 states have (on average 1.6705882352941177) internal successors, (142), 86 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:06,738 INFO L93 Difference]: Finished difference Result 205 states and 324 transitions. [2022-02-20 18:45:06,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:45:06,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-02-20 18:45:06,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:06,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2022-02-20 18:45:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2022-02-20 18:45:06,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 324 transitions. [2022-02-20 18:45:07,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 324 edges. 324 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:07,096 INFO L225 Difference]: With dead ends: 205 [2022-02-20 18:45:07,096 INFO L226 Difference]: Without dead ends: 132 [2022-02-20 18:45:07,099 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:07,102 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 94 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:07,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 283 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:45:07,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-02-20 18:45:07,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2022-02-20 18:45:07,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:07,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 130 states, 129 states have (on average 1.503875968992248) internal successors, (194), 129 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call 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:07,145 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 130 states, 129 states have (on average 1.503875968992248) internal successors, (194), 129 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call 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:07,147 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 130 states, 129 states have (on average 1.503875968992248) internal successors, (194), 129 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call 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:07,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:07,158 INFO L93 Difference]: Finished difference Result 132 states and 195 transitions. [2022-02-20 18:45:07,158 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 195 transitions. [2022-02-20 18:45:07,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:07,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:07,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 129 states have (on average 1.503875968992248) internal successors, (194), 129 states have internal predecessors, (194), 0 states have call successors, (0), 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 132 states. [2022-02-20 18:45:07,165 INFO L87 Difference]: Start difference. First operand has 130 states, 129 states have (on average 1.503875968992248) internal successors, (194), 129 states have internal predecessors, (194), 0 states have call successors, (0), 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 132 states. [2022-02-20 18:45:07,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:07,180 INFO L93 Difference]: Finished difference Result 132 states and 195 transitions. [2022-02-20 18:45:07,180 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 195 transitions. [2022-02-20 18:45:07,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:07,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:07,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:07,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.503875968992248) internal successors, (194), 129 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call 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:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 194 transitions. [2022-02-20 18:45:07,193 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 194 transitions. Word has length 38 [2022-02-20 18:45:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:07,193 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 194 transitions. [2022-02-20 18:45:07,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:07,194 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 194 transitions. [2022-02-20 18:45:07,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 18:45:07,195 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:07,195 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:07,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:45:07,195 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:07,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:07,196 INFO L85 PathProgramCache]: Analyzing trace with hash -935293361, now seen corresponding path program 1 times [2022-02-20 18:45:07,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:07,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006962728] [2022-02-20 18:45:07,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:07,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:07,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {805#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_6431~0 := 0; {805#true} is VALID [2022-02-20 18:45:07,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {805#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_~__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~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {805#true} is VALID [2022-02-20 18:45:07,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {805#true} assume 0 == ~r1~0 % 256; {805#true} is VALID [2022-02-20 18:45:07,271 INFO L290 TraceCheckUtils]: 3: Hoare triple {805#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {805#true} is VALID [2022-02-20 18:45:07,271 INFO L290 TraceCheckUtils]: 4: Hoare triple {805#true} assume ~id1~0 >= 0; {805#true} is VALID [2022-02-20 18:45:07,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {805#true} assume 0 == ~st1~0; {805#true} is VALID [2022-02-20 18:45:07,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {805#true} assume ~send1~0 == ~id1~0; {805#true} is VALID [2022-02-20 18:45:07,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {805#true} assume 0 == ~mode1~0 % 256; {805#true} is VALID [2022-02-20 18:45:07,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {805#true} assume ~id2~0 >= 0; {805#true} is VALID [2022-02-20 18:45:07,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {805#true} assume 0 == ~st2~0; {805#true} is VALID [2022-02-20 18:45:07,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {805#true} assume ~send2~0 == ~id2~0; {805#true} is VALID [2022-02-20 18:45:07,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {805#true} assume 0 == ~mode2~0 % 256; {805#true} is VALID [2022-02-20 18:45:07,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {805#true} assume ~id3~0 >= 0; {805#true} is VALID [2022-02-20 18:45:07,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {805#true} assume 0 == ~st3~0; {805#true} is VALID [2022-02-20 18:45:07,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {805#true} assume ~send3~0 == ~id3~0; {805#true} is VALID [2022-02-20 18:45:07,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {805#true} assume 0 == ~mode3~0 % 256; {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:45:07,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:45:07,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:45:07,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:45:07,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:45:07,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:45:07,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256); {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:45:07,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive1~0 % 256); {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:45:07,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~id1~0); {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:45:07,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:45:07,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:45:07,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256); {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:45:07,281 INFO L290 TraceCheckUtils]: 27: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive2~0 % 256); {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:45:07,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:45:07,283 INFO L290 TraceCheckUtils]: 29: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:45:07,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:45:07,284 INFO L290 TraceCheckUtils]: 31: Hoare triple {807#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {806#false} is VALID [2022-02-20 18:45:07,284 INFO L290 TraceCheckUtils]: 32: Hoare triple {806#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {806#false} is VALID [2022-02-20 18:45:07,284 INFO L290 TraceCheckUtils]: 33: Hoare triple {806#false} ~mode3~0 := 0; {806#false} is VALID [2022-02-20 18:45:07,285 INFO L290 TraceCheckUtils]: 34: Hoare triple {806#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {806#false} is VALID [2022-02-20 18:45:07,285 INFO L290 TraceCheckUtils]: 35: Hoare triple {806#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {806#false} is VALID [2022-02-20 18:45:07,285 INFO L290 TraceCheckUtils]: 36: Hoare triple {806#false} ~__return_6431~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6431~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; {806#false} is VALID [2022-02-20 18:45:07,285 INFO L290 TraceCheckUtils]: 37: Hoare triple {806#false} assume 0 == main_~assert__arg~0#1 % 256; {806#false} is VALID [2022-02-20 18:45:07,286 INFO L290 TraceCheckUtils]: 38: Hoare triple {806#false} assume !false; {806#false} is VALID [2022-02-20 18:45:07,286 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:07,286 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:07,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006962728] [2022-02-20 18:45:07,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006962728] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:07,287 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:07,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:45:07,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480292992] [2022-02-20 18:45:07,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:07,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 18:45:07,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:07,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:07,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:07,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:45:07,321 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:07,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:45:07,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:45:07,322 INFO L87 Difference]: Start difference. First operand 130 states and 194 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:07,511 INFO L93 Difference]: Finished difference Result 318 states and 490 transitions. [2022-02-20 18:45:07,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:45:07,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 18:45:07,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:07,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2022-02-20 18:45:07,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2022-02-20 18:45:07,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 297 transitions. [2022-02-20 18:45:07,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 297 edges. 297 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:07,756 INFO L225 Difference]: With dead ends: 318 [2022-02-20 18:45:07,756 INFO L226 Difference]: Without dead ends: 208 [2022-02-20 18:45:07,757 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:07,758 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 79 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:07,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 235 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:45:07,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-02-20 18:45:07,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2022-02-20 18:45:07,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:07,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand has 206 states, 205 states have (on average 1.526829268292683) internal successors, (313), 205 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call 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:07,776 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand has 206 states, 205 states have (on average 1.526829268292683) internal successors, (313), 205 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call 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:07,776 INFO L87 Difference]: Start difference. First operand 208 states. Second operand has 206 states, 205 states have (on average 1.526829268292683) internal successors, (313), 205 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call 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:07,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:07,784 INFO L93 Difference]: Finished difference Result 208 states and 314 transitions. [2022-02-20 18:45:07,784 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 314 transitions. [2022-02-20 18:45:07,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:07,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:07,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 205 states have (on average 1.526829268292683) internal successors, (313), 205 states have internal predecessors, (313), 0 states have call successors, (0), 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 208 states. [2022-02-20 18:45:07,786 INFO L87 Difference]: Start difference. First operand has 206 states, 205 states have (on average 1.526829268292683) internal successors, (313), 205 states have internal predecessors, (313), 0 states have call successors, (0), 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 208 states. [2022-02-20 18:45:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:07,794 INFO L93 Difference]: Finished difference Result 208 states and 314 transitions. [2022-02-20 18:45:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 314 transitions. [2022-02-20 18:45:07,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:07,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:07,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:07,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:07,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.526829268292683) internal successors, (313), 205 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call 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:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 313 transitions. [2022-02-20 18:45:07,804 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 313 transitions. Word has length 39 [2022-02-20 18:45:07,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:07,804 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 313 transitions. [2022-02-20 18:45:07,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:07,805 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 313 transitions. [2022-02-20 18:45:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 18:45:07,806 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:07,806 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] [2022-02-20 18:45:07,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:45:07,806 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:07,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:07,807 INFO L85 PathProgramCache]: Analyzing trace with hash 830312666, now seen corresponding path program 1 times [2022-02-20 18:45:07,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:07,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736419725] [2022-02-20 18:45:07,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:07,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:07,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {1936#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_6431~0 := 0; {1936#true} is VALID [2022-02-20 18:45:07,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {1936#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_~__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~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {1936#true} is VALID [2022-02-20 18:45:07,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {1936#true} assume 0 == ~r1~0 % 256; {1936#true} is VALID [2022-02-20 18:45:07,882 INFO L290 TraceCheckUtils]: 3: Hoare triple {1936#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {1936#true} is VALID [2022-02-20 18:45:07,882 INFO L290 TraceCheckUtils]: 4: Hoare triple {1936#true} assume ~id1~0 >= 0; {1936#true} is VALID [2022-02-20 18:45:07,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {1936#true} assume 0 == ~st1~0; {1938#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:07,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {1938#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {1938#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:07,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {1938#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {1938#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:07,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {1938#(<= ~st1~0 0)} assume ~id2~0 >= 0; {1938#(<= ~st1~0 0)} is VALID [2022-02-20 18:45:07,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {1938#(<= ~st1~0 0)} assume 0 == ~st2~0; {1939#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {1939#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {1939#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {1939#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {1939#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {1939#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {1939#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {1939#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {1940#(<= (+ ~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; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {1940#(<= (+ ~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; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,893 INFO L290 TraceCheckUtils]: 30: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,895 INFO L290 TraceCheckUtils]: 33: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:45:07,896 INFO L290 TraceCheckUtils]: 36: Hoare triple {1940#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {1937#false} is VALID [2022-02-20 18:45:07,896 INFO L290 TraceCheckUtils]: 37: Hoare triple {1937#false} ~__return_6431~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6431~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; {1937#false} is VALID [2022-02-20 18:45:07,897 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} assume 0 == main_~assert__arg~0#1 % 256; {1937#false} is VALID [2022-02-20 18:45:07,897 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-02-20 18:45:07,897 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:07,898 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:07,898 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736419725] [2022-02-20 18:45:07,898 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736419725] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:07,898 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:07,898 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:45:07,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307927003] [2022-02-20 18:45:07,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:07,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-02-20 18:45:07,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:07,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call 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:07,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:07,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:07,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:07,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:07,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:07,929 INFO L87 Difference]: Start difference. First operand 206 states and 313 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:08,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:08,813 INFO L93 Difference]: Finished difference Result 950 states and 1485 transitions. [2022-02-20 18:45:08,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:45:08,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-02-20 18:45:08,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:08,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2022-02-20 18:45:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2022-02-20 18:45:08,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 525 transitions. [2022-02-20 18:45:09,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 525 edges. 525 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:09,288 INFO L225 Difference]: With dead ends: 950 [2022-02-20 18:45:09,288 INFO L226 Difference]: Without dead ends: 764 [2022-02-20 18:45:09,289 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:09,290 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 501 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:09,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 676 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:45:09,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2022-02-20 18:45:09,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 390. [2022-02-20 18:45:09,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:09,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 764 states. Second operand has 390 states, 389 states have (on average 1.5347043701799485) internal successors, (597), 389 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call 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:09,481 INFO L74 IsIncluded]: Start isIncluded. First operand 764 states. Second operand has 390 states, 389 states have (on average 1.5347043701799485) internal successors, (597), 389 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call 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:09,482 INFO L87 Difference]: Start difference. First operand 764 states. Second operand has 390 states, 389 states have (on average 1.5347043701799485) internal successors, (597), 389 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call 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:09,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:09,519 INFO L93 Difference]: Finished difference Result 764 states and 1184 transitions. [2022-02-20 18:45:09,519 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1184 transitions. [2022-02-20 18:45:09,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:09,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:09,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 390 states, 389 states have (on average 1.5347043701799485) internal successors, (597), 389 states have internal predecessors, (597), 0 states have call successors, (0), 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 764 states. [2022-02-20 18:45:09,523 INFO L87 Difference]: Start difference. First operand has 390 states, 389 states have (on average 1.5347043701799485) internal successors, (597), 389 states have internal predecessors, (597), 0 states have call successors, (0), 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 764 states. [2022-02-20 18:45:09,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:09,558 INFO L93 Difference]: Finished difference Result 764 states and 1184 transitions. [2022-02-20 18:45:09,558 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1184 transitions. [2022-02-20 18:45:09,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:09,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:09,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:09,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.5347043701799485) internal successors, (597), 389 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call 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:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 597 transitions. [2022-02-20 18:45:09,575 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 597 transitions. Word has length 40 [2022-02-20 18:45:09,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:09,576 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 597 transitions. [2022-02-20 18:45:09,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call 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:09,576 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 597 transitions. [2022-02-20 18:45:09,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 18:45:09,577 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:09,577 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:09,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:45:09,577 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:09,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:09,578 INFO L85 PathProgramCache]: Analyzing trace with hash -49567444, now seen corresponding path program 1 times [2022-02-20 18:45:09,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:09,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147088524] [2022-02-20 18:45:09,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:09,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:09,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {5320#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_6431~0 := 0; {5320#true} is VALID [2022-02-20 18:45:09,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {5320#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_~__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~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {5320#true} is VALID [2022-02-20 18:45:09,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {5320#true} assume 0 == ~r1~0 % 256; {5320#true} is VALID [2022-02-20 18:45:09,758 INFO L290 TraceCheckUtils]: 3: Hoare triple {5320#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:45:09,759 INFO L290 TraceCheckUtils]: 4: Hoare triple {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:45:09,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:45:09,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:45:09,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:45:09,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:45:09,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:45:09,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:45:09,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:45:09,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:45:09,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:45:09,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:45:09,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:45:09,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:45:09,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:45:09,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~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; {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:45:09,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~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; {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:45:09,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:45:09,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~mode1~0 % 256); {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:45:09,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {5322#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~alive1~0 % 256); {5323#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:45:09,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {5323#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume !(~send1~0 != ~id1~0); {5323#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:45:09,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {5323#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} ~mode1~0 := 1; {5323#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:45:09,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {5323#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {5323#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:45:09,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {5323#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume !!(0 == ~mode2~0 % 256); {5323#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:45:09,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {5323#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive2~0 256)) 1) (+ ~alive3~0 ~alive2~0))} assume !!(0 == ~alive2~0 % 256); {5324#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:45:09,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {5324#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !(~send2~0 != ~id2~0); {5324#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:45:09,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {5324#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} ~mode2~0 := 1; {5324#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:45:09,782 INFO L290 TraceCheckUtils]: 30: Hoare triple {5324#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {5324#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:45:09,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {5324#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !!(0 == ~mode3~0 % 256); {5324#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} is VALID [2022-02-20 18:45:09,783 INFO L290 TraceCheckUtils]: 32: Hoare triple {5324#(<= (+ (* (div ~alive3~0 256) 256) 1) ~alive3~0)} assume !!(0 == ~alive3~0 % 256); {5321#false} is VALID [2022-02-20 18:45:09,783 INFO L290 TraceCheckUtils]: 33: Hoare triple {5321#false} assume !(~send3~0 != ~id3~0); {5321#false} is VALID [2022-02-20 18:45:09,783 INFO L290 TraceCheckUtils]: 34: Hoare triple {5321#false} ~mode3~0 := 1; {5321#false} is VALID [2022-02-20 18:45:09,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {5321#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {5321#false} is VALID [2022-02-20 18:45:09,784 INFO L290 TraceCheckUtils]: 36: Hoare triple {5321#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {5321#false} is VALID [2022-02-20 18:45:09,784 INFO L290 TraceCheckUtils]: 37: Hoare triple {5321#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {5321#false} is VALID [2022-02-20 18:45:09,784 INFO L290 TraceCheckUtils]: 38: Hoare triple {5321#false} ~__return_6431~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6431~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; {5321#false} is VALID [2022-02-20 18:45:09,784 INFO L290 TraceCheckUtils]: 39: Hoare triple {5321#false} assume 0 == main_~assert__arg~0#1 % 256; {5321#false} is VALID [2022-02-20 18:45:09,784 INFO L290 TraceCheckUtils]: 40: Hoare triple {5321#false} assume !false; {5321#false} is VALID [2022-02-20 18:45:09,785 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:09,785 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:09,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147088524] [2022-02-20 18:45:09,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147088524] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:09,786 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:09,786 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:45:09,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031403019] [2022-02-20 18:45:09,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:09,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 18:45:09,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:09,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:09,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:09,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:09,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:09,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:09,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:09,824 INFO L87 Difference]: Start difference. First operand 390 states and 597 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:11,206 INFO L93 Difference]: Finished difference Result 1348 states and 2080 transitions. [2022-02-20 18:45:11,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:45:11,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 18:45:11,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:11,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 370 transitions. [2022-02-20 18:45:11,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 370 transitions. [2022-02-20 18:45:11,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 370 transitions. [2022-02-20 18:45:11,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:11,583 INFO L225 Difference]: With dead ends: 1348 [2022-02-20 18:45:11,583 INFO L226 Difference]: Without dead ends: 978 [2022-02-20 18:45:11,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:11,604 INFO L933 BasicCegarLoop]: 220 mSDtfsCounter, 268 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:11,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 440 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:45:11,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2022-02-20 18:45:12,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 974. [2022-02-20 18:45:12,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:12,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 978 states. Second operand has 974 states, 973 states have (on average 1.5344295991778005) internal successors, (1493), 973 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call 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,283 INFO L74 IsIncluded]: Start isIncluded. First operand 978 states. Second operand has 974 states, 973 states have (on average 1.5344295991778005) internal successors, (1493), 973 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call 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,285 INFO L87 Difference]: Start difference. First operand 978 states. Second operand has 974 states, 973 states have (on average 1.5344295991778005) internal successors, (1493), 973 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call 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,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:12,334 INFO L93 Difference]: Finished difference Result 978 states and 1495 transitions. [2022-02-20 18:45:12,334 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1495 transitions. [2022-02-20 18:45:12,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:12,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:12,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 974 states, 973 states have (on average 1.5344295991778005) internal successors, (1493), 973 states have internal predecessors, (1493), 0 states have call successors, (0), 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 978 states. [2022-02-20 18:45:12,340 INFO L87 Difference]: Start difference. First operand has 974 states, 973 states have (on average 1.5344295991778005) internal successors, (1493), 973 states have internal predecessors, (1493), 0 states have call successors, (0), 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 978 states. [2022-02-20 18:45:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:12,390 INFO L93 Difference]: Finished difference Result 978 states and 1495 transitions. [2022-02-20 18:45:12,390 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1495 transitions. [2022-02-20 18:45:12,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:12,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:12,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:12,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 973 states have (on average 1.5344295991778005) internal successors, (1493), 973 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call 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,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1493 transitions. [2022-02-20 18:45:12,458 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1493 transitions. Word has length 41 [2022-02-20 18:45:12,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:12,459 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 1493 transitions. [2022-02-20 18:45:12,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:12,460 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1493 transitions. [2022-02-20 18:45:12,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:45:12,461 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:12,461 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:12,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:45:12,461 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:12,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:12,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1536012938, now seen corresponding path program 1 times [2022-02-20 18:45:12,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:12,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410699295] [2022-02-20 18:45:12,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:12,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:12,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {10501#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_6431~0 := 0; {10501#true} is VALID [2022-02-20 18:45:12,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {10501#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_~__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~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {10501#true} is VALID [2022-02-20 18:45:12,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {10501#true} assume 0 == ~r1~0 % 256; {10501#true} is VALID [2022-02-20 18:45:12,519 INFO L290 TraceCheckUtils]: 3: Hoare triple {10501#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {10501#true} is VALID [2022-02-20 18:45:12,520 INFO L290 TraceCheckUtils]: 4: Hoare triple {10501#true} assume ~id1~0 >= 0; {10501#true} is VALID [2022-02-20 18:45:12,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {10501#true} assume 0 == ~st1~0; {10501#true} is VALID [2022-02-20 18:45:12,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {10501#true} assume ~send1~0 == ~id1~0; {10501#true} is VALID [2022-02-20 18:45:12,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {10501#true} assume 0 == ~mode1~0 % 256; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:12,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:12,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:12,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:12,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:12,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:12,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:12,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:12,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:12,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:12,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:12,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:12,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:12,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:45:12,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {10503#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256); {10502#false} is VALID [2022-02-20 18:45:12,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {10502#false} assume 255 == ~r1~0 % 256;~r1~0 := 2; {10502#false} is VALID [2022-02-20 18:45:12,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {10502#false} ~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {10502#false} is VALID [2022-02-20 18:45:12,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {10502#false} assume !(main_~node1__m1~0#1 != ~nomsg~0); {10502#false} is VALID [2022-02-20 18:45:12,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {10502#false} ~mode1~0 := 0; {10502#false} is VALID [2022-02-20 18:45:12,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {10502#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {10502#false} is VALID [2022-02-20 18:45:12,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {10502#false} assume !!(0 == ~mode2~0 % 256); {10502#false} is VALID [2022-02-20 18:45:12,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {10502#false} assume !!(0 == ~alive2~0 % 256); {10502#false} is VALID [2022-02-20 18:45:12,531 INFO L290 TraceCheckUtils]: 29: Hoare triple {10502#false} assume !(~send2~0 != ~id2~0); {10502#false} is VALID [2022-02-20 18:45:12,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {10502#false} ~mode2~0 := 1; {10502#false} is VALID [2022-02-20 18:45:12,532 INFO L290 TraceCheckUtils]: 31: Hoare triple {10502#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {10502#false} is VALID [2022-02-20 18:45:12,532 INFO L290 TraceCheckUtils]: 32: Hoare triple {10502#false} assume !!(0 == ~mode3~0 % 256); {10502#false} is VALID [2022-02-20 18:45:12,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {10502#false} assume !!(0 == ~alive3~0 % 256); {10502#false} is VALID [2022-02-20 18:45:12,533 INFO L290 TraceCheckUtils]: 34: Hoare triple {10502#false} assume !(~send3~0 != ~id3~0); {10502#false} is VALID [2022-02-20 18:45:12,533 INFO L290 TraceCheckUtils]: 35: Hoare triple {10502#false} ~mode3~0 := 1; {10502#false} is VALID [2022-02-20 18:45:12,533 INFO L290 TraceCheckUtils]: 36: Hoare triple {10502#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {10502#false} is VALID [2022-02-20 18:45:12,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {10502#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {10502#false} is VALID [2022-02-20 18:45:12,533 INFO L290 TraceCheckUtils]: 38: Hoare triple {10502#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {10502#false} is VALID [2022-02-20 18:45:12,533 INFO L290 TraceCheckUtils]: 39: Hoare triple {10502#false} ~__return_6431~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6431~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; {10502#false} is VALID [2022-02-20 18:45:12,534 INFO L290 TraceCheckUtils]: 40: Hoare triple {10502#false} assume 0 == main_~assert__arg~0#1 % 256; {10502#false} is VALID [2022-02-20 18:45:12,534 INFO L290 TraceCheckUtils]: 41: Hoare triple {10502#false} assume !false; {10502#false} is VALID [2022-02-20 18:45:12,534 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,534 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:12,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410699295] [2022-02-20 18:45:12,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410699295] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:12,535 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:12,535 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:45:12,535 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041061304] [2022-02-20 18:45:12,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:12,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 18:45:12,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:12,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:12,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:12,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:45:12,568 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:12,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:45:12,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:45:12,569 INFO L87 Difference]: Start difference. First operand 974 states and 1493 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:14,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:14,362 INFO L93 Difference]: Finished difference Result 2490 states and 3807 transitions. [2022-02-20 18:45:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:45:14,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 18:45:14,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:14,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2022-02-20 18:45:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2022-02-20 18:45:14,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 294 transitions. [2022-02-20 18:45:14,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 294 edges. 294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:14,692 INFO L225 Difference]: With dead ends: 2490 [2022-02-20 18:45:14,692 INFO L226 Difference]: Without dead ends: 1536 [2022-02-20 18:45:14,693 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:14,694 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 86 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:14,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 275 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:45:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2022-02-20 18:45:15,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1534. [2022-02-20 18:45:15,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:15,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1536 states. Second operand has 1534 states, 1533 states have (on average 1.5061969993476843) internal successors, (2309), 1533 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call 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,761 INFO L74 IsIncluded]: Start isIncluded. First operand 1536 states. Second operand has 1534 states, 1533 states have (on average 1.5061969993476843) internal successors, (2309), 1533 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call 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,763 INFO L87 Difference]: Start difference. First operand 1536 states. Second operand has 1534 states, 1533 states have (on average 1.5061969993476843) internal successors, (2309), 1533 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call 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,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:15,872 INFO L93 Difference]: Finished difference Result 1536 states and 2310 transitions. [2022-02-20 18:45:15,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 2310 transitions. [2022-02-20 18:45:15,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:15,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:15,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 1534 states, 1533 states have (on average 1.5061969993476843) internal successors, (2309), 1533 states have internal predecessors, (2309), 0 states have call successors, (0), 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 1536 states. [2022-02-20 18:45:15,881 INFO L87 Difference]: Start difference. First operand has 1534 states, 1533 states have (on average 1.5061969993476843) internal successors, (2309), 1533 states have internal predecessors, (2309), 0 states have call successors, (0), 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 1536 states. [2022-02-20 18:45:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:15,989 INFO L93 Difference]: Finished difference Result 1536 states and 2310 transitions. [2022-02-20 18:45:15,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 2310 transitions. [2022-02-20 18:45:15,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:15,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:15,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:15,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:15,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 1533 states have (on average 1.5061969993476843) internal successors, (2309), 1533 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call 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,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 2309 transitions. [2022-02-20 18:45:16,110 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 2309 transitions. Word has length 42 [2022-02-20 18:45:16,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:16,110 INFO L470 AbstractCegarLoop]: Abstraction has 1534 states and 2309 transitions. [2022-02-20 18:45:16,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:16,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 2309 transitions. [2022-02-20 18:45:16,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 18:45:16,111 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:16,111 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] [2022-02-20 18:45:16,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:45:16,111 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:16,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:16,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1650560821, now seen corresponding path program 1 times [2022-02-20 18:45:16,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:16,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764936761] [2022-02-20 18:45:16,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:16,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:16,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {19178#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_6431~0 := 0; {19180#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:16,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {19180#(<= (+ ~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_~__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~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {19180#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:16,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {19180#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {19180#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:16,195 INFO L290 TraceCheckUtils]: 3: Hoare triple {19180#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {19180#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:16,195 INFO L290 TraceCheckUtils]: 4: Hoare triple {19180#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {19181#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:16,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {19181#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {19181#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:45:16,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {19181#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:16,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:16,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:16,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:16,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:16,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:16,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:16,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:16,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:16,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:16,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:16,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:16,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {19182#(<= (+ ~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; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:16,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {19182#(<= (+ ~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; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:16,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:16,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256); {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:16,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {19182#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:45:16,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {19182#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0); {19179#false} is VALID [2022-02-20 18:45:16,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {19179#false} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {19179#false} is VALID [2022-02-20 18:45:16,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {19179#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); {19179#false} is VALID [2022-02-20 18:45:16,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {19179#false} ~mode1~0 := 1; {19179#false} is VALID [2022-02-20 18:45:16,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {19179#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {19179#false} is VALID [2022-02-20 18:45:16,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {19179#false} assume !!(0 == ~mode2~0 % 256); {19179#false} is VALID [2022-02-20 18:45:16,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {19179#false} assume !!(0 == ~alive2~0 % 256); {19179#false} is VALID [2022-02-20 18:45:16,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {19179#false} assume !(~send2~0 != ~id2~0); {19179#false} is VALID [2022-02-20 18:45:16,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {19179#false} ~mode2~0 := 1; {19179#false} is VALID [2022-02-20 18:45:16,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {19179#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {19179#false} is VALID [2022-02-20 18:45:16,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {19179#false} assume !!(0 == ~mode3~0 % 256); {19179#false} is VALID [2022-02-20 18:45:16,205 INFO L290 TraceCheckUtils]: 34: Hoare triple {19179#false} assume !!(0 == ~alive3~0 % 256); {19179#false} is VALID [2022-02-20 18:45:16,206 INFO L290 TraceCheckUtils]: 35: Hoare triple {19179#false} assume !(~send3~0 != ~id3~0); {19179#false} is VALID [2022-02-20 18:45:16,206 INFO L290 TraceCheckUtils]: 36: Hoare triple {19179#false} ~mode3~0 := 1; {19179#false} is VALID [2022-02-20 18:45:16,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {19179#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {19179#false} is VALID [2022-02-20 18:45:16,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {19179#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {19179#false} is VALID [2022-02-20 18:45:16,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {19179#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {19179#false} is VALID [2022-02-20 18:45:16,206 INFO L290 TraceCheckUtils]: 40: Hoare triple {19179#false} ~__return_6431~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6431~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; {19179#false} is VALID [2022-02-20 18:45:16,207 INFO L290 TraceCheckUtils]: 41: Hoare triple {19179#false} assume 0 == main_~assert__arg~0#1 % 256; {19179#false} is VALID [2022-02-20 18:45:16,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {19179#false} assume !false; {19179#false} is VALID [2022-02-20 18:45:16,207 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,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:16,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764936761] [2022-02-20 18:45:16,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764936761] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:16,208 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:16,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:45:16,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596360614] [2022-02-20 18:45:16,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:16,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 18:45:16,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:16,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:16,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:16,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:16,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:16,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:16,243 INFO L87 Difference]: Start difference. First operand 1534 states and 2309 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:20,344 INFO L93 Difference]: Finished difference Result 4106 states and 6199 transitions. [2022-02-20 18:45:20,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:45:20,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 18:45:20,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 323 transitions. [2022-02-20 18:45:20,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 323 transitions. [2022-02-20 18:45:20,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 323 transitions. [2022-02-20 18:45:20,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 323 edges. 323 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:20,890 INFO L225 Difference]: With dead ends: 4106 [2022-02-20 18:45:20,890 INFO L226 Difference]: Without dead ends: 2592 [2022-02-20 18:45:20,891 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:20,892 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 522 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:20,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [522 Valid, 137 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:45:20,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2022-02-20 18:45:23,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2590. [2022-02-20 18:45:23,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:23,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2592 states. Second operand has 2590 states, 2589 states have (on average 1.4943993820007726) internal successors, (3869), 2589 states have internal predecessors, (3869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:23,776 INFO L74 IsIncluded]: Start isIncluded. First operand 2592 states. Second operand has 2590 states, 2589 states have (on average 1.4943993820007726) internal successors, (3869), 2589 states have internal predecessors, (3869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:23,779 INFO L87 Difference]: Start difference. First operand 2592 states. Second operand has 2590 states, 2589 states have (on average 1.4943993820007726) internal successors, (3869), 2589 states have internal predecessors, (3869), 0 states have call successors, (0), 0 states have call 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,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:24,085 INFO L93 Difference]: Finished difference Result 2592 states and 3870 transitions. [2022-02-20 18:45:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 3870 transitions. [2022-02-20 18:45:24,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:24,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:24,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 2590 states, 2589 states have (on average 1.4943993820007726) internal successors, (3869), 2589 states have internal predecessors, (3869), 0 states have call successors, (0), 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 2592 states. [2022-02-20 18:45:24,114 INFO L87 Difference]: Start difference. First operand has 2590 states, 2589 states have (on average 1.4943993820007726) internal successors, (3869), 2589 states have internal predecessors, (3869), 0 states have call successors, (0), 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 2592 states. [2022-02-20 18:45:24,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:24,357 INFO L93 Difference]: Finished difference Result 2592 states and 3870 transitions. [2022-02-20 18:45:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 3870 transitions. [2022-02-20 18:45:24,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:24,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:24,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:24,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:24,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2589 states have (on average 1.4943993820007726) internal successors, (3869), 2589 states have internal predecessors, (3869), 0 states have call successors, (0), 0 states have call 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,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 3869 transitions. [2022-02-20 18:45:24,688 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 3869 transitions. Word has length 43 [2022-02-20 18:45:24,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:24,688 INFO L470 AbstractCegarLoop]: Abstraction has 2590 states and 3869 transitions. [2022-02-20 18:45:24,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 3869 transitions. [2022-02-20 18:45:24,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 18:45:24,689 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:24,689 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] [2022-02-20 18:45:24,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:45:24,689 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:24,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:24,690 INFO L85 PathProgramCache]: Analyzing trace with hash 836148826, now seen corresponding path program 1 times [2022-02-20 18:45:24,690 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:24,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620144508] [2022-02-20 18:45:24,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:24,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:24,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {33701#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_6431~0 := 0; {33701#true} is VALID [2022-02-20 18:45:24,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {33701#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_~__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~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {33701#true} is VALID [2022-02-20 18:45:24,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {33701#true} assume 0 == ~r1~0 % 256; {33701#true} is VALID [2022-02-20 18:45:24,775 INFO L290 TraceCheckUtils]: 3: Hoare triple {33701#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {33701#true} is VALID [2022-02-20 18:45:24,776 INFO L290 TraceCheckUtils]: 4: Hoare triple {33701#true} assume ~id1~0 >= 0; {33701#true} is VALID [2022-02-20 18:45:24,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {33701#true} assume 0 == ~st1~0; {33701#true} is VALID [2022-02-20 18:45:24,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {33701#true} assume ~send1~0 == ~id1~0; {33701#true} is VALID [2022-02-20 18:45:24,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {33701#true} assume 0 == ~mode1~0 % 256; {33701#true} is VALID [2022-02-20 18:45:24,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {33701#true} assume ~id2~0 >= 0; {33701#true} is VALID [2022-02-20 18:45:24,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {33701#true} assume 0 == ~st2~0; {33701#true} is VALID [2022-02-20 18:45:24,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {33701#true} assume ~send2~0 == ~id2~0; {33701#true} is VALID [2022-02-20 18:45:24,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {33701#true} assume 0 == ~mode2~0 % 256; {33701#true} is VALID [2022-02-20 18:45:24,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {33701#true} assume ~id3~0 >= 0; {33701#true} is VALID [2022-02-20 18:45:24,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {33701#true} assume 0 == ~st3~0; {33701#true} is VALID [2022-02-20 18:45:24,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {33701#true} assume ~send3~0 == ~id3~0; {33701#true} is VALID [2022-02-20 18:45:24,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {33701#true} assume 0 == ~mode3~0 % 256; {33701#true} is VALID [2022-02-20 18:45:24,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {33701#true} assume ~id1~0 != ~id2~0; {33701#true} is VALID [2022-02-20 18:45:24,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {33701#true} assume ~id1~0 != ~id3~0; {33701#true} is VALID [2022-02-20 18:45:24,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {33701#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; {33703#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} is VALID [2022-02-20 18:45:24,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {33703#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {33701#true} is VALID [2022-02-20 18:45:24,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {33701#true} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {33701#true} is VALID [2022-02-20 18:45:24,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {33701#true} assume !!(0 == ~mode1~0 % 256); {33701#true} is VALID [2022-02-20 18:45:24,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {33701#true} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {33701#true} is VALID [2022-02-20 18:45:24,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {33701#true} assume ~send1~0 != ~nomsg~0; {33701#true} is VALID [2022-02-20 18:45:24,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {33701#true} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {33701#true} is VALID [2022-02-20 18:45:24,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {33701#true} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256); {33701#true} is VALID [2022-02-20 18:45:24,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {33701#true} ~mode1~0 := 1; {33701#true} is VALID [2022-02-20 18:45:24,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {33701#true} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {33701#true} is VALID [2022-02-20 18:45:24,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {33701#true} assume !!(0 == ~mode2~0 % 256); {33701#true} is VALID [2022-02-20 18:45:24,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {33701#true} assume !!(0 == ~alive2~0 % 256); {33701#true} is VALID [2022-02-20 18:45:24,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {33701#true} assume !(~send2~0 != ~id2~0); {33701#true} is VALID [2022-02-20 18:45:24,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {33701#true} ~mode2~0 := 1; {33701#true} is VALID [2022-02-20 18:45:24,781 INFO L290 TraceCheckUtils]: 32: Hoare triple {33701#true} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {33701#true} is VALID [2022-02-20 18:45:24,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {33701#true} assume !!(0 == ~mode3~0 % 256); {33701#true} is VALID [2022-02-20 18:45:24,781 INFO L290 TraceCheckUtils]: 34: Hoare triple {33701#true} assume !!(0 == ~alive3~0 % 256); {33701#true} is VALID [2022-02-20 18:45:24,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {33701#true} assume !(~send3~0 != ~id3~0); {33701#true} is VALID [2022-02-20 18:45:24,782 INFO L290 TraceCheckUtils]: 36: Hoare triple {33701#true} ~mode3~0 := 1; {33701#true} is VALID [2022-02-20 18:45:24,782 INFO L290 TraceCheckUtils]: 37: Hoare triple {33701#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {33701#true} is VALID [2022-02-20 18:45:24,782 INFO L290 TraceCheckUtils]: 38: Hoare triple {33701#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {33701#true} is VALID [2022-02-20 18:45:24,783 INFO L290 TraceCheckUtils]: 39: Hoare triple {33701#true} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {33704#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} is VALID [2022-02-20 18:45:24,783 INFO L290 TraceCheckUtils]: 40: Hoare triple {33704#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} ~__return_6431~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6431~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; {33705#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} is VALID [2022-02-20 18:45:24,784 INFO L290 TraceCheckUtils]: 41: Hoare triple {33705#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} assume 0 == main_~assert__arg~0#1 % 256; {33702#false} is VALID [2022-02-20 18:45:24,785 INFO L290 TraceCheckUtils]: 42: Hoare triple {33702#false} assume !false; {33702#false} is VALID [2022-02-20 18:45:24,785 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:24,785 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:24,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620144508] [2022-02-20 18:45:24,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620144508] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:24,786 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:24,786 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:45:24,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498513217] [2022-02-20 18:45:24,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:24,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 18:45:24,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:24,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:24,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:24,821 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:24,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:24,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:24,822 INFO L87 Difference]: Start difference. First operand 2590 states and 3869 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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:33,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:33,480 INFO L93 Difference]: Finished difference Result 5320 states and 7878 transitions. [2022-02-20 18:45:33,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:45:33,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 18:45:33,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:33,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2022-02-20 18:45:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2022-02-20 18:45:33,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 224 transitions. [2022-02-20 18:45:33,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:34,674 INFO L225 Difference]: With dead ends: 5320 [2022-02-20 18:45:34,675 INFO L226 Difference]: Without dead ends: 5318 [2022-02-20 18:45:34,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:45:34,676 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 190 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:34,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 585 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:45:34,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5318 states. [2022-02-20 18:45:38,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5318 to 2750. [2022-02-20 18:45:38,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:38,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5318 states. Second operand has 2750 states, 2749 states have (on average 1.46562386322299) internal successors, (4029), 2749 states have internal predecessors, (4029), 0 states have call successors, (0), 0 states have call 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:38,764 INFO L74 IsIncluded]: Start isIncluded. First operand 5318 states. Second operand has 2750 states, 2749 states have (on average 1.46562386322299) internal successors, (4029), 2749 states have internal predecessors, (4029), 0 states have call successors, (0), 0 states have call 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:38,766 INFO L87 Difference]: Start difference. First operand 5318 states. Second operand has 2750 states, 2749 states have (on average 1.46562386322299) internal successors, (4029), 2749 states have internal predecessors, (4029), 0 states have call successors, (0), 0 states have call 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:39,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:39,562 INFO L93 Difference]: Finished difference Result 5318 states and 7797 transitions. [2022-02-20 18:45:39,562 INFO L276 IsEmpty]: Start isEmpty. Operand 5318 states and 7797 transitions. [2022-02-20 18:45:39,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:39,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:39,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 2750 states, 2749 states have (on average 1.46562386322299) internal successors, (4029), 2749 states have internal predecessors, (4029), 0 states have call successors, (0), 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 5318 states. [2022-02-20 18:45:39,575 INFO L87 Difference]: Start difference. First operand has 2750 states, 2749 states have (on average 1.46562386322299) internal successors, (4029), 2749 states have internal predecessors, (4029), 0 states have call successors, (0), 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 5318 states. [2022-02-20 18:45:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:40,411 INFO L93 Difference]: Finished difference Result 5318 states and 7797 transitions. [2022-02-20 18:45:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand 5318 states and 7797 transitions. [2022-02-20 18:45:40,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:40,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:40,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:40,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2750 states, 2749 states have (on average 1.46562386322299) internal successors, (4029), 2749 states have internal predecessors, (4029), 0 states have call successors, (0), 0 states have call 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,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 4029 transitions. [2022-02-20 18:45:40,743 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 4029 transitions. Word has length 43 [2022-02-20 18:45:40,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:40,743 INFO L470 AbstractCegarLoop]: Abstraction has 2750 states and 4029 transitions. [2022-02-20 18:45:40,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 4029 transitions. [2022-02-20 18:45:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 18:45:40,744 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:40,744 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] [2022-02-20 18:45:40,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:45:40,744 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:40,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:40,745 INFO L85 PathProgramCache]: Analyzing trace with hash 161382844, now seen corresponding path program 1 times [2022-02-20 18:45:40,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:40,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796998522] [2022-02-20 18:45:40,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:40,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:40,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {55705#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_6431~0 := 0; {55705#true} is VALID [2022-02-20 18:45:40,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {55705#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_~__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~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {55705#true} is VALID [2022-02-20 18:45:40,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {55705#true} assume 0 == ~r1~0 % 256; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,791 INFO L290 TraceCheckUtils]: 3: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,791 INFO L290 TraceCheckUtils]: 4: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode1~0 % 256); {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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); {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode1~0 := 1; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,800 INFO L290 TraceCheckUtils]: 28: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode2~0 % 256); {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,800 INFO L290 TraceCheckUtils]: 29: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~alive2~0 % 256); {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send2~0 != ~id2~0); {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode2~0 := 1; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,801 INFO L290 TraceCheckUtils]: 32: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,802 INFO L290 TraceCheckUtils]: 33: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode3~0 % 256); {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,802 INFO L290 TraceCheckUtils]: 34: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~alive3~0 % 256); {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,802 INFO L290 TraceCheckUtils]: 35: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send3~0 != ~id3~0); {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode3~0 := 1; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,803 INFO L290 TraceCheckUtils]: 38: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:45:40,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {55707#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 3); {55706#false} is VALID [2022-02-20 18:45:40,804 INFO L290 TraceCheckUtils]: 40: Hoare triple {55706#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~0#1 := 0; {55706#false} is VALID [2022-02-20 18:45:40,804 INFO L290 TraceCheckUtils]: 41: Hoare triple {55706#false} ~__return_6431~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6431~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; {55706#false} is VALID [2022-02-20 18:45:40,804 INFO L290 TraceCheckUtils]: 42: Hoare triple {55706#false} assume 0 == main_~assert__arg~0#1 % 256; {55706#false} is VALID [2022-02-20 18:45:40,805 INFO L290 TraceCheckUtils]: 43: Hoare triple {55706#false} assume !false; {55706#false} is VALID [2022-02-20 18:45:40,805 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:40,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:40,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796998522] [2022-02-20 18:45:40,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796998522] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:40,806 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:40,806 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:45:40,806 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16450320] [2022-02-20 18:45:40,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:40,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 18:45:40,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:40,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call 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,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:40,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:45:40,841 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:40,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:45:40,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:45:40,842 INFO L87 Difference]: Start difference. First operand 2750 states and 4029 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call 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:47,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:47,763 INFO L93 Difference]: Finished difference Result 6192 states and 9053 transitions. [2022-02-20 18:45:47,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:45:47,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 18:45:47,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:47,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call 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:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2022-02-20 18:45:47,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call 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:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2022-02-20 18:45:47,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 310 transitions. [2022-02-20 18:45:47,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 310 edges. 310 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:48,446 INFO L225 Difference]: With dead ends: 6192 [2022-02-20 18:45:48,446 INFO L226 Difference]: Without dead ends: 3462 [2022-02-20 18:45:48,448 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:48,449 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 66 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:48,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 214 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:45:48,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2022-02-20 18:45:53,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3440. [2022-02-20 18:45:53,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:53,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3462 states. Second operand has 3440 states, 3439 states have (on average 1.4489677231753417) internal successors, (4983), 3439 states have internal predecessors, (4983), 0 states have call successors, (0), 0 states have call 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:53,822 INFO L74 IsIncluded]: Start isIncluded. First operand 3462 states. Second operand has 3440 states, 3439 states have (on average 1.4489677231753417) internal successors, (4983), 3439 states have internal predecessors, (4983), 0 states have call successors, (0), 0 states have call 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:53,827 INFO L87 Difference]: Start difference. First operand 3462 states. Second operand has 3440 states, 3439 states have (on average 1.4489677231753417) internal successors, (4983), 3439 states have internal predecessors, (4983), 0 states have call successors, (0), 0 states have call 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:54,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:54,247 INFO L93 Difference]: Finished difference Result 3462 states and 5004 transitions. [2022-02-20 18:45:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 5004 transitions. [2022-02-20 18:45:54,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:54,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:54,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 3440 states, 3439 states have (on average 1.4489677231753417) internal successors, (4983), 3439 states have internal predecessors, (4983), 0 states have call successors, (0), 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 3462 states. [2022-02-20 18:45:54,257 INFO L87 Difference]: Start difference. First operand has 3440 states, 3439 states have (on average 1.4489677231753417) internal successors, (4983), 3439 states have internal predecessors, (4983), 0 states have call successors, (0), 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 3462 states. [2022-02-20 18:45:54,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:54,619 INFO L93 Difference]: Finished difference Result 3462 states and 5004 transitions. [2022-02-20 18:45:54,619 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 5004 transitions. [2022-02-20 18:45:54,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:54,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:54,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:54,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3440 states, 3439 states have (on average 1.4489677231753417) internal successors, (4983), 3439 states have internal predecessors, (4983), 0 states have call successors, (0), 0 states have call 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:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3440 states to 3440 states and 4983 transitions. [2022-02-20 18:45:55,142 INFO L78 Accepts]: Start accepts. Automaton has 3440 states and 4983 transitions. Word has length 44 [2022-02-20 18:45:55,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:55,142 INFO L470 AbstractCegarLoop]: Abstraction has 3440 states and 4983 transitions. [2022-02-20 18:45:55,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call 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:55,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3440 states and 4983 transitions. [2022-02-20 18:45:55,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:45:55,144 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:55,144 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:55,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:45:55,144 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:55,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:55,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1477612707, now seen corresponding path program 1 times [2022-02-20 18:45:55,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:55,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164431911] [2022-02-20 18:45:55,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:55,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:55,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {76152#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_6431~0 := 0; {76152#true} is VALID [2022-02-20 18:45:55,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {76152#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_~__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~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {76152#true} is VALID [2022-02-20 18:45:55,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {76152#true} assume 0 == ~r1~0 % 256; {76152#true} is VALID [2022-02-20 18:45:55,194 INFO L290 TraceCheckUtils]: 3: Hoare triple {76152#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {76152#true} is VALID [2022-02-20 18:45:55,194 INFO L290 TraceCheckUtils]: 4: Hoare triple {76152#true} assume ~id1~0 >= 0; {76152#true} is VALID [2022-02-20 18:45:55,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {76152#true} assume 0 == ~st1~0; {76152#true} is VALID [2022-02-20 18:45:55,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {76152#true} assume ~send1~0 == ~id1~0; {76152#true} is VALID [2022-02-20 18:45:55,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {76152#true} assume 0 == ~mode1~0 % 256; {76152#true} is VALID [2022-02-20 18:45:55,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {76152#true} assume ~id2~0 >= 0; {76152#true} is VALID [2022-02-20 18:45:55,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {76152#true} assume 0 == ~st2~0; {76152#true} is VALID [2022-02-20 18:45:55,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {76152#true} assume ~send2~0 == ~id2~0; {76152#true} is VALID [2022-02-20 18:45:55,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {76152#true} assume 0 == ~mode2~0 % 256; {76152#true} is VALID [2022-02-20 18:45:55,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {76152#true} assume ~id3~0 >= 0; {76152#true} is VALID [2022-02-20 18:45:55,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {76152#true} assume 0 == ~st3~0; {76152#true} is VALID [2022-02-20 18:45:55,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {76152#true} assume ~send3~0 == ~id3~0; {76152#true} is VALID [2022-02-20 18:45:55,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {76152#true} assume 0 == ~mode3~0 % 256; {76152#true} is VALID [2022-02-20 18:45:55,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {76152#true} assume ~id1~0 != ~id2~0; {76152#true} is VALID [2022-02-20 18:45:55,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {76152#true} assume ~id1~0 != ~id3~0; {76152#true} is VALID [2022-02-20 18:45:55,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {76152#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; {76152#true} is VALID [2022-02-20 18:45:55,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {76152#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; {76152#true} is VALID [2022-02-20 18:45:55,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {76152#true} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {76152#true} is VALID [2022-02-20 18:45:55,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {76152#true} assume !!(0 == ~mode1~0 % 256); {76152#true} is VALID [2022-02-20 18:45:55,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {76152#true} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume ~send1~0 != ~nomsg~0; {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 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); {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} ~mode1~0 := 1; {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume !!(0 == ~mode2~0 % 256); {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume !!(0 == ~alive2~0 % 256); {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume !(~send2~0 != ~id2~0); {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} ~mode2~0 := 1; {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,203 INFO L290 TraceCheckUtils]: 33: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume !!(0 == ~mode3~0 % 256); {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume !!(0 == ~alive3~0 % 256); {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume !(~send3~0 != ~id3~0); {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} ~mode3~0 := 1; {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,205 INFO L290 TraceCheckUtils]: 38: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,205 INFO L290 TraceCheckUtils]: 39: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,206 INFO L290 TraceCheckUtils]: 40: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} ~__return_6431~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6431~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; {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume !(0 == main_~assert__arg~0#1 % 256); {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume !!(0 == ~mode1~0 % 256); {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} is VALID [2022-02-20 18:45:55,208 INFO L290 TraceCheckUtils]: 44: Hoare triple {76154#(not (= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0))} assume !!(0 == ~alive1~0 % 256); {76153#false} is VALID [2022-02-20 18:45:55,208 INFO L290 TraceCheckUtils]: 45: Hoare triple {76153#false} assume !(~send1~0 != ~id1~0); {76153#false} is VALID [2022-02-20 18:45:55,208 INFO L290 TraceCheckUtils]: 46: Hoare triple {76153#false} ~mode1~0 := 1; {76153#false} is VALID [2022-02-20 18:45:55,208 INFO L290 TraceCheckUtils]: 47: Hoare triple {76153#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {76153#false} is VALID [2022-02-20 18:45:55,209 INFO L290 TraceCheckUtils]: 48: Hoare triple {76153#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {76153#false} is VALID [2022-02-20 18:45:55,209 INFO L290 TraceCheckUtils]: 49: Hoare triple {76153#false} assume main_~node2__m2~0#1 != ~nomsg~0; {76153#false} is VALID [2022-02-20 18:45:55,209 INFO L290 TraceCheckUtils]: 50: Hoare triple {76153#false} assume !(0 == ~alive2~0 % 256); {76153#false} is VALID [2022-02-20 18:45:55,209 INFO L290 TraceCheckUtils]: 51: Hoare triple {76153#false} assume !(main_~node2__m2~0#1 > ~id2~0); {76153#false} is VALID [2022-02-20 18:45:55,209 INFO L290 TraceCheckUtils]: 52: Hoare triple {76153#false} assume main_~node2__m2~0#1 == ~id2~0;~st2~0 := 1; {76153#false} is VALID [2022-02-20 18:45:55,209 INFO L290 TraceCheckUtils]: 53: Hoare triple {76153#false} ~mode2~0 := 0; {76153#false} is VALID [2022-02-20 18:45:55,210 INFO L290 TraceCheckUtils]: 54: Hoare triple {76153#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {76153#false} is VALID [2022-02-20 18:45:55,210 INFO L290 TraceCheckUtils]: 55: Hoare triple {76153#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {76153#false} is VALID [2022-02-20 18:45:55,210 INFO L290 TraceCheckUtils]: 56: Hoare triple {76153#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {76153#false} is VALID [2022-02-20 18:45:55,210 INFO L290 TraceCheckUtils]: 57: Hoare triple {76153#false} ~mode3~0 := 0; {76153#false} is VALID [2022-02-20 18:45:55,210 INFO L290 TraceCheckUtils]: 58: Hoare triple {76153#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {76153#false} is VALID [2022-02-20 18:45:55,210 INFO L290 TraceCheckUtils]: 59: Hoare triple {76153#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {76153#false} is VALID [2022-02-20 18:45:55,220 INFO L290 TraceCheckUtils]: 60: Hoare triple {76153#false} ~__return_6431~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6431~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; {76153#false} is VALID [2022-02-20 18:45:55,220 INFO L290 TraceCheckUtils]: 61: Hoare triple {76153#false} assume 0 == main_~assert__arg~0#1 % 256; {76153#false} is VALID [2022-02-20 18:45:55,220 INFO L290 TraceCheckUtils]: 62: Hoare triple {76153#false} assume !false; {76153#false} is VALID [2022-02-20 18:45:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:45:55,221 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:55,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164431911] [2022-02-20 18:45:55,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164431911] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:55,222 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:55,222 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:45:55,222 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601258343] [2022-02-20 18:45:55,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:55,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:45:55,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:55,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call 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:55,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:55,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:45:55,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:55,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:45:55,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:45:55,264 INFO L87 Difference]: Start difference. First operand 3440 states and 4983 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)