./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:28:43,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:28:43,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:28:43,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:28:43,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:28:43,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:28:43,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:28:43,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:28:43,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:28:43,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:28:43,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:28:43,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:28:43,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:28:43,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:28:43,759 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:28:43,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:28:43,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:28:43,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:28:43,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:28:43,767 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:28:43,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:28:43,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:28:43,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:28:43,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:28:43,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:28:43,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:28:43,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:28:43,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:28:43,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:28:43,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:28:43,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:28:43,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:28:43,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:28:43,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:28:43,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:28:43,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:28:43,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:28:43,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:28:43,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:28:43,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:28:43,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:28:43,785 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:28:43,806 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:28:43,806 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:28:43,807 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:28:43,807 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:28:43,807 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:28:43,808 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:28:43,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:28:43,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:28:43,808 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:28:43,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:28:43,809 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:28:43,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:28:43,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:28:43,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:28:43,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:28:43,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:28:43,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:28:43,810 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:28:43,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:28:43,811 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:28:43,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:28:43,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:28:43,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:28:43,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:28:43,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:28:43,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:28:43,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:28:43,812 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:28:43,812 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:28:43,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:28:43,812 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:28:43,813 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:28:43,813 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:28:43,813 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 -> d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 [2022-02-20 18:28:44,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:28:44,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:28:44,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:28:44,023 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:28:44,024 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:28:44,025 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2022-02-20 18:28:44,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b414f636/07610e47cfab45bdb2409b448de4bed3/FLAGd9a2c9359 [2022-02-20 18:28:44,421 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:28:44,421 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2022-02-20 18:28:44,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b414f636/07610e47cfab45bdb2409b448de4bed3/FLAGd9a2c9359 [2022-02-20 18:28:44,434 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b414f636/07610e47cfab45bdb2409b448de4bed3 [2022-02-20 18:28:44,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:28:44,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:28:44,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:28:44,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:28:44,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:28:44,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:28:44" (1/1) ... [2022-02-20 18:28:44,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b02f18f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:44, skipping insertion in model container [2022-02-20 18:28:44,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:28:44" (1/1) ... [2022-02-20 18:28:44,446 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:28:44,462 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:28:44,604 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c[5984,5997] [2022-02-20 18:28:44,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:28:44,613 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:28:44,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c[5984,5997] [2022-02-20 18:28:44,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:28:44,647 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:28:44,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:44 WrapperNode [2022-02-20 18:28:44,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:28:44,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:28:44,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:28:44,648 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:28:44,655 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:28:44" (1/1) ... [2022-02-20 18:28:44,660 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:28:44" (1/1) ... [2022-02-20 18:28:44,688 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 220 [2022-02-20 18:28:44,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:28:44,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:28:44,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:28:44,689 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:28:44,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:44" (1/1) ... [2022-02-20 18:28:44,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:44" (1/1) ... [2022-02-20 18:28:44,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:44" (1/1) ... [2022-02-20 18:28:44,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:44" (1/1) ... [2022-02-20 18:28:44,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:44" (1/1) ... [2022-02-20 18:28:44,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:44" (1/1) ... [2022-02-20 18:28:44,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:44" (1/1) ... [2022-02-20 18:28:44,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:28:44,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:28:44,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:28:44,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:28:44,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:44" (1/1) ... [2022-02-20 18:28:44,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:28:44,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:28:44,768 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:28:44,776 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:28:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:28:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:28:44,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:28:44,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:28:44,855 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:28:44,857 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:28:45,167 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:28:45,171 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:28:45,172 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:28:45,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:28:45 BoogieIcfgContainer [2022-02-20 18:28:45,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:28:45,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:28:45,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:28:45,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:28:45,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:28:44" (1/3) ... [2022-02-20 18:28:45,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1c942a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:28:45, skipping insertion in model container [2022-02-20 18:28:45,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:44" (2/3) ... [2022-02-20 18:28:45,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1c942a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:28:45, skipping insertion in model container [2022-02-20 18:28:45,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:28:45" (3/3) ... [2022-02-20 18:28:45,186 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2022-02-20 18:28:45,191 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:28:45,191 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:28:45,232 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:28:45,241 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:28:45,241 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:28:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 61 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:45,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:28:45,259 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:45,260 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] [2022-02-20 18:28:45,260 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:45,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:45,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1133243219, now seen corresponding path program 1 times [2022-02-20 18:28:45,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:45,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370628882] [2022-02-20 18:28:45,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:45,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:45,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {65#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; {65#true} is VALID [2022-02-20 18:28:45,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {65#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~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_#t~ret20#1, main_#t~ret21#1, main_#t~post22#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {65#true} is VALID [2022-02-20 18:28:45,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {65#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {65#true} is VALID [2022-02-20 18:28:45,434 INFO L290 TraceCheckUtils]: 3: Hoare triple {65#true} init_#res#1 := init_~tmp~0#1; {65#true} is VALID [2022-02-20 18:28:45,434 INFO L290 TraceCheckUtils]: 4: Hoare triple {65#true} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; {65#true} is VALID [2022-02-20 18:28:45,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {65#true} assume 0 == main_~i2~0#1;assume false; {66#false} is VALID [2022-02-20 18:28:45,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {66#false} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {66#false} is VALID [2022-02-20 18:28:45,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {66#false} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {66#false} is VALID [2022-02-20 18:28:45,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {66#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {66#false} is VALID [2022-02-20 18:28:45,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {66#false} assume !(node1_~m1~0#1 != ~nomsg~0); {66#false} is VALID [2022-02-20 18:28:45,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {66#false} ~mode1~0 := 0; {66#false} is VALID [2022-02-20 18:28:45,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {66#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {66#false} is VALID [2022-02-20 18:28:45,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {66#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {66#false} is VALID [2022-02-20 18:28:45,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {66#false} assume !(node2_~m2~0#1 != ~nomsg~0); {66#false} is VALID [2022-02-20 18:28:45,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {66#false} ~mode2~0 := 0; {66#false} is VALID [2022-02-20 18:28:45,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {66#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {66#false} is VALID [2022-02-20 18:28:45,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {66#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {66#false} is VALID [2022-02-20 18:28:45,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {66#false} assume !(node3_~m3~0#1 != ~nomsg~0); {66#false} is VALID [2022-02-20 18:28:45,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {66#false} ~mode3~0 := 0; {66#false} is VALID [2022-02-20 18:28:45,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {66#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {66#false} is VALID [2022-02-20 18:28:45,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {66#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {66#false} is VALID [2022-02-20 18:28:45,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {66#false} check_#res#1 := check_~tmp~1#1; {66#false} is VALID [2022-02-20 18:28:45,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {66#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {66#false} is VALID [2022-02-20 18:28:45,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {66#false} assume 0 == assert_~arg#1 % 256; {66#false} is VALID [2022-02-20 18:28:45,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {66#false} assume !false; {66#false} is VALID [2022-02-20 18:28:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:45,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:45,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370628882] [2022-02-20 18:28:45,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370628882] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:45,457 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:45,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:28:45,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195640360] [2022-02-20 18:28:45,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:45,463 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-20 18:28:45,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:45,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:45,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:45,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:28:45,497 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:45,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:28:45,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:28:45,524 INFO L87 Difference]: Start difference. First operand has 62 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 61 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:45,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:45,600 INFO L93 Difference]: Finished difference Result 103 states and 164 transitions. [2022-02-20 18:28:45,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:28:45,601 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-20 18:28:45,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:45,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 164 transitions. [2022-02-20 18:28:45,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:45,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 164 transitions. [2022-02-20 18:28:45,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 164 transitions. [2022-02-20 18:28:45,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:45,742 INFO L225 Difference]: With dead ends: 103 [2022-02-20 18:28:45,743 INFO L226 Difference]: Without dead ends: 58 [2022-02-20 18:28:45,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:28:45,748 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:45,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:45,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-20 18:28:45,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-02-20 18:28:45,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:45,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 57 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:45,778 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 57 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:45,781 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 57 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:45,788 INFO L93 Difference]: Finished difference Result 58 states and 94 transitions. [2022-02-20 18:28:45,789 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 94 transitions. [2022-02-20 18:28:45,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:45,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:45,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 57 states have internal predecessors, (94), 0 states have call successors, (0), 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 58 states. [2022-02-20 18:28:45,791 INFO L87 Difference]: Start difference. First operand has 58 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 57 states have internal predecessors, (94), 0 states have call successors, (0), 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 58 states. [2022-02-20 18:28:45,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:45,795 INFO L93 Difference]: Finished difference Result 58 states and 94 transitions. [2022-02-20 18:28:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 94 transitions. [2022-02-20 18:28:45,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:45,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:45,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:45,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:45,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 57 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 94 transitions. [2022-02-20 18:28:45,808 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 94 transitions. Word has length 25 [2022-02-20 18:28:45,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:45,809 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 94 transitions. [2022-02-20 18:28:45,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:45,809 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 94 transitions. [2022-02-20 18:28:45,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:28:45,811 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:45,812 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] [2022-02-20 18:28:45,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:28:45,815 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:45,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:45,817 INFO L85 PathProgramCache]: Analyzing trace with hash 315594769, now seen corresponding path program 1 times [2022-02-20 18:28:45,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:45,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236703611] [2022-02-20 18:28:45,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:45,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:45,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {368#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; {368#true} is VALID [2022-02-20 18:28:45,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret20#1, main_#t~ret21#1, main_#t~post22#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {368#true} is VALID [2022-02-20 18:28:45,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {368#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {370#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:28:45,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {370#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {371#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:28:45,889 INFO L290 TraceCheckUtils]: 4: Hoare triple {371#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; {372#(= |ULTIMATE.start_main_~i2~0#1| 0)} is VALID [2022-02-20 18:28:45,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {372#(= |ULTIMATE.start_main_~i2~0#1| 0)} assume !(0 == main_~i2~0#1); {369#false} is VALID [2022-02-20 18:28:45,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {369#false} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {369#false} is VALID [2022-02-20 18:28:45,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {369#false} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {369#false} is VALID [2022-02-20 18:28:45,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {369#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {369#false} is VALID [2022-02-20 18:28:45,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {369#false} assume !(node1_~m1~0#1 != ~nomsg~0); {369#false} is VALID [2022-02-20 18:28:45,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {369#false} ~mode1~0 := 0; {369#false} is VALID [2022-02-20 18:28:45,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {369#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {369#false} is VALID [2022-02-20 18:28:45,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {369#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {369#false} is VALID [2022-02-20 18:28:45,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {369#false} assume !(node2_~m2~0#1 != ~nomsg~0); {369#false} is VALID [2022-02-20 18:28:45,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {369#false} ~mode2~0 := 0; {369#false} is VALID [2022-02-20 18:28:45,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {369#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {369#false} is VALID [2022-02-20 18:28:45,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {369#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {369#false} is VALID [2022-02-20 18:28:45,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {369#false} assume !(node3_~m3~0#1 != ~nomsg~0); {369#false} is VALID [2022-02-20 18:28:45,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {369#false} ~mode3~0 := 0; {369#false} is VALID [2022-02-20 18:28:45,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {369#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {369#false} is VALID [2022-02-20 18:28:45,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {369#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {369#false} is VALID [2022-02-20 18:28:45,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {369#false} check_#res#1 := check_~tmp~1#1; {369#false} is VALID [2022-02-20 18:28:45,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {369#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {369#false} is VALID [2022-02-20 18:28:45,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {369#false} assume 0 == assert_~arg#1 % 256; {369#false} is VALID [2022-02-20 18:28:45,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {369#false} assume !false; {369#false} is VALID [2022-02-20 18:28:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:45,896 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:45,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236703611] [2022-02-20 18:28:45,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236703611] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:45,897 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:45,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:28:45,897 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302243738] [2022-02-20 18:28:45,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:45,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-20 18:28:45,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:45,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:45,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:45,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:28:45,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:45,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:28:45,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:28:45,917 INFO L87 Difference]: Start difference. First operand 58 states and 94 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:46,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:46,137 INFO L93 Difference]: Finished difference Result 134 states and 210 transitions. [2022-02-20 18:28:46,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:28:46,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-20 18:28:46,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:46,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:46,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2022-02-20 18:28:46,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2022-02-20 18:28:46,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 210 transitions. [2022-02-20 18:28:46,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:46,294 INFO L225 Difference]: With dead ends: 134 [2022-02-20 18:28:46,294 INFO L226 Difference]: Without dead ends: 94 [2022-02-20 18:28:46,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:28:46,296 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 58 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:46,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 339 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:46,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-20 18:28:46,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 58. [2022-02-20 18:28:46,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:46,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 58 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:46,303 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 58 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:46,303 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 58 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:46,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:46,309 INFO L93 Difference]: Finished difference Result 94 states and 134 transitions. [2022-02-20 18:28:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2022-02-20 18:28:46,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:46,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:46,312 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 0 states have call successors, (0), 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 94 states. [2022-02-20 18:28:46,313 INFO L87 Difference]: Start difference. First operand has 58 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 0 states have call successors, (0), 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 94 states. [2022-02-20 18:28:46,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:46,315 INFO L93 Difference]: Finished difference Result 94 states and 134 transitions. [2022-02-20 18:28:46,315 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2022-02-20 18:28:46,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:46,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:46,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:46,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:46,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2022-02-20 18:28:46,321 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 25 [2022-02-20 18:28:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:46,322 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2022-02-20 18:28:46,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:46,322 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2022-02-20 18:28:46,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 18:28:46,323 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:46,323 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:28:46,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:28:46,324 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:46,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:46,324 INFO L85 PathProgramCache]: Analyzing trace with hash -278543826, now seen corresponding path program 1 times [2022-02-20 18:28:46,325 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:46,325 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430086904] [2022-02-20 18:28:46,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:46,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:46,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {786#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; {786#true} is VALID [2022-02-20 18:28:46,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {786#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret20#1, main_#t~ret21#1, main_#t~post22#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {786#true} is VALID [2022-02-20 18:28:46,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {786#true} assume 0 == ~r1~0; {786#true} is VALID [2022-02-20 18:28:46,436 INFO L290 TraceCheckUtils]: 3: Hoare triple {786#true} assume ~id1~0 >= 0; {786#true} is VALID [2022-02-20 18:28:46,436 INFO L290 TraceCheckUtils]: 4: Hoare triple {786#true} assume 0 == ~st1~0; {786#true} is VALID [2022-02-20 18:28:46,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {786#true} assume ~send1~0 == ~id1~0; {786#true} is VALID [2022-02-20 18:28:46,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {786#true} assume 0 == ~mode1~0 % 256; {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:46,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:46,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:46,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:46,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:46,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:46,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:46,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:46,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:46,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:46,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:46,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:46,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:46,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:46,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main_~i2~0#1); {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:46,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:46,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:46,450 INFO L290 TraceCheckUtils]: 23: Hoare triple {788#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {787#false} is VALID [2022-02-20 18:28:46,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {787#false} assume !(node1_~m1~0#1 != ~nomsg~0); {787#false} is VALID [2022-02-20 18:28:46,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {787#false} ~mode1~0 := 0; {787#false} is VALID [2022-02-20 18:28:46,451 INFO L290 TraceCheckUtils]: 26: Hoare triple {787#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {787#false} is VALID [2022-02-20 18:28:46,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {787#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {787#false} is VALID [2022-02-20 18:28:46,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {787#false} assume !(node2_~m2~0#1 != ~nomsg~0); {787#false} is VALID [2022-02-20 18:28:46,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {787#false} ~mode2~0 := 0; {787#false} is VALID [2022-02-20 18:28:46,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {787#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {787#false} is VALID [2022-02-20 18:28:46,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {787#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {787#false} is VALID [2022-02-20 18:28:46,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {787#false} assume !(node3_~m3~0#1 != ~nomsg~0); {787#false} is VALID [2022-02-20 18:28:46,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {787#false} ~mode3~0 := 0; {787#false} is VALID [2022-02-20 18:28:46,452 INFO L290 TraceCheckUtils]: 34: Hoare triple {787#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {787#false} is VALID [2022-02-20 18:28:46,452 INFO L290 TraceCheckUtils]: 35: Hoare triple {787#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {787#false} is VALID [2022-02-20 18:28:46,452 INFO L290 TraceCheckUtils]: 36: Hoare triple {787#false} check_#res#1 := check_~tmp~1#1; {787#false} is VALID [2022-02-20 18:28:46,452 INFO L290 TraceCheckUtils]: 37: Hoare triple {787#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {787#false} is VALID [2022-02-20 18:28:46,452 INFO L290 TraceCheckUtils]: 38: Hoare triple {787#false} assume 0 == assert_~arg#1 % 256; {787#false} is VALID [2022-02-20 18:28:46,453 INFO L290 TraceCheckUtils]: 39: Hoare triple {787#false} assume !false; {787#false} is VALID [2022-02-20 18:28:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:46,454 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:46,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430086904] [2022-02-20 18:28:46,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430086904] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:46,455 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:46,455 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:46,455 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175219818] [2022-02-20 18:28:46,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:46,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:46,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:46,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:46,480 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:28:46,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:46,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:46,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:46,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:46,481 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:46,581 INFO L93 Difference]: Finished difference Result 124 states and 180 transitions. [2022-02-20 18:28:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:46,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:46,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:46,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2022-02-20 18:28:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2022-02-20 18:28:46,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 180 transitions. [2022-02-20 18:28:46,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:46,702 INFO L225 Difference]: With dead ends: 124 [2022-02-20 18:28:46,702 INFO L226 Difference]: Without dead ends: 88 [2022-02-20 18:28:46,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:46,703 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 46 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 174 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:28:46,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 174 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-02-20 18:28:46,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2022-02-20 18:28:46,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:46,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 86 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:46,710 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 86 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:46,710 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 86 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:46,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:46,712 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2022-02-20 18:28:46,712 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2022-02-20 18:28:46,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:46,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:46,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 0 states have call successors, (0), 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 88 states. [2022-02-20 18:28:46,713 INFO L87 Difference]: Start difference. First operand has 86 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 0 states have call successors, (0), 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 88 states. [2022-02-20 18:28:46,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:46,715 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2022-02-20 18:28:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2022-02-20 18:28:46,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:46,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:46,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:46,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:46,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2022-02-20 18:28:46,718 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 40 [2022-02-20 18:28:46,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:46,718 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2022-02-20 18:28:46,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:46,719 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2022-02-20 18:28:46,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 18:28:46,719 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:46,719 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:28:46,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:28:46,720 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:46,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:46,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1401070434, now seen corresponding path program 1 times [2022-02-20 18:28:46,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:46,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986050398] [2022-02-20 18:28:46,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:46,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:46,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {1209#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; {1209#true} is VALID [2022-02-20 18:28:46,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {1209#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret20#1, main_#t~ret21#1, main_#t~post22#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1209#true} is VALID [2022-02-20 18:28:46,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {1209#true} assume 0 == ~r1~0; {1209#true} is VALID [2022-02-20 18:28:46,781 INFO L290 TraceCheckUtils]: 3: Hoare triple {1209#true} assume ~id1~0 >= 0; {1209#true} is VALID [2022-02-20 18:28:46,781 INFO L290 TraceCheckUtils]: 4: Hoare triple {1209#true} assume 0 == ~st1~0; {1209#true} is VALID [2022-02-20 18:28:46,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {1209#true} assume ~send1~0 == ~id1~0; {1209#true} is VALID [2022-02-20 18:28:46,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {1209#true} assume 0 == ~mode1~0 % 256; {1209#true} is VALID [2022-02-20 18:28:46,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {1209#true} assume ~id2~0 >= 0; {1209#true} is VALID [2022-02-20 18:28:46,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {1209#true} assume 0 == ~st2~0; {1209#true} is VALID [2022-02-20 18:28:46,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {1209#true} assume ~send2~0 == ~id2~0; {1209#true} is VALID [2022-02-20 18:28:46,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {1209#true} assume 0 == ~mode2~0 % 256; {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:46,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:46,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:46,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:46,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:46,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:46,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:46,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:46,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:46,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:46,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == main_~i2~0#1); {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:46,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:46,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:46,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:46,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:46,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:46,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:46,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {1211#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1210#false} is VALID [2022-02-20 18:28:46,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {1210#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1210#false} is VALID [2022-02-20 18:28:46,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {1210#false} ~mode2~0 := 0; {1210#false} is VALID [2022-02-20 18:28:46,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {1210#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1210#false} is VALID [2022-02-20 18:28:46,791 INFO L290 TraceCheckUtils]: 31: Hoare triple {1210#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1210#false} is VALID [2022-02-20 18:28:46,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {1210#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1210#false} is VALID [2022-02-20 18:28:46,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {1210#false} ~mode3~0 := 0; {1210#false} is VALID [2022-02-20 18:28:46,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {1210#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1210#false} is VALID [2022-02-20 18:28:46,792 INFO L290 TraceCheckUtils]: 35: Hoare triple {1210#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1210#false} is VALID [2022-02-20 18:28:46,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {1210#false} check_#res#1 := check_~tmp~1#1; {1210#false} is VALID [2022-02-20 18:28:46,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {1210#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1210#false} is VALID [2022-02-20 18:28:46,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {1210#false} assume 0 == assert_~arg#1 % 256; {1210#false} is VALID [2022-02-20 18:28:46,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {1210#false} assume !false; {1210#false} is VALID [2022-02-20 18:28:46,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:46,793 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:46,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986050398] [2022-02-20 18:28:46,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986050398] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:46,793 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:46,793 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:46,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204552844] [2022-02-20 18:28:46,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:46,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:46,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:46,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:46,818 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:28:46,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:46,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:46,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:46,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:46,820 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:46,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:46,915 INFO L93 Difference]: Finished difference Result 202 states and 302 transitions. [2022-02-20 18:28:46,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:46,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:46,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:46,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2022-02-20 18:28:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2022-02-20 18:28:46,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 180 transitions. [2022-02-20 18:28:47,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:47,025 INFO L225 Difference]: With dead ends: 202 [2022-02-20 18:28:47,026 INFO L226 Difference]: Without dead ends: 138 [2022-02-20 18:28:47,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:47,027 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 42 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 173 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:28:47,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 173 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:47,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-02-20 18:28:47,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2022-02-20 18:28:47,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:47,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 136 states, 135 states have (on average 1.474074074074074) internal successors, (199), 135 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:47,035 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 136 states, 135 states have (on average 1.474074074074074) internal successors, (199), 135 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:47,036 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 136 states, 135 states have (on average 1.474074074074074) internal successors, (199), 135 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:47,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:47,038 INFO L93 Difference]: Finished difference Result 138 states and 200 transitions. [2022-02-20 18:28:47,038 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 200 transitions. [2022-02-20 18:28:47,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:47,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:47,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 135 states have (on average 1.474074074074074) internal successors, (199), 135 states have internal predecessors, (199), 0 states have call successors, (0), 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 138 states. [2022-02-20 18:28:47,039 INFO L87 Difference]: Start difference. First operand has 136 states, 135 states have (on average 1.474074074074074) internal successors, (199), 135 states have internal predecessors, (199), 0 states have call successors, (0), 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 138 states. [2022-02-20 18:28:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:47,042 INFO L93 Difference]: Finished difference Result 138 states and 200 transitions. [2022-02-20 18:28:47,042 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 200 transitions. [2022-02-20 18:28:47,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:47,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:47,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:47,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:47,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.474074074074074) internal successors, (199), 135 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2022-02-20 18:28:47,046 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 40 [2022-02-20 18:28:47,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:47,046 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 199 transitions. [2022-02-20 18:28:47,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:47,046 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 199 transitions. [2022-02-20 18:28:47,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 18:28:47,047 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:47,047 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:28:47,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:28:47,047 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:47,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:47,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1738863576, now seen corresponding path program 1 times [2022-02-20 18:28:47,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:47,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883127753] [2022-02-20 18:28:47,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:47,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:47,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {1890#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; {1890#true} is VALID [2022-02-20 18:28:47,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {1890#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret20#1, main_#t~ret21#1, main_#t~post22#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1890#true} is VALID [2022-02-20 18:28:47,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {1890#true} assume 0 == ~r1~0; {1890#true} is VALID [2022-02-20 18:28:47,091 INFO L290 TraceCheckUtils]: 3: Hoare triple {1890#true} assume ~id1~0 >= 0; {1890#true} is VALID [2022-02-20 18:28:47,091 INFO L290 TraceCheckUtils]: 4: Hoare triple {1890#true} assume 0 == ~st1~0; {1890#true} is VALID [2022-02-20 18:28:47,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {1890#true} assume ~send1~0 == ~id1~0; {1890#true} is VALID [2022-02-20 18:28:47,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {1890#true} assume 0 == ~mode1~0 % 256; {1890#true} is VALID [2022-02-20 18:28:47,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {1890#true} assume ~id2~0 >= 0; {1890#true} is VALID [2022-02-20 18:28:47,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {1890#true} assume 0 == ~st2~0; {1890#true} is VALID [2022-02-20 18:28:47,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {1890#true} assume ~send2~0 == ~id2~0; {1890#true} is VALID [2022-02-20 18:28:47,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {1890#true} assume 0 == ~mode2~0 % 256; {1890#true} is VALID [2022-02-20 18:28:47,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {1890#true} assume ~id3~0 >= 0; {1890#true} is VALID [2022-02-20 18:28:47,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {1890#true} assume 0 == ~st3~0; {1890#true} is VALID [2022-02-20 18:28:47,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {1890#true} assume ~send3~0 == ~id3~0; {1890#true} is VALID [2022-02-20 18:28:47,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {1890#true} assume 0 == ~mode3~0 % 256; {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:47,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:47,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:47,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:47,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:47,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:47,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == main_~i2~0#1); {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:47,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:47,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:47,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:47,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:47,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:47,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:47,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:47,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:47,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:47,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:47,099 INFO L290 TraceCheckUtils]: 31: Hoare triple {1892#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1891#false} is VALID [2022-02-20 18:28:47,099 INFO L290 TraceCheckUtils]: 32: Hoare triple {1891#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1891#false} is VALID [2022-02-20 18:28:47,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {1891#false} ~mode3~0 := 0; {1891#false} is VALID [2022-02-20 18:28:47,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {1891#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1891#false} is VALID [2022-02-20 18:28:47,100 INFO L290 TraceCheckUtils]: 35: Hoare triple {1891#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1891#false} is VALID [2022-02-20 18:28:47,100 INFO L290 TraceCheckUtils]: 36: Hoare triple {1891#false} check_#res#1 := check_~tmp~1#1; {1891#false} is VALID [2022-02-20 18:28:47,105 INFO L290 TraceCheckUtils]: 37: Hoare triple {1891#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1891#false} is VALID [2022-02-20 18:28:47,106 INFO L290 TraceCheckUtils]: 38: Hoare triple {1891#false} assume 0 == assert_~arg#1 % 256; {1891#false} is VALID [2022-02-20 18:28:47,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {1891#false} assume !false; {1891#false} is VALID [2022-02-20 18:28:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:47,106 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:47,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883127753] [2022-02-20 18:28:47,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883127753] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:47,107 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:47,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:47,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537093960] [2022-02-20 18:28:47,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:47,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:47,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:47,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:47,129 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:28:47,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:47,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:47,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:47,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:47,130 INFO L87 Difference]: Start difference. First operand 136 states and 199 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:47,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:47,229 INFO L93 Difference]: Finished difference Result 340 states and 513 transitions. [2022-02-20 18:28:47,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:47,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:47,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:47,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2022-02-20 18:28:47,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:47,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2022-02-20 18:28:47,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 180 transitions. [2022-02-20 18:28:47,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:47,348 INFO L225 Difference]: With dead ends: 340 [2022-02-20 18:28:47,348 INFO L226 Difference]: Without dead ends: 226 [2022-02-20 18:28:47,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:47,353 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 38 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 172 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:28:47,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 172 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:47,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-02-20 18:28:47,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2022-02-20 18:28:47,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:47,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 224 states, 223 states have (on average 1.484304932735426) internal successors, (331), 223 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:47,367 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 224 states, 223 states have (on average 1.484304932735426) internal successors, (331), 223 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:47,367 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 224 states, 223 states have (on average 1.484304932735426) internal successors, (331), 223 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:47,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:47,372 INFO L93 Difference]: Finished difference Result 226 states and 332 transitions. [2022-02-20 18:28:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 332 transitions. [2022-02-20 18:28:47,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:47,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:47,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 224 states, 223 states have (on average 1.484304932735426) internal successors, (331), 223 states have internal predecessors, (331), 0 states have call successors, (0), 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 226 states. [2022-02-20 18:28:47,373 INFO L87 Difference]: Start difference. First operand has 224 states, 223 states have (on average 1.484304932735426) internal successors, (331), 223 states have internal predecessors, (331), 0 states have call successors, (0), 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 226 states. [2022-02-20 18:28:47,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:47,378 INFO L93 Difference]: Finished difference Result 226 states and 332 transitions. [2022-02-20 18:28:47,378 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 332 transitions. [2022-02-20 18:28:47,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:47,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:47,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:47,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.484304932735426) internal successors, (331), 223 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 331 transitions. [2022-02-20 18:28:47,383 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 331 transitions. Word has length 40 [2022-02-20 18:28:47,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:47,384 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 331 transitions. [2022-02-20 18:28:47,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:28:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 331 transitions. [2022-02-20 18:28:47,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 18:28:47,384 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:47,384 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:28:47,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:28:47,385 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:47,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:47,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1338118322, now seen corresponding path program 1 times [2022-02-20 18:28:47,385 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:47,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469233084] [2022-02-20 18:28:47,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:47,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:47,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {3033#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; {3033#true} is VALID [2022-02-20 18:28:47,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {3033#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret20#1, main_#t~ret21#1, main_#t~post22#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {3033#true} is VALID [2022-02-20 18:28:47,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {3033#true} assume 0 == ~r1~0; {3033#true} is VALID [2022-02-20 18:28:47,447 INFO L290 TraceCheckUtils]: 3: Hoare triple {3033#true} assume ~id1~0 >= 0; {3033#true} is VALID [2022-02-20 18:28:47,448 INFO L290 TraceCheckUtils]: 4: Hoare triple {3033#true} assume 0 == ~st1~0; {3035#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:47,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {3035#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {3035#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:47,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {3035#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {3035#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:47,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {3035#(<= ~st1~0 0)} assume ~id2~0 >= 0; {3035#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:47,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {3035#(<= ~st1~0 0)} assume 0 == ~st2~0; {3036#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {3036#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {3036#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {3036#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {3036#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {3036#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {3036#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {3036#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~i2~0#1); {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,457 INFO L290 TraceCheckUtils]: 28: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,458 INFO L290 TraceCheckUtils]: 32: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:47,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {3037#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {3034#false} is VALID [2022-02-20 18:28:47,462 INFO L290 TraceCheckUtils]: 36: Hoare triple {3034#false} check_#res#1 := check_~tmp~1#1; {3034#false} is VALID [2022-02-20 18:28:47,462 INFO L290 TraceCheckUtils]: 37: Hoare triple {3034#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3034#false} is VALID [2022-02-20 18:28:47,462 INFO L290 TraceCheckUtils]: 38: Hoare triple {3034#false} assume 0 == assert_~arg#1 % 256; {3034#false} is VALID [2022-02-20 18:28:47,462 INFO L290 TraceCheckUtils]: 39: Hoare triple {3034#false} assume !false; {3034#false} is VALID [2022-02-20 18:28:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:47,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:47,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469233084] [2022-02-20 18:28:47,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469233084] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:47,463 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:47,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:28:47,463 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758464603] [2022-02-20 18:28:47,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:47,464 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:28:47,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:47,464 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:28:47,487 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:28:47,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:28:47,487 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:47,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:28:47,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:28:47,488 INFO L87 Difference]: Start difference. First operand 224 states and 331 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:28:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:48,107 INFO L93 Difference]: Finished difference Result 1436 states and 2185 transitions. [2022-02-20 18:28:48,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:28:48,107 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:28:48,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:48,107 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:28:48,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 414 transitions. [2022-02-20 18:28:48,110 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:28:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 414 transitions. [2022-02-20 18:28:48,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 414 transitions. [2022-02-20 18:28:48,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 414 edges. 414 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:48,400 INFO L225 Difference]: With dead ends: 1436 [2022-02-20 18:28:48,400 INFO L226 Difference]: Without dead ends: 1234 [2022-02-20 18:28:48,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:28:48,401 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 385 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:48,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 371 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:48,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-02-20 18:28:48,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 424. [2022-02-20 18:28:48,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:48,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1234 states. Second operand has 424 states, 423 states have (on average 1.4728132387706856) internal successors, (623), 423 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:48,527 INFO L74 IsIncluded]: Start isIncluded. First operand 1234 states. Second operand has 424 states, 423 states have (on average 1.4728132387706856) internal successors, (623), 423 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:48,528 INFO L87 Difference]: Start difference. First operand 1234 states. Second operand has 424 states, 423 states have (on average 1.4728132387706856) internal successors, (623), 423 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:48,572 INFO L93 Difference]: Finished difference Result 1234 states and 1828 transitions. [2022-02-20 18:28:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1828 transitions. [2022-02-20 18:28:48,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:48,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:48,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 424 states, 423 states have (on average 1.4728132387706856) internal successors, (623), 423 states have internal predecessors, (623), 0 states have call successors, (0), 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 1234 states. [2022-02-20 18:28:48,575 INFO L87 Difference]: Start difference. First operand has 424 states, 423 states have (on average 1.4728132387706856) internal successors, (623), 423 states have internal predecessors, (623), 0 states have call successors, (0), 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 1234 states. [2022-02-20 18:28:48,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:48,619 INFO L93 Difference]: Finished difference Result 1234 states and 1828 transitions. [2022-02-20 18:28:48,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1828 transitions. [2022-02-20 18:28:48,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:48,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:48,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:48,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 423 states have (on average 1.4728132387706856) internal successors, (623), 423 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:48,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 623 transitions. [2022-02-20 18:28:48,632 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 623 transitions. Word has length 40 [2022-02-20 18:28:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:48,632 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 623 transitions. [2022-02-20 18:28:48,632 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:28:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 623 transitions. [2022-02-20 18:28:48,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:28:48,633 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:48,633 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:28:48,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:28:48,633 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:48,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:48,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1209274118, now seen corresponding path program 1 times [2022-02-20 18:28:48,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:48,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727002062] [2022-02-20 18:28:48,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:48,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:48,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {7809#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; {7809#true} is VALID [2022-02-20 18:28:48,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {7809#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret20#1, main_#t~ret21#1, main_#t~post22#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {7809#true} is VALID [2022-02-20 18:28:48,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {7809#true} assume 0 == ~r1~0; {7809#true} is VALID [2022-02-20 18:28:48,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {7809#true} assume ~id1~0 >= 0; {7809#true} is VALID [2022-02-20 18:28:48,747 INFO L290 TraceCheckUtils]: 4: Hoare triple {7809#true} assume 0 == ~st1~0; {7811#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:28:48,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {7811#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send1~0 == ~id1~0; {7811#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:28:48,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {7811#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode1~0 % 256; {7811#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:28:48,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {7811#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id2~0 >= 0; {7811#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:28:48,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {7811#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st2~0; {7812#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:28:48,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {7812#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {7812#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:28:48,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {7812#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {7812#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:28:48,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {7812#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {7812#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:28:48,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {7812#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 == ~id3~0; {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode3~0 % 256; {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} init_#res#1 := init_~tmp~0#1; {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == main_~i2~0#1); {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,756 INFO L290 TraceCheckUtils]: 23: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode1~0 % 256); {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,757 INFO L290 TraceCheckUtils]: 27: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode2~0 % 256); {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,763 INFO L290 TraceCheckUtils]: 30: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,764 INFO L290 TraceCheckUtils]: 31: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode3~0 % 256); {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,768 INFO L290 TraceCheckUtils]: 35: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 >= 3); {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:48,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {7813#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {7810#false} is VALID [2022-02-20 18:28:48,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {7810#false} check_#res#1 := check_~tmp~1#1; {7810#false} is VALID [2022-02-20 18:28:48,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {7810#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {7810#false} is VALID [2022-02-20 18:28:48,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {7810#false} assume 0 == assert_~arg#1 % 256; {7810#false} is VALID [2022-02-20 18:28:48,771 INFO L290 TraceCheckUtils]: 41: Hoare triple {7810#false} assume !false; {7810#false} is VALID [2022-02-20 18:28:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:48,771 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:48,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727002062] [2022-02-20 18:28:48,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727002062] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:48,772 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:48,772 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:28:48,772 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819885489] [2022-02-20 18:28:48,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:48,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 18:28:48,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:48,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:48,796 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:28:48,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:28:48,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:48,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:28:48,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:28:48,797 INFO L87 Difference]: Start difference. First operand 424 states and 623 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:49,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:49,111 INFO L93 Difference]: Finished difference Result 828 states and 1225 transitions. [2022-02-20 18:28:49,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:28:49,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 18:28:49,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2022-02-20 18:28:49,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:49,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2022-02-20 18:28:49,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 188 transitions. [2022-02-20 18:28:49,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:49,225 INFO L225 Difference]: With dead ends: 828 [2022-02-20 18:28:49,225 INFO L226 Difference]: Without dead ends: 426 [2022-02-20 18:28:49,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:28:49,226 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 124 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:49,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 180 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:49,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-02-20 18:28:49,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 424. [2022-02-20 18:28:49,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:49,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 426 states. Second operand has 424 states, 423 states have (on average 1.4539007092198581) internal successors, (615), 423 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:49,352 INFO L74 IsIncluded]: Start isIncluded. First operand 426 states. Second operand has 424 states, 423 states have (on average 1.4539007092198581) internal successors, (615), 423 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:49,352 INFO L87 Difference]: Start difference. First operand 426 states. Second operand has 424 states, 423 states have (on average 1.4539007092198581) internal successors, (615), 423 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:49,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:49,359 INFO L93 Difference]: Finished difference Result 426 states and 616 transitions. [2022-02-20 18:28:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 616 transitions. [2022-02-20 18:28:49,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:49,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:49,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 424 states, 423 states have (on average 1.4539007092198581) internal successors, (615), 423 states have internal predecessors, (615), 0 states have call successors, (0), 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 426 states. [2022-02-20 18:28:49,361 INFO L87 Difference]: Start difference. First operand has 424 states, 423 states have (on average 1.4539007092198581) internal successors, (615), 423 states have internal predecessors, (615), 0 states have call successors, (0), 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 426 states. [2022-02-20 18:28:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:49,369 INFO L93 Difference]: Finished difference Result 426 states and 616 transitions. [2022-02-20 18:28:49,369 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 616 transitions. [2022-02-20 18:28:49,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:49,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:49,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:49,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 423 states have (on average 1.4539007092198581) internal successors, (615), 423 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 615 transitions. [2022-02-20 18:28:49,378 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 615 transitions. Word has length 42 [2022-02-20 18:28:49,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:49,378 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 615 transitions. [2022-02-20 18:28:49,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 615 transitions. [2022-02-20 18:28:49,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:28:49,379 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:49,379 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:28:49,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:28:49,379 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:49,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:49,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1142780606, now seen corresponding path program 1 times [2022-02-20 18:28:49,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:49,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391584558] [2022-02-20 18:28:49,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:49,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:49,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {10212#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; {10212#true} is VALID [2022-02-20 18:28:49,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {10212#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret20#1, main_#t~ret21#1, main_#t~post22#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {10212#true} is VALID [2022-02-20 18:28:49,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {10212#true} assume 0 == ~r1~0; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,418 INFO L290 TraceCheckUtils]: 3: Hoare triple {10214#(<= ~r1~0 0)} assume ~id1~0 >= 0; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,418 INFO L290 TraceCheckUtils]: 4: Hoare triple {10214#(<= ~r1~0 0)} assume 0 == ~st1~0; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {10214#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {10214#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {10214#(<= ~r1~0 0)} assume ~id2~0 >= 0; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {10214#(<= ~r1~0 0)} assume 0 == ~st2~0; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {10214#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {10214#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {10214#(<= ~r1~0 0)} assume ~id3~0 >= 0; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {10214#(<= ~r1~0 0)} assume 0 == ~st3~0; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {10214#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {10214#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {10214#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {10214#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {10214#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {10214#(<= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {10214#(<= ~r1~0 0)} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {10214#(<= ~r1~0 0)} assume !(0 == main_~i2~0#1); {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {10214#(<= ~r1~0 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {10214#(<= ~r1~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {10214#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {10214#(<= ~r1~0 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {10214#(<= ~r1~0 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {10214#(<= ~r1~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {10214#(<= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {10214#(<= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {10214#(<= ~r1~0 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {10214#(<= ~r1~0 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {10214#(<= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,426 INFO L290 TraceCheckUtils]: 32: Hoare triple {10214#(<= ~r1~0 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {10214#(<= ~r1~0 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {10214#(<= ~r1~0 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {10214#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {10214#(<= ~r1~0 0)} is VALID [2022-02-20 18:28:49,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {10214#(<= ~r1~0 0)} assume ~r1~0 >= 3; {10213#false} is VALID [2022-02-20 18:28:49,427 INFO L290 TraceCheckUtils]: 37: Hoare triple {10213#false} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {10213#false} is VALID [2022-02-20 18:28:49,427 INFO L290 TraceCheckUtils]: 38: Hoare triple {10213#false} check_#res#1 := check_~tmp~1#1; {10213#false} is VALID [2022-02-20 18:28:49,427 INFO L290 TraceCheckUtils]: 39: Hoare triple {10213#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {10213#false} is VALID [2022-02-20 18:28:49,427 INFO L290 TraceCheckUtils]: 40: Hoare triple {10213#false} assume 0 == assert_~arg#1 % 256; {10213#false} is VALID [2022-02-20 18:28:49,427 INFO L290 TraceCheckUtils]: 41: Hoare triple {10213#false} assume !false; {10213#false} is VALID [2022-02-20 18:28:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:49,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:49,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391584558] [2022-02-20 18:28:49,428 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391584558] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:49,428 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:49,428 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:49,428 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013444057] [2022-02-20 18:28:49,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:49,429 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:28:49,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:49,429 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:28:49,450 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:28:49,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:49,450 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:49,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:49,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:49,451 INFO L87 Difference]: Start difference. First operand 424 states and 615 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:28:49,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:49,729 INFO L93 Difference]: Finished difference Result 1010 states and 1475 transitions. [2022-02-20 18:28:49,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:49,729 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:28:49,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:49,729 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:28:49,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2022-02-20 18:28:49,730 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:28:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2022-02-20 18:28:49,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 181 transitions. [2022-02-20 18:28:49,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:49,837 INFO L225 Difference]: With dead ends: 1010 [2022-02-20 18:28:49,837 INFO L226 Difference]: Without dead ends: 608 [2022-02-20 18:28:49,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:49,839 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 30 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 144 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:28:49,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 144 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:49,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-02-20 18:28:50,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 606. [2022-02-20 18:28:50,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:50,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 608 states. Second operand has 606 states, 605 states have (on average 1.4363636363636363) internal successors, (869), 605 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,029 INFO L74 IsIncluded]: Start isIncluded. First operand 608 states. Second operand has 606 states, 605 states have (on average 1.4363636363636363) internal successors, (869), 605 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,030 INFO L87 Difference]: Start difference. First operand 608 states. Second operand has 606 states, 605 states have (on average 1.4363636363636363) internal successors, (869), 605 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:50,042 INFO L93 Difference]: Finished difference Result 608 states and 870 transitions. [2022-02-20 18:28:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 870 transitions. [2022-02-20 18:28:50,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:50,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:50,045 INFO L74 IsIncluded]: Start isIncluded. First operand has 606 states, 605 states have (on average 1.4363636363636363) internal successors, (869), 605 states have internal predecessors, (869), 0 states have call successors, (0), 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 608 states. [2022-02-20 18:28:50,046 INFO L87 Difference]: Start difference. First operand has 606 states, 605 states have (on average 1.4363636363636363) internal successors, (869), 605 states have internal predecessors, (869), 0 states have call successors, (0), 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 608 states. [2022-02-20 18:28:50,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:50,058 INFO L93 Difference]: Finished difference Result 608 states and 870 transitions. [2022-02-20 18:28:50,058 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 870 transitions. [2022-02-20 18:28:50,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:50,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:50,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:50,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 605 states have (on average 1.4363636363636363) internal successors, (869), 605 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 869 transitions. [2022-02-20 18:28:50,079 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 869 transitions. Word has length 42 [2022-02-20 18:28:50,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:50,080 INFO L470 AbstractCegarLoop]: Abstraction has 606 states and 869 transitions. [2022-02-20 18:28:50,080 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:28:50,080 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 869 transitions. [2022-02-20 18:28:50,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 18:28:50,080 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:50,080 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:28:50,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:28:50,081 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:50,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:50,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1581931209, now seen corresponding path program 1 times [2022-02-20 18:28:50,081 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:50,081 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398043055] [2022-02-20 18:28:50,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:50,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:50,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {13429#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; {13431#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:28:50,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {13431#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret20#1, main_#t~ret21#1, main_#t~post22#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {13431#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:28:50,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {13431#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {13431#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:28:50,152 INFO L290 TraceCheckUtils]: 3: Hoare triple {13431#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {13432#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:28:50,152 INFO L290 TraceCheckUtils]: 4: Hoare triple {13432#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {13432#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:28:50,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {13432#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {13433#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:28:50,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {13433#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {13433#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:28:50,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {13433#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {13433#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:28:50,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {13433#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {13433#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:28:50,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {13433#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {13433#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:28:50,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {13433#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {13433#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:28:50,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {13433#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {13433#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:28:50,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {13433#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {13433#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:28:50,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {13433#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {13433#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:28:50,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {13433#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {13433#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:28:50,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {13433#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {13433#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:28:50,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {13433#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {13433#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:28:50,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {13433#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {13433#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:28:50,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {13433#(<= (+ ~nomsg~0 1) ~send1~0)} init_#res#1 := init_~tmp~0#1; {13433#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:28:50,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {13433#(<= (+ ~nomsg~0 1) ~send1~0)} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; {13433#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:28:50,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {13433#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(0 == main_~i2~0#1); {13433#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:28:50,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {13433#(<= (+ ~nomsg~0 1) ~send1~0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {13434#(and (= (+ (* (- 1) ~p1_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send1~0))} is VALID [2022-02-20 18:28:50,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {13434#(and (= (+ (* (- 1) ~p1_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send1~0))} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {13434#(and (= (+ (* (- 1) ~p1_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send1~0))} is VALID [2022-02-20 18:28:50,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {13434#(and (= (+ (* (- 1) ~p1_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send1~0))} assume !(0 != ~mode1~0 % 256); {13434#(and (= (+ (* (- 1) ~p1_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send1~0))} is VALID [2022-02-20 18:28:50,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {13434#(and (= (+ (* (- 1) ~p1_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send1~0))} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {13430#false} is VALID [2022-02-20 18:28:50,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {13430#false} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {13430#false} is VALID [2022-02-20 18:28:50,159 INFO L290 TraceCheckUtils]: 26: Hoare triple {13430#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {13430#false} is VALID [2022-02-20 18:28:50,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {13430#false} assume !(0 != ~mode2~0 % 256); {13430#false} is VALID [2022-02-20 18:28:50,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {13430#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {13430#false} is VALID [2022-02-20 18:28:50,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {13430#false} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {13430#false} is VALID [2022-02-20 18:28:50,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {13430#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {13430#false} is VALID [2022-02-20 18:28:50,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {13430#false} assume !(0 != ~mode3~0 % 256); {13430#false} is VALID [2022-02-20 18:28:50,160 INFO L290 TraceCheckUtils]: 32: Hoare triple {13430#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {13430#false} is VALID [2022-02-20 18:28:50,160 INFO L290 TraceCheckUtils]: 33: Hoare triple {13430#false} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {13430#false} is VALID [2022-02-20 18:28:50,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {13430#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {13430#false} is VALID [2022-02-20 18:28:50,160 INFO L290 TraceCheckUtils]: 35: Hoare triple {13430#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {13430#false} is VALID [2022-02-20 18:28:50,160 INFO L290 TraceCheckUtils]: 36: Hoare triple {13430#false} assume !(~r1~0 >= 3); {13430#false} is VALID [2022-02-20 18:28:50,160 INFO L290 TraceCheckUtils]: 37: Hoare triple {13430#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {13430#false} is VALID [2022-02-20 18:28:50,160 INFO L290 TraceCheckUtils]: 38: Hoare triple {13430#false} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {13430#false} is VALID [2022-02-20 18:28:50,161 INFO L290 TraceCheckUtils]: 39: Hoare triple {13430#false} check_#res#1 := check_~tmp~1#1; {13430#false} is VALID [2022-02-20 18:28:50,161 INFO L290 TraceCheckUtils]: 40: Hoare triple {13430#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {13430#false} is VALID [2022-02-20 18:28:50,161 INFO L290 TraceCheckUtils]: 41: Hoare triple {13430#false} assume 0 == assert_~arg#1 % 256; {13430#false} is VALID [2022-02-20 18:28:50,161 INFO L290 TraceCheckUtils]: 42: Hoare triple {13430#false} assume !false; {13430#false} is VALID [2022-02-20 18:28:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:50,161 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:50,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398043055] [2022-02-20 18:28:50,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398043055] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:50,162 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:50,162 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:28:50,162 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226294077] [2022-02-20 18:28:50,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:50,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) 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:28:50,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:50,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.166666666666667) 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:28:50,184 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:28:50,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:28:50,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:50,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:28:50,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:28:50,186 INFO L87 Difference]: Start difference. First operand 606 states and 869 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) 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:28:51,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:51,179 INFO L93 Difference]: Finished difference Result 1686 states and 2443 transitions. [2022-02-20 18:28:51,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:28:51,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) 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:28:51,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:51,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) 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:28:51,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 218 transitions. [2022-02-20 18:28:51,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) 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:28:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 218 transitions. [2022-02-20 18:28:51,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 218 transitions. [2022-02-20 18:28:51,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:51,370 INFO L225 Difference]: With dead ends: 1686 [2022-02-20 18:28:51,371 INFO L226 Difference]: Without dead ends: 1104 [2022-02-20 18:28:51,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:28:51,372 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 366 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:51,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 141 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:28:51,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2022-02-20 18:28:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1006. [2022-02-20 18:28:51,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:51,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1104 states. Second operand has 1006 states, 1005 states have (on average 1.4378109452736318) internal successors, (1445), 1005 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:51,970 INFO L74 IsIncluded]: Start isIncluded. First operand 1104 states. Second operand has 1006 states, 1005 states have (on average 1.4378109452736318) internal successors, (1445), 1005 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:51,971 INFO L87 Difference]: Start difference. First operand 1104 states. Second operand has 1006 states, 1005 states have (on average 1.4378109452736318) internal successors, (1445), 1005 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:52,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:52,005 INFO L93 Difference]: Finished difference Result 1104 states and 1582 transitions. [2022-02-20 18:28:52,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1582 transitions. [2022-02-20 18:28:52,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:52,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:52,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 1006 states, 1005 states have (on average 1.4378109452736318) internal successors, (1445), 1005 states have internal predecessors, (1445), 0 states have call successors, (0), 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 1104 states. [2022-02-20 18:28:52,008 INFO L87 Difference]: Start difference. First operand has 1006 states, 1005 states have (on average 1.4378109452736318) internal successors, (1445), 1005 states have internal predecessors, (1445), 0 states have call successors, (0), 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 1104 states. [2022-02-20 18:28:52,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:52,041 INFO L93 Difference]: Finished difference Result 1104 states and 1582 transitions. [2022-02-20 18:28:52,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1582 transitions. [2022-02-20 18:28:52,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:52,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:52,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:52,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 1005 states have (on average 1.4378109452736318) internal successors, (1445), 1005 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1445 transitions. [2022-02-20 18:28:52,078 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1445 transitions. Word has length 43 [2022-02-20 18:28:52,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:52,078 INFO L470 AbstractCegarLoop]: Abstraction has 1006 states and 1445 transitions. [2022-02-20 18:28:52,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) 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:28:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1445 transitions. [2022-02-20 18:28:52,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 18:28:52,079 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:52,080 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:28:52,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:28:52,080 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:52,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:52,080 INFO L85 PathProgramCache]: Analyzing trace with hash 107012533, now seen corresponding path program 1 times [2022-02-20 18:28:52,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:52,081 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660592069] [2022-02-20 18:28:52,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:52,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:52,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {18983#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; {18983#true} is VALID [2022-02-20 18:28:52,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {18983#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret20#1, main_#t~ret21#1, main_#t~post22#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {18983#true} is VALID [2022-02-20 18:28:52,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {18983#true} assume 0 == ~r1~0; {18983#true} is VALID [2022-02-20 18:28:52,162 INFO L290 TraceCheckUtils]: 3: Hoare triple {18983#true} assume ~id1~0 >= 0; {18983#true} is VALID [2022-02-20 18:28:52,162 INFO L290 TraceCheckUtils]: 4: Hoare triple {18983#true} assume 0 == ~st1~0; {18983#true} is VALID [2022-02-20 18:28:52,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {18983#true} assume ~send1~0 == ~id1~0; {18983#true} is VALID [2022-02-20 18:28:52,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {18983#true} assume 0 == ~mode1~0 % 256; {18983#true} is VALID [2022-02-20 18:28:52,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {18983#true} assume ~id2~0 >= 0; {18983#true} is VALID [2022-02-20 18:28:52,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {18983#true} assume 0 == ~st2~0; {18983#true} is VALID [2022-02-20 18:28:52,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {18983#true} assume ~send2~0 == ~id2~0; {18983#true} is VALID [2022-02-20 18:28:52,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {18983#true} assume 0 == ~mode2~0 % 256; {18983#true} is VALID [2022-02-20 18:28:52,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {18983#true} assume ~id3~0 >= 0; {18983#true} is VALID [2022-02-20 18:28:52,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {18983#true} assume 0 == ~st3~0; {18983#true} is VALID [2022-02-20 18:28:52,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {18983#true} assume ~send3~0 == ~id3~0; {18983#true} is VALID [2022-02-20 18:28:52,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {18983#true} assume 0 == ~mode3~0 % 256; {18983#true} is VALID [2022-02-20 18:28:52,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {18983#true} assume ~id1~0 != ~id2~0; {18983#true} is VALID [2022-02-20 18:28:52,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {18983#true} assume ~id1~0 != ~id3~0; {18983#true} is VALID [2022-02-20 18:28:52,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {18983#true} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {18983#true} is VALID [2022-02-20 18:28:52,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {18983#true} init_#res#1 := init_~tmp~0#1; {18983#true} is VALID [2022-02-20 18:28:52,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {18983#true} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; {18983#true} is VALID [2022-02-20 18:28:52,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {18983#true} assume !(0 == main_~i2~0#1); {18983#true} is VALID [2022-02-20 18:28:52,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {18983#true} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {18983#true} is VALID [2022-02-20 18:28:52,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {18983#true} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {18983#true} is VALID [2022-02-20 18:28:52,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {18983#true} assume !(0 != ~mode1~0 % 256); {18983#true} is VALID [2022-02-20 18:28:52,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {18983#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {18983#true} is VALID [2022-02-20 18:28:52,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {18983#true} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {18983#true} is VALID [2022-02-20 18:28:52,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {18983#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {18983#true} is VALID [2022-02-20 18:28:52,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {18983#true} assume !(0 != ~mode2~0 % 256); {18983#true} is VALID [2022-02-20 18:28:52,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {18983#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {18983#true} is VALID [2022-02-20 18:28:52,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {18983#true} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {18983#true} is VALID [2022-02-20 18:28:52,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {18983#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {18983#true} is VALID [2022-02-20 18:28:52,166 INFO L290 TraceCheckUtils]: 31: Hoare triple {18983#true} assume !(0 != ~mode3~0 % 256); {18983#true} is VALID [2022-02-20 18:28:52,167 INFO L290 TraceCheckUtils]: 32: Hoare triple {18983#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {18983#true} is VALID [2022-02-20 18:28:52,167 INFO L290 TraceCheckUtils]: 33: Hoare triple {18983#true} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {18983#true} is VALID [2022-02-20 18:28:52,167 INFO L290 TraceCheckUtils]: 34: Hoare triple {18983#true} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {18983#true} is VALID [2022-02-20 18:28:52,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {18983#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {18983#true} is VALID [2022-02-20 18:28:52,170 INFO L290 TraceCheckUtils]: 36: Hoare triple {18983#true} assume !(~r1~0 >= 3); {18983#true} is VALID [2022-02-20 18:28:52,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {18983#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {18983#true} is VALID [2022-02-20 18:28:52,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {18983#true} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {18985#(= |ULTIMATE.start_check_~tmp~1#1| 1)} is VALID [2022-02-20 18:28:52,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {18985#(= |ULTIMATE.start_check_~tmp~1#1| 1)} check_#res#1 := check_~tmp~1#1; {18986#(= 1 |ULTIMATE.start_check_#res#1|)} is VALID [2022-02-20 18:28:52,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {18986#(= 1 |ULTIMATE.start_check_#res#1|)} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {18987#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 18:28:52,172 INFO L290 TraceCheckUtils]: 41: Hoare triple {18987#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {18984#false} is VALID [2022-02-20 18:28:52,172 INFO L290 TraceCheckUtils]: 42: Hoare triple {18984#false} assume !false; {18984#false} is VALID [2022-02-20 18:28:52,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:52,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:52,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660592069] [2022-02-20 18:28:52,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660592069] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:52,174 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:52,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:28:52,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984857620] [2022-02-20 18:28:52,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:52,174 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:28:52,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:52,175 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:28:52,195 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:28:52,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:28:52,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:52,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:28:52,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:28:52,196 INFO L87 Difference]: Start difference. First operand 1006 states and 1445 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:28:54,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:54,011 INFO L93 Difference]: Finished difference Result 1993 states and 2820 transitions. [2022-02-20 18:28:54,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:28:54,012 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:28:54,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:54,012 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:28:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2022-02-20 18:28:54,013 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:28:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2022-02-20 18:28:54,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 138 transitions. [2022-02-20 18:28:54,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:54,226 INFO L225 Difference]: With dead ends: 1993 [2022-02-20 18:28:54,226 INFO L226 Difference]: Without dead ends: 1991 [2022-02-20 18:28:54,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:28:54,227 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 139 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:54,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 321 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:54,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2022-02-20 18:28:55,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1102. [2022-02-20 18:28:55,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:55,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1991 states. Second operand has 1102 states, 1101 states have (on average 1.3960036330608538) internal successors, (1537), 1101 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:55,147 INFO L74 IsIncluded]: Start isIncluded. First operand 1991 states. Second operand has 1102 states, 1101 states have (on average 1.3960036330608538) internal successors, (1537), 1101 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:55,148 INFO L87 Difference]: Start difference. First operand 1991 states. Second operand has 1102 states, 1101 states have (on average 1.3960036330608538) internal successors, (1537), 1101 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:55,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:55,247 INFO L93 Difference]: Finished difference Result 1991 states and 2783 transitions. [2022-02-20 18:28:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 2783 transitions. [2022-02-20 18:28:55,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:55,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:55,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 1102 states, 1101 states have (on average 1.3960036330608538) internal successors, (1537), 1101 states have internal predecessors, (1537), 0 states have call successors, (0), 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 1991 states. [2022-02-20 18:28:55,252 INFO L87 Difference]: Start difference. First operand has 1102 states, 1101 states have (on average 1.3960036330608538) internal successors, (1537), 1101 states have internal predecessors, (1537), 0 states have call successors, (0), 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 1991 states. [2022-02-20 18:28:55,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:55,353 INFO L93 Difference]: Finished difference Result 1991 states and 2783 transitions. [2022-02-20 18:28:55,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 2783 transitions. [2022-02-20 18:28:55,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:55,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:55,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:55,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 1101 states have (on average 1.3960036330608538) internal successors, (1537), 1101 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1537 transitions. [2022-02-20 18:28:55,393 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1537 transitions. Word has length 43 [2022-02-20 18:28:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:55,393 INFO L470 AbstractCegarLoop]: Abstraction has 1102 states and 1537 transitions. [2022-02-20 18:28:55,393 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:28:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1537 transitions. [2022-02-20 18:28:55,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:28:55,394 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:55,394 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:28:55,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:28:55,394 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:55,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:55,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1027002802, now seen corresponding path program 1 times [2022-02-20 18:28:55,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:55,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510808990] [2022-02-20 18:28:55,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:55,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:55,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {26857#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; {26857#true} is VALID [2022-02-20 18:28:55,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {26857#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret20#1, main_#t~ret21#1, main_#t~post22#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {26857#true} is VALID [2022-02-20 18:28:55,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {26857#true} assume 0 == ~r1~0; {26857#true} is VALID [2022-02-20 18:28:55,456 INFO L290 TraceCheckUtils]: 3: Hoare triple {26857#true} assume ~id1~0 >= 0; {26857#true} is VALID [2022-02-20 18:28:55,456 INFO L290 TraceCheckUtils]: 4: Hoare triple {26857#true} assume 0 == ~st1~0; {26859#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:55,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {26859#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {26859#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:55,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {26859#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {26859#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:55,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {26859#(<= ~st1~0 0)} assume ~id2~0 >= 0; {26859#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:55,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {26859#(<= ~st1~0 0)} assume 0 == ~st2~0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == main_~i2~0#1); {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,467 INFO L290 TraceCheckUtils]: 41: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_assert } true;main_#t~post22#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,468 INFO L290 TraceCheckUtils]: 43: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,468 INFO L290 TraceCheckUtils]: 45: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node1_~m1~0#1 != ~nomsg~0); {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,469 INFO L290 TraceCheckUtils]: 46: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,469 INFO L290 TraceCheckUtils]: 47: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,469 INFO L290 TraceCheckUtils]: 48: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,469 INFO L290 TraceCheckUtils]: 49: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node2_~m2~0#1 != ~nomsg~0); {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,470 INFO L290 TraceCheckUtils]: 50: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,470 INFO L290 TraceCheckUtils]: 51: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,470 INFO L290 TraceCheckUtils]: 52: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,471 INFO L290 TraceCheckUtils]: 53: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 != ~nomsg~0; {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,471 INFO L290 TraceCheckUtils]: 54: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node3_~m3~0#1 > ~id3~0); {26860#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,471 INFO L290 TraceCheckUtils]: 55: Hoare triple {26860#(<= (+ ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {26861#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:55,472 INFO L290 TraceCheckUtils]: 56: Hoare triple {26861#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {26861#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:55,472 INFO L290 TraceCheckUtils]: 57: Hoare triple {26861#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {26861#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:55,472 INFO L290 TraceCheckUtils]: 58: Hoare triple {26861#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {26858#false} is VALID [2022-02-20 18:28:55,472 INFO L290 TraceCheckUtils]: 59: Hoare triple {26858#false} check_#res#1 := check_~tmp~1#1; {26858#false} is VALID [2022-02-20 18:28:55,473 INFO L290 TraceCheckUtils]: 60: Hoare triple {26858#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {26858#false} is VALID [2022-02-20 18:28:55,473 INFO L290 TraceCheckUtils]: 61: Hoare triple {26858#false} assume 0 == assert_~arg#1 % 256; {26858#false} is VALID [2022-02-20 18:28:55,473 INFO L290 TraceCheckUtils]: 62: Hoare triple {26858#false} assume !false; {26858#false} is VALID [2022-02-20 18:28:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 18:28:55,473 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:55,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510808990] [2022-02-20 18:28:55,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510808990] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:55,474 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:55,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:28:55,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234188449] [2022-02-20 18:28:55,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:55,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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:28:55,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:55,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:55,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:55,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:28:55,507 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:55,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:28:55,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:28:55,507 INFO L87 Difference]: Start difference. First operand 1102 states and 1537 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:59,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:59,169 INFO L93 Difference]: Finished difference Result 4698 states and 6565 transitions. [2022-02-20 18:28:59,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:28:59,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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:28:59,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 299 transitions. [2022-02-20 18:28:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 299 transitions. [2022-02-20 18:28:59,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 299 transitions. [2022-02-20 18:28:59,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 299 edges. 299 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:59,810 INFO L225 Difference]: With dead ends: 4698 [2022-02-20 18:28:59,810 INFO L226 Difference]: Without dead ends: 3620 [2022-02-20 18:28:59,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:28:59,813 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 192 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:59,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 306 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:59,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3620 states. [2022-02-20 18:29:01,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3620 to 2178. [2022-02-20 18:29:01,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:01,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3620 states. Second operand has 2178 states, 2177 states have (on average 1.3913642627468994) internal successors, (3029), 2177 states have internal predecessors, (3029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:01,481 INFO L74 IsIncluded]: Start isIncluded. First operand 3620 states. Second operand has 2178 states, 2177 states have (on average 1.3913642627468994) internal successors, (3029), 2177 states have internal predecessors, (3029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:01,483 INFO L87 Difference]: Start difference. First operand 3620 states. Second operand has 2178 states, 2177 states have (on average 1.3913642627468994) internal successors, (3029), 2177 states have internal predecessors, (3029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:01,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:01,820 INFO L93 Difference]: Finished difference Result 3620 states and 5032 transitions. [2022-02-20 18:29:01,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3620 states and 5032 transitions. [2022-02-20 18:29:01,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:01,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:01,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 2178 states, 2177 states have (on average 1.3913642627468994) internal successors, (3029), 2177 states have internal predecessors, (3029), 0 states have call successors, (0), 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 3620 states. [2022-02-20 18:29:01,827 INFO L87 Difference]: Start difference. First operand has 2178 states, 2177 states have (on average 1.3913642627468994) internal successors, (3029), 2177 states have internal predecessors, (3029), 0 states have call successors, (0), 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 3620 states. [2022-02-20 18:29:02,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:02,175 INFO L93 Difference]: Finished difference Result 3620 states and 5032 transitions. [2022-02-20 18:29:02,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3620 states and 5032 transitions. [2022-02-20 18:29:02,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:02,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:02,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:02,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2178 states, 2177 states have (on average 1.3913642627468994) internal successors, (3029), 2177 states have internal predecessors, (3029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 3029 transitions. [2022-02-20 18:29:02,326 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 3029 transitions. Word has length 63 [2022-02-20 18:29:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:02,326 INFO L470 AbstractCegarLoop]: Abstraction has 2178 states and 3029 transitions. [2022-02-20 18:29:02,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 3029 transitions. [2022-02-20 18:29:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:29:02,327 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:02,327 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:02,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:29:02,328 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:02,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:02,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1499181678, now seen corresponding path program 1 times [2022-02-20 18:29:02,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:02,328 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383648726] [2022-02-20 18:29:02,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:02,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:02,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {42689#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; {42689#true} is VALID [2022-02-20 18:29:02,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {42689#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret20#1, main_#t~ret21#1, main_#t~post22#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {42689#true} is VALID [2022-02-20 18:29:02,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {42689#true} assume 0 == ~r1~0; {42689#true} is VALID [2022-02-20 18:29:02,379 INFO L290 TraceCheckUtils]: 3: Hoare triple {42689#true} assume ~id1~0 >= 0; {42689#true} is VALID [2022-02-20 18:29:02,379 INFO L290 TraceCheckUtils]: 4: Hoare triple {42689#true} assume 0 == ~st1~0; {42691#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:02,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {42691#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {42691#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:02,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {42691#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {42691#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:02,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {42691#(<= ~st1~0 0)} assume ~id2~0 >= 0; {42691#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:02,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {42691#(<= ~st1~0 0)} assume 0 == ~st2~0; {42691#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:02,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {42691#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {42691#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:02,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {42691#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {42691#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:02,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {42691#(<= ~st1~0 0)} assume ~id3~0 >= 0; {42691#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:02,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {42691#(<= ~st1~0 0)} assume 0 == ~st3~0; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == main_~i2~0#1); {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,387 INFO L290 TraceCheckUtils]: 34: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,388 INFO L290 TraceCheckUtils]: 36: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,388 INFO L290 TraceCheckUtils]: 37: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,388 INFO L290 TraceCheckUtils]: 39: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,389 INFO L290 TraceCheckUtils]: 40: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,389 INFO L290 TraceCheckUtils]: 41: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_assert } true;main_#t~post22#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,389 INFO L290 TraceCheckUtils]: 43: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume !(node1_~m1~0#1 != ~nomsg~0); {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 0; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,390 INFO L290 TraceCheckUtils]: 47: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,391 INFO L290 TraceCheckUtils]: 48: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,391 INFO L290 TraceCheckUtils]: 49: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 != ~nomsg~0; {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,391 INFO L290 TraceCheckUtils]: 50: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume !(node2_~m2~0#1 > ~id2~0); {42692#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:02,392 INFO L290 TraceCheckUtils]: 51: Hoare triple {42692#(<= (+ ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {42693#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:29:02,392 INFO L290 TraceCheckUtils]: 52: Hoare triple {42693#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0; {42693#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:29:02,392 INFO L290 TraceCheckUtils]: 53: Hoare triple {42693#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {42693#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:29:02,393 INFO L290 TraceCheckUtils]: 54: Hoare triple {42693#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {42693#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:29:02,393 INFO L290 TraceCheckUtils]: 55: Hoare triple {42693#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(node3_~m3~0#1 != ~nomsg~0); {42693#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:29:02,393 INFO L290 TraceCheckUtils]: 56: Hoare triple {42693#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode3~0 := 0; {42693#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:29:02,394 INFO L290 TraceCheckUtils]: 57: Hoare triple {42693#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {42693#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:29:02,394 INFO L290 TraceCheckUtils]: 58: Hoare triple {42693#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {42690#false} is VALID [2022-02-20 18:29:02,394 INFO L290 TraceCheckUtils]: 59: Hoare triple {42690#false} check_#res#1 := check_~tmp~1#1; {42690#false} is VALID [2022-02-20 18:29:02,394 INFO L290 TraceCheckUtils]: 60: Hoare triple {42690#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {42690#false} is VALID [2022-02-20 18:29:02,394 INFO L290 TraceCheckUtils]: 61: Hoare triple {42690#false} assume 0 == assert_~arg#1 % 256; {42690#false} is VALID [2022-02-20 18:29:02,394 INFO L290 TraceCheckUtils]: 62: Hoare triple {42690#false} assume !false; {42690#false} is VALID [2022-02-20 18:29:02,395 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 18:29:02,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:02,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383648726] [2022-02-20 18:29:02,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383648726] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:02,395 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:02,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:29:02,395 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776249575] [2022-02-20 18:29:02,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:02,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 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:29:02,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:02,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:02,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:02,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:29:02,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:02,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:29:02,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:29:02,430 INFO L87 Difference]: Start difference. First operand 2178 states and 3029 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:07,347 INFO L93 Difference]: Finished difference Result 5774 states and 8057 transitions. [2022-02-20 18:29:07,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:29:07,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 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:29:07,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 299 transitions. [2022-02-20 18:29:07,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 299 transitions. [2022-02-20 18:29:07,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 299 transitions. [2022-02-20 18:29:07,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 299 edges. 299 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:08,268 INFO L225 Difference]: With dead ends: 5774 [2022-02-20 18:29:08,269 INFO L226 Difference]: Without dead ends: 4696 [2022-02-20 18:29:08,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:29:08,270 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 189 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:08,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 324 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:08,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4696 states. [2022-02-20 18:29:11,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4696 to 3794. [2022-02-20 18:29:11,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:11,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4696 states. Second operand has 3794 states, 3793 states have (on average 1.3838650145003955) internal successors, (5249), 3793 states have internal predecessors, (5249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:11,397 INFO L74 IsIncluded]: Start isIncluded. First operand 4696 states. Second operand has 3794 states, 3793 states have (on average 1.3838650145003955) internal successors, (5249), 3793 states have internal predecessors, (5249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:11,400 INFO L87 Difference]: Start difference. First operand 4696 states. Second operand has 3794 states, 3793 states have (on average 1.3838650145003955) internal successors, (5249), 3793 states have internal predecessors, (5249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:11,942 INFO L93 Difference]: Finished difference Result 4696 states and 6524 transitions. [2022-02-20 18:29:11,942 INFO L276 IsEmpty]: Start isEmpty. Operand 4696 states and 6524 transitions. [2022-02-20 18:29:11,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:11,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:11,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 3794 states, 3793 states have (on average 1.3838650145003955) internal successors, (5249), 3793 states have internal predecessors, (5249), 0 states have call successors, (0), 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 4696 states. [2022-02-20 18:29:11,955 INFO L87 Difference]: Start difference. First operand has 3794 states, 3793 states have (on average 1.3838650145003955) internal successors, (5249), 3793 states have internal predecessors, (5249), 0 states have call successors, (0), 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 4696 states. [2022-02-20 18:29:12,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:12,523 INFO L93 Difference]: Finished difference Result 4696 states and 6524 transitions. [2022-02-20 18:29:12,523 INFO L276 IsEmpty]: Start isEmpty. Operand 4696 states and 6524 transitions. [2022-02-20 18:29:12,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:12,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:12,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:12,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3794 states, 3793 states have (on average 1.3838650145003955) internal successors, (5249), 3793 states have internal predecessors, (5249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 5249 transitions. [2022-02-20 18:29:13,023 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 5249 transitions. Word has length 63 [2022-02-20 18:29:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:13,023 INFO L470 AbstractCegarLoop]: Abstraction has 3794 states and 5249 transitions. [2022-02-20 18:29:13,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 5249 transitions. [2022-02-20 18:29:13,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:29:13,024 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:13,024 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:13,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:29:13,025 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:13,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:13,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1664145778, now seen corresponding path program 1 times [2022-02-20 18:29:13,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:13,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120817329] [2022-02-20 18:29:13,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:13,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:13,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {64037#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; {64037#true} is VALID [2022-02-20 18:29:13,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {64037#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret20#1, main_#t~ret21#1, main_#t~post22#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {64037#true} is VALID [2022-02-20 18:29:13,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {64037#true} assume 0 == ~r1~0; {64037#true} is VALID [2022-02-20 18:29:13,089 INFO L290 TraceCheckUtils]: 3: Hoare triple {64037#true} assume ~id1~0 >= 0; {64037#true} is VALID [2022-02-20 18:29:13,090 INFO L290 TraceCheckUtils]: 4: Hoare triple {64037#true} assume 0 == ~st1~0; {64037#true} is VALID [2022-02-20 18:29:13,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {64037#true} assume ~send1~0 == ~id1~0; {64037#true} is VALID [2022-02-20 18:29:13,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {64037#true} assume 0 == ~mode1~0 % 256; {64037#true} is VALID [2022-02-20 18:29:13,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {64037#true} assume ~id2~0 >= 0; {64037#true} is VALID [2022-02-20 18:29:13,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {64037#true} assume 0 == ~st2~0; {64039#(<= ~st2~0 0)} is VALID [2022-02-20 18:29:13,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {64039#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {64039#(<= ~st2~0 0)} is VALID [2022-02-20 18:29:13,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {64039#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {64039#(<= ~st2~0 0)} is VALID [2022-02-20 18:29:13,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {64039#(<= ~st2~0 0)} assume ~id3~0 >= 0; {64039#(<= ~st2~0 0)} is VALID [2022-02-20 18:29:13,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {64039#(<= ~st2~0 0)} assume 0 == ~st3~0; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} init_#res#1 := init_~tmp~0#1; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == main_~i2~0#1); {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 != ~mode1~0 % 256); {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,095 INFO L290 TraceCheckUtils]: 26: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 != ~mode2~0 % 256); {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,096 INFO L290 TraceCheckUtils]: 31: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 != ~mode3~0 % 256); {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,096 INFO L290 TraceCheckUtils]: 32: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,097 INFO L290 TraceCheckUtils]: 36: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~r1~0 >= 3); {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,098 INFO L290 TraceCheckUtils]: 37: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,098 INFO L290 TraceCheckUtils]: 38: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,098 INFO L290 TraceCheckUtils]: 39: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} check_#res#1 := check_~tmp~1#1; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,098 INFO L290 TraceCheckUtils]: 40: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,099 INFO L290 TraceCheckUtils]: 41: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == assert_~arg#1 % 256); {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,099 INFO L290 TraceCheckUtils]: 42: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume { :end_inline_assert } true;main_#t~post22#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,099 INFO L290 TraceCheckUtils]: 43: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,099 INFO L290 TraceCheckUtils]: 44: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,100 INFO L290 TraceCheckUtils]: 45: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume node1_~m1~0#1 != ~nomsg~0; {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,100 INFO L290 TraceCheckUtils]: 46: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume !(node1_~m1~0#1 > ~id1~0); {64040#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:13,100 INFO L290 TraceCheckUtils]: 47: Hoare triple {64040#(<= (+ ~st3~0 ~st2~0) 0)} assume node1_~m1~0#1 == ~id1~0;~st1~0 := 1; {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:13,101 INFO L290 TraceCheckUtils]: 48: Hoare triple {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode1~0 := 0; {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:13,101 INFO L290 TraceCheckUtils]: 49: Hoare triple {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:13,101 INFO L290 TraceCheckUtils]: 50: Hoare triple {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:13,102 INFO L290 TraceCheckUtils]: 51: Hoare triple {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(node2_~m2~0#1 != ~nomsg~0); {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:13,102 INFO L290 TraceCheckUtils]: 52: Hoare triple {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode2~0 := 0; {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:13,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:13,103 INFO L290 TraceCheckUtils]: 54: Hoare triple {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:13,103 INFO L290 TraceCheckUtils]: 55: Hoare triple {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(node3_~m3~0#1 != ~nomsg~0); {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:13,104 INFO L290 TraceCheckUtils]: 56: Hoare triple {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode3~0 := 0; {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:13,104 INFO L290 TraceCheckUtils]: 57: Hoare triple {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:13,104 INFO L290 TraceCheckUtils]: 58: Hoare triple {64041#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {64038#false} is VALID [2022-02-20 18:29:13,104 INFO L290 TraceCheckUtils]: 59: Hoare triple {64038#false} check_#res#1 := check_~tmp~1#1; {64038#false} is VALID [2022-02-20 18:29:13,105 INFO L290 TraceCheckUtils]: 60: Hoare triple {64038#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {64038#false} is VALID [2022-02-20 18:29:13,105 INFO L290 TraceCheckUtils]: 61: Hoare triple {64038#false} assume 0 == assert_~arg#1 % 256; {64038#false} is VALID [2022-02-20 18:29:13,105 INFO L290 TraceCheckUtils]: 62: Hoare triple {64038#false} assume !false; {64038#false} is VALID [2022-02-20 18:29:13,105 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:29:13,105 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:13,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120817329] [2022-02-20 18:29:13,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120817329] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:13,106 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:13,106 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:29:13,106 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600208906] [2022-02-20 18:29:13,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:13,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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:29:13,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:13,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:13,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:13,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:29:13,139 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:13,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:29:13,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:29:13,140 INFO L87 Difference]: Start difference. First operand 3794 states and 5249 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:19,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:19,536 INFO L93 Difference]: Finished difference Result 6490 states and 9069 transitions. [2022-02-20 18:29:19,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:29:19,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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:29:19,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:19,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 299 transitions. [2022-02-20 18:29:19,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:19,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 299 transitions. [2022-02-20 18:29:19,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 299 transitions. [2022-02-20 18:29:19,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 299 edges. 299 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:20,727 INFO L225 Difference]: With dead ends: 6490 [2022-02-20 18:29:20,727 INFO L226 Difference]: Without dead ends: 5592 [2022-02-20 18:29:20,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:29:20,729 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 186 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:20,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 311 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:20,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5592 states. [2022-02-20 18:29:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5592 to 4690. [2022-02-20 18:29:24,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:24,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5592 states. Second operand has 4690 states, 4689 states have (on average 1.3872894007251013) internal successors, (6505), 4689 states have internal predecessors, (6505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:24,947 INFO L74 IsIncluded]: Start isIncluded. First operand 5592 states. Second operand has 4690 states, 4689 states have (on average 1.3872894007251013) internal successors, (6505), 4689 states have internal predecessors, (6505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:24,950 INFO L87 Difference]: Start difference. First operand 5592 states. Second operand has 4690 states, 4689 states have (on average 1.3872894007251013) internal successors, (6505), 4689 states have internal predecessors, (6505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:25,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:25,695 INFO L93 Difference]: Finished difference Result 5592 states and 7780 transitions. [2022-02-20 18:29:25,695 INFO L276 IsEmpty]: Start isEmpty. Operand 5592 states and 7780 transitions. [2022-02-20 18:29:25,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:25,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:25,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 4690 states, 4689 states have (on average 1.3872894007251013) internal successors, (6505), 4689 states have internal predecessors, (6505), 0 states have call successors, (0), 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 5592 states. [2022-02-20 18:29:25,707 INFO L87 Difference]: Start difference. First operand has 4690 states, 4689 states have (on average 1.3872894007251013) internal successors, (6505), 4689 states have internal predecessors, (6505), 0 states have call successors, (0), 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 5592 states. [2022-02-20 18:29:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:26,465 INFO L93 Difference]: Finished difference Result 5592 states and 7780 transitions. [2022-02-20 18:29:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand 5592 states and 7780 transitions. [2022-02-20 18:29:26,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:26,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:26,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:26,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4690 states, 4689 states have (on average 1.3872894007251013) internal successors, (6505), 4689 states have internal predecessors, (6505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4690 states to 4690 states and 6505 transitions. [2022-02-20 18:29:27,193 INFO L78 Accepts]: Start accepts. Automaton has 4690 states and 6505 transitions. Word has length 63 [2022-02-20 18:29:27,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:27,193 INFO L470 AbstractCegarLoop]: Abstraction has 4690 states and 6505 transitions. [2022-02-20 18:29:27,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:27,193 INFO L276 IsEmpty]: Start isEmpty. Operand 4690 states and 6505 transitions. [2022-02-20 18:29:27,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:29:27,194 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:27,194 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, 1] [2022-02-20 18:29:27,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 18:29:27,195 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:27,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:27,195 INFO L85 PathProgramCache]: Analyzing trace with hash -229876224, now seen corresponding path program 1 times [2022-02-20 18:29:27,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:27,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205277187] [2022-02-20 18:29:27,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:27,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:27,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {89193#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; {89195#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:29:27,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {89195#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret20#1, main_#t~ret21#1, main_#t~post22#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {89196#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:29:27,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {89196#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0; {89196#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:29:27,435 INFO L290 TraceCheckUtils]: 3: Hoare triple {89196#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {89196#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:29:27,435 INFO L290 TraceCheckUtils]: 4: Hoare triple {89196#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {89196#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:29:27,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {89196#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {89196#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:29:27,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {89196#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {89196#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:29:27,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {89196#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {89197#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:29:27,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {89197#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume 0 == ~st2~0; {89197#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:29:27,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {89197#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:27,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:27,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:27,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:27,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:27,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:27,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:27,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:27,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:27,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} init_#res#1 := init_~tmp~0#1; {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:27,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:27,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !(0 == main_~i2~0#1); {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:27,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:27,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:27,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !(0 != ~mode1~0 % 256); {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:27,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:27,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:27,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:27,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !(0 != ~mode2~0 % 256); {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:27,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {89198#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {89199#(and (<= (+ ~nomsg~0 1) 0) (not (<= (+ 1 (div |ULTIMATE.start_node2_#t~ite5#1| 256)) 0)) (<= |ULTIMATE.start_node2_#t~ite5#1| 127))} is VALID [2022-02-20 18:29:27,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {89199#(and (<= (+ ~nomsg~0 1) 0) (not (<= (+ 1 (div |ULTIMATE.start_node2_#t~ite5#1| 256)) 0)) (<= |ULTIMATE.start_node2_#t~ite5#1| 127))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {89200#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:29:27,444 INFO L290 TraceCheckUtils]: 30: Hoare triple {89200#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {89200#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:29:27,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {89200#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume !(0 != ~mode3~0 % 256); {89200#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:29:27,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {89200#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {89201#(or (and (or (not (<= |ULTIMATE.start_node3_#t~ite6#1| (+ (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 127))) (not (= (+ (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) (- 256)) |ULTIMATE.start_node3_#t~ite6#1|) ~p2_new~0))) (or (not (= (+ (- 256) (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) (- 256)) |ULTIMATE.start_node3_#t~ite6#1|) ~p2_new~0)) (<= |ULTIMATE.start_node3_#t~ite6#1| (+ (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 127)))) (and (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 256 (* (- 1) |ULTIMATE.start_node3_#t~ite6#1|)) 0)) (or (not (<= |ULTIMATE.start_node3_#t~ite6#1| (+ (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 127))) (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) (* (- 1) |ULTIMATE.start_node3_#t~ite6#1|)) 0)))) (and (<= (+ ~nomsg~0 (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 1) |ULTIMATE.start_node3_#t~ite6#1|) (<= |ULTIMATE.start_node3_#t~ite6#1| (+ (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 127))))} is VALID [2022-02-20 18:29:27,446 INFO L290 TraceCheckUtils]: 33: Hoare triple {89201#(or (and (or (not (<= |ULTIMATE.start_node3_#t~ite6#1| (+ (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 127))) (not (= (+ (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) (- 256)) |ULTIMATE.start_node3_#t~ite6#1|) ~p2_new~0))) (or (not (= (+ (- 256) (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) (- 256)) |ULTIMATE.start_node3_#t~ite6#1|) ~p2_new~0)) (<= |ULTIMATE.start_node3_#t~ite6#1| (+ (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 127)))) (and (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 256 (* (- 1) |ULTIMATE.start_node3_#t~ite6#1|)) 0)) (or (not (<= |ULTIMATE.start_node3_#t~ite6#1| (+ (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 127))) (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) (* (- 1) |ULTIMATE.start_node3_#t~ite6#1|)) 0)))) (and (<= (+ ~nomsg~0 (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 1) |ULTIMATE.start_node3_#t~ite6#1|) (<= |ULTIMATE.start_node3_#t~ite6#1| (+ (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 127))))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {89202#(or (not (= ~p3_new~0 ~p2_new~0)) (not (= ~p3_new~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:27,446 INFO L290 TraceCheckUtils]: 34: Hoare triple {89202#(or (not (= ~p3_new~0 ~p2_new~0)) (not (= ~p3_new~0 ~nomsg~0)))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {89203#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:27,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {89203#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {89203#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:27,447 INFO L290 TraceCheckUtils]: 36: Hoare triple {89203#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume !(~r1~0 >= 3); {89203#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:27,447 INFO L290 TraceCheckUtils]: 37: Hoare triple {89203#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {89203#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:27,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {89203#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {89203#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:27,448 INFO L290 TraceCheckUtils]: 39: Hoare triple {89203#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} check_#res#1 := check_~tmp~1#1; {89203#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:27,448 INFO L290 TraceCheckUtils]: 40: Hoare triple {89203#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {89203#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:27,449 INFO L290 TraceCheckUtils]: 41: Hoare triple {89203#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume !(0 == assert_~arg#1 % 256); {89203#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:27,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {89203#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume { :end_inline_assert } true;main_#t~post22#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; {89203#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:27,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {89203#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {89203#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:27,450 INFO L290 TraceCheckUtils]: 44: Hoare triple {89203#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {89204#(or (not (= ~nomsg~0 |ULTIMATE.start_node1_~m1~0#1|)) (not (= |ULTIMATE.start_node1_~m1~0#1| ~p2_old~0)))} is VALID [2022-02-20 18:29:27,450 INFO L290 TraceCheckUtils]: 45: Hoare triple {89204#(or (not (= ~nomsg~0 |ULTIMATE.start_node1_~m1~0#1|)) (not (= |ULTIMATE.start_node1_~m1~0#1| ~p2_old~0)))} assume !(node1_~m1~0#1 != ~nomsg~0); {89205#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:29:27,450 INFO L290 TraceCheckUtils]: 46: Hoare triple {89205#(not (= ~nomsg~0 ~p2_old~0))} ~mode1~0 := 0; {89205#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:29:27,451 INFO L290 TraceCheckUtils]: 47: Hoare triple {89205#(not (= ~nomsg~0 ~p2_old~0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {89205#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:29:27,451 INFO L290 TraceCheckUtils]: 48: Hoare triple {89205#(not (= ~nomsg~0 ~p2_old~0))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {89205#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:29:27,451 INFO L290 TraceCheckUtils]: 49: Hoare triple {89205#(not (= ~nomsg~0 ~p2_old~0))} assume !(node2_~m2~0#1 != ~nomsg~0); {89205#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:29:27,452 INFO L290 TraceCheckUtils]: 50: Hoare triple {89205#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {89205#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:29:27,452 INFO L290 TraceCheckUtils]: 51: Hoare triple {89205#(not (= ~nomsg~0 ~p2_old~0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {89205#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:29:27,452 INFO L290 TraceCheckUtils]: 52: Hoare triple {89205#(not (= ~nomsg~0 ~p2_old~0))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {89206#(not (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|))} is VALID [2022-02-20 18:29:27,453 INFO L290 TraceCheckUtils]: 53: Hoare triple {89206#(not (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|))} assume !(node3_~m3~0#1 != ~nomsg~0); {89194#false} is VALID [2022-02-20 18:29:27,453 INFO L290 TraceCheckUtils]: 54: Hoare triple {89194#false} ~mode3~0 := 0; {89194#false} is VALID [2022-02-20 18:29:27,453 INFO L290 TraceCheckUtils]: 55: Hoare triple {89194#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {89194#false} is VALID [2022-02-20 18:29:27,453 INFO L290 TraceCheckUtils]: 56: Hoare triple {89194#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {89194#false} is VALID [2022-02-20 18:29:27,453 INFO L290 TraceCheckUtils]: 57: Hoare triple {89194#false} assume ~r1~0 >= 3; {89194#false} is VALID [2022-02-20 18:29:27,453 INFO L290 TraceCheckUtils]: 58: Hoare triple {89194#false} assume !(~r1~0 < 3); {89194#false} is VALID [2022-02-20 18:29:27,453 INFO L290 TraceCheckUtils]: 59: Hoare triple {89194#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {89194#false} is VALID [2022-02-20 18:29:27,453 INFO L290 TraceCheckUtils]: 60: Hoare triple {89194#false} check_#res#1 := check_~tmp~1#1; {89194#false} is VALID [2022-02-20 18:29:27,453 INFO L290 TraceCheckUtils]: 61: Hoare triple {89194#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {89194#false} is VALID [2022-02-20 18:29:27,453 INFO L290 TraceCheckUtils]: 62: Hoare triple {89194#false} assume 0 == assert_~arg#1 % 256; {89194#false} is VALID [2022-02-20 18:29:27,454 INFO L290 TraceCheckUtils]: 63: Hoare triple {89194#false} assume !false; {89194#false} is VALID [2022-02-20 18:29:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:29:27,454 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:27,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205277187] [2022-02-20 18:29:27,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205277187] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:29:27,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355356793] [2022-02-20 18:29:27,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:27,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:29:27,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:29:27,456 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:29:27,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 18:29:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:27,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 18:29:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:27,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:29:27,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {89193#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; {89193#true} is VALID [2022-02-20 18:29:27,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {89193#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret20#1, main_#t~ret21#1, main_#t~post22#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {89193#true} is VALID [2022-02-20 18:29:27,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {89193#true} assume 0 == ~r1~0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,857 INFO L290 TraceCheckUtils]: 3: Hoare triple {89216#(= ~r1~0 0)} assume ~id1~0 >= 0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,857 INFO L290 TraceCheckUtils]: 4: Hoare triple {89216#(= ~r1~0 0)} assume 0 == ~st1~0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {89216#(= ~r1~0 0)} assume ~send1~0 == ~id1~0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {89216#(= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {89216#(= ~r1~0 0)} assume ~id2~0 >= 0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {89216#(= ~r1~0 0)} assume 0 == ~st2~0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {89216#(= ~r1~0 0)} assume ~send2~0 == ~id2~0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {89216#(= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {89216#(= ~r1~0 0)} assume ~id3~0 >= 0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {89216#(= ~r1~0 0)} assume 0 == ~st3~0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {89216#(= ~r1~0 0)} assume ~send3~0 == ~id3~0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {89216#(= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {89216#(= ~r1~0 0)} assume ~id1~0 != ~id2~0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {89216#(= ~r1~0 0)} assume ~id1~0 != ~id3~0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {89216#(= ~r1~0 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {89216#(= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {89216#(= ~r1~0 0)} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {89216#(= ~r1~0 0)} assume !(0 == main_~i2~0#1); {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {89216#(= ~r1~0 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {89216#(= ~r1~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {89216#(= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {89216#(= ~r1~0 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {89216#(= ~r1~0 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {89216#(= ~r1~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {89216#(= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {89216#(= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {89216#(= ~r1~0 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {89216#(= ~r1~0 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {89216#(= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {89216#(= ~r1~0 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,866 INFO L290 TraceCheckUtils]: 33: Hoare triple {89216#(= ~r1~0 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,866 INFO L290 TraceCheckUtils]: 34: Hoare triple {89216#(= ~r1~0 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,866 INFO L290 TraceCheckUtils]: 35: Hoare triple {89216#(= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,866 INFO L290 TraceCheckUtils]: 36: Hoare triple {89216#(= ~r1~0 0)} assume !(~r1~0 >= 3); {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,867 INFO L290 TraceCheckUtils]: 37: Hoare triple {89216#(= ~r1~0 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,867 INFO L290 TraceCheckUtils]: 38: Hoare triple {89216#(= ~r1~0 0)} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {89325#(and (<= 1 |ULTIMATE.start_check_~tmp~1#1|) (= ~r1~0 0))} is VALID [2022-02-20 18:29:27,867 INFO L290 TraceCheckUtils]: 39: Hoare triple {89325#(and (<= 1 |ULTIMATE.start_check_~tmp~1#1|) (= ~r1~0 0))} check_#res#1 := check_~tmp~1#1; {89329#(and (<= 1 |ULTIMATE.start_check_#res#1|) (= ~r1~0 0))} is VALID [2022-02-20 18:29:27,868 INFO L290 TraceCheckUtils]: 40: Hoare triple {89329#(and (<= 1 |ULTIMATE.start_check_#res#1|) (= ~r1~0 0))} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,868 INFO L290 TraceCheckUtils]: 41: Hoare triple {89216#(= ~r1~0 0)} assume !(0 == assert_~arg#1 % 256); {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,868 INFO L290 TraceCheckUtils]: 42: Hoare triple {89216#(= ~r1~0 0)} assume { :end_inline_assert } true;main_#t~post22#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,868 INFO L290 TraceCheckUtils]: 43: Hoare triple {89216#(= ~r1~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {89216#(= ~r1~0 0)} is VALID [2022-02-20 18:29:27,869 INFO L290 TraceCheckUtils]: 44: Hoare triple {89216#(= ~r1~0 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {89345#(= ~r1~0 1)} is VALID [2022-02-20 18:29:27,869 INFO L290 TraceCheckUtils]: 45: Hoare triple {89345#(= ~r1~0 1)} assume !(node1_~m1~0#1 != ~nomsg~0); {89345#(= ~r1~0 1)} is VALID [2022-02-20 18:29:27,869 INFO L290 TraceCheckUtils]: 46: Hoare triple {89345#(= ~r1~0 1)} ~mode1~0 := 0; {89345#(= ~r1~0 1)} is VALID [2022-02-20 18:29:27,870 INFO L290 TraceCheckUtils]: 47: Hoare triple {89345#(= ~r1~0 1)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {89345#(= ~r1~0 1)} is VALID [2022-02-20 18:29:27,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {89345#(= ~r1~0 1)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {89345#(= ~r1~0 1)} is VALID [2022-02-20 18:29:27,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {89345#(= ~r1~0 1)} assume !(node2_~m2~0#1 != ~nomsg~0); {89345#(= ~r1~0 1)} is VALID [2022-02-20 18:29:27,870 INFO L290 TraceCheckUtils]: 50: Hoare triple {89345#(= ~r1~0 1)} ~mode2~0 := 0; {89345#(= ~r1~0 1)} is VALID [2022-02-20 18:29:27,871 INFO L290 TraceCheckUtils]: 51: Hoare triple {89345#(= ~r1~0 1)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {89345#(= ~r1~0 1)} is VALID [2022-02-20 18:29:27,871 INFO L290 TraceCheckUtils]: 52: Hoare triple {89345#(= ~r1~0 1)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {89345#(= ~r1~0 1)} is VALID [2022-02-20 18:29:27,871 INFO L290 TraceCheckUtils]: 53: Hoare triple {89345#(= ~r1~0 1)} assume !(node3_~m3~0#1 != ~nomsg~0); {89345#(= ~r1~0 1)} is VALID [2022-02-20 18:29:27,871 INFO L290 TraceCheckUtils]: 54: Hoare triple {89345#(= ~r1~0 1)} ~mode3~0 := 0; {89345#(= ~r1~0 1)} is VALID [2022-02-20 18:29:27,872 INFO L290 TraceCheckUtils]: 55: Hoare triple {89345#(= ~r1~0 1)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {89345#(= ~r1~0 1)} is VALID [2022-02-20 18:29:27,872 INFO L290 TraceCheckUtils]: 56: Hoare triple {89345#(= ~r1~0 1)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {89345#(= ~r1~0 1)} is VALID [2022-02-20 18:29:27,872 INFO L290 TraceCheckUtils]: 57: Hoare triple {89345#(= ~r1~0 1)} assume ~r1~0 >= 3; {89194#false} is VALID [2022-02-20 18:29:27,872 INFO L290 TraceCheckUtils]: 58: Hoare triple {89194#false} assume !(~r1~0 < 3); {89194#false} is VALID [2022-02-20 18:29:27,872 INFO L290 TraceCheckUtils]: 59: Hoare triple {89194#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {89194#false} is VALID [2022-02-20 18:29:27,873 INFO L290 TraceCheckUtils]: 60: Hoare triple {89194#false} check_#res#1 := check_~tmp~1#1; {89194#false} is VALID [2022-02-20 18:29:27,873 INFO L290 TraceCheckUtils]: 61: Hoare triple {89194#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {89194#false} is VALID [2022-02-20 18:29:27,873 INFO L290 TraceCheckUtils]: 62: Hoare triple {89194#false} assume 0 == assert_~arg#1 % 256; {89194#false} is VALID [2022-02-20 18:29:27,873 INFO L290 TraceCheckUtils]: 63: Hoare triple {89194#false} assume !false; {89194#false} is VALID [2022-02-20 18:29:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:29:27,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:29:28,430 INFO L290 TraceCheckUtils]: 63: Hoare triple {89194#false} assume !false; {89194#false} is VALID [2022-02-20 18:29:28,430 INFO L290 TraceCheckUtils]: 62: Hoare triple {89194#false} assume 0 == assert_~arg#1 % 256; {89194#false} is VALID [2022-02-20 18:29:28,430 INFO L290 TraceCheckUtils]: 61: Hoare triple {89194#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {89194#false} is VALID [2022-02-20 18:29:28,430 INFO L290 TraceCheckUtils]: 60: Hoare triple {89194#false} check_#res#1 := check_~tmp~1#1; {89194#false} is VALID [2022-02-20 18:29:28,430 INFO L290 TraceCheckUtils]: 59: Hoare triple {89194#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {89194#false} is VALID [2022-02-20 18:29:28,430 INFO L290 TraceCheckUtils]: 58: Hoare triple {89194#false} assume !(~r1~0 < 3); {89194#false} is VALID [2022-02-20 18:29:28,431 INFO L290 TraceCheckUtils]: 57: Hoare triple {89421#(not (<= 3 ~r1~0))} assume ~r1~0 >= 3; {89194#false} is VALID [2022-02-20 18:29:28,431 INFO L290 TraceCheckUtils]: 56: Hoare triple {89421#(not (<= 3 ~r1~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {89421#(not (<= 3 ~r1~0))} is VALID [2022-02-20 18:29:28,431 INFO L290 TraceCheckUtils]: 55: Hoare triple {89421#(not (<= 3 ~r1~0))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {89421#(not (<= 3 ~r1~0))} is VALID [2022-02-20 18:29:28,432 INFO L290 TraceCheckUtils]: 54: Hoare triple {89421#(not (<= 3 ~r1~0))} ~mode3~0 := 0; {89421#(not (<= 3 ~r1~0))} is VALID [2022-02-20 18:29:28,432 INFO L290 TraceCheckUtils]: 53: Hoare triple {89421#(not (<= 3 ~r1~0))} assume !(node3_~m3~0#1 != ~nomsg~0); {89421#(not (<= 3 ~r1~0))} is VALID [2022-02-20 18:29:28,432 INFO L290 TraceCheckUtils]: 52: Hoare triple {89421#(not (<= 3 ~r1~0))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {89421#(not (<= 3 ~r1~0))} is VALID [2022-02-20 18:29:28,432 INFO L290 TraceCheckUtils]: 51: Hoare triple {89421#(not (<= 3 ~r1~0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {89421#(not (<= 3 ~r1~0))} is VALID [2022-02-20 18:29:28,433 INFO L290 TraceCheckUtils]: 50: Hoare triple {89421#(not (<= 3 ~r1~0))} ~mode2~0 := 0; {89421#(not (<= 3 ~r1~0))} is VALID [2022-02-20 18:29:28,433 INFO L290 TraceCheckUtils]: 49: Hoare triple {89421#(not (<= 3 ~r1~0))} assume !(node2_~m2~0#1 != ~nomsg~0); {89421#(not (<= 3 ~r1~0))} is VALID [2022-02-20 18:29:28,433 INFO L290 TraceCheckUtils]: 48: Hoare triple {89421#(not (<= 3 ~r1~0))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {89421#(not (<= 3 ~r1~0))} is VALID [2022-02-20 18:29:28,434 INFO L290 TraceCheckUtils]: 47: Hoare triple {89421#(not (<= 3 ~r1~0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {89421#(not (<= 3 ~r1~0))} is VALID [2022-02-20 18:29:28,434 INFO L290 TraceCheckUtils]: 46: Hoare triple {89421#(not (<= 3 ~r1~0))} ~mode1~0 := 0; {89421#(not (<= 3 ~r1~0))} is VALID [2022-02-20 18:29:28,434 INFO L290 TraceCheckUtils]: 45: Hoare triple {89421#(not (<= 3 ~r1~0))} assume !(node1_~m1~0#1 != ~nomsg~0); {89421#(not (<= 3 ~r1~0))} is VALID [2022-02-20 18:29:28,435 INFO L290 TraceCheckUtils]: 44: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {89421#(not (<= 3 ~r1~0))} is VALID [2022-02-20 18:29:28,435 INFO L290 TraceCheckUtils]: 43: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,435 INFO L290 TraceCheckUtils]: 42: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume { :end_inline_assert } true;main_#t~post22#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,436 INFO L290 TraceCheckUtils]: 41: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume !(0 == assert_~arg#1 % 256); {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,436 INFO L290 TraceCheckUtils]: 40: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,436 INFO L290 TraceCheckUtils]: 39: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} check_#res#1 := check_~tmp~1#1; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,437 INFO L290 TraceCheckUtils]: 38: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume !(~r1~0 >= 3); {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume !(0 != ~mode3~0 % 256); {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume !(0 != ~mode2~0 % 256); {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume !(0 != ~mode1~0 % 256); {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} ~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_~i2~0#1 := 0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume !(0 == main_~i2~0#1); {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} init_#res#1 := init_~tmp~0#1; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume ~id1~0 != ~id3~0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume ~id1~0 != ~id2~0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume 0 == ~mode3~0 % 256; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume ~send3~0 == ~id3~0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume 0 == ~st3~0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume ~id3~0 >= 0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume 0 == ~mode2~0 % 256; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume ~send2~0 == ~id2~0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume 0 == ~st2~0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume ~id2~0 >= 0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume 0 == ~mode1~0 % 256; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume ~send1~0 == ~id1~0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,446 INFO L290 TraceCheckUtils]: 4: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume 0 == ~st1~0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} assume ~id1~0 >= 0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {89193#true} assume 0 == ~r1~0; {89461#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (not (<= 3 (mod (+ ~r1~0 1) 256))))} is VALID [2022-02-20 18:29:28,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {89193#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~ret20#1, main_#t~ret21#1, main_#t~post22#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {89193#true} is VALID [2022-02-20 18:29:28,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {89193#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; {89193#true} is VALID [2022-02-20 18:29:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:29:28,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355356793] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:29:28,448 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:29:28,448 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 4] total 20 [2022-02-20 18:29:28,448 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14008011] [2022-02-20 18:29:28,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:29:28,449 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 8.8) internal successors, (176), 20 states have internal predecessors, (176), 0 states have call successors, (0), 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 64 [2022-02-20 18:29:28,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:28,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 8.8) internal successors, (176), 20 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:28,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:28,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 18:29:28,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:28,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 18:29:28,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2022-02-20 18:29:28,563 INFO L87 Difference]: Start difference. First operand 4690 states and 6505 transitions. Second operand has 20 states, 20 states have (on average 8.8) internal successors, (176), 20 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)