./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.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.4.1.ufo.BOUNDED-8.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 5d3b64744a19af136ca9c439b2264a15465f658e2e3d4a576a98d96e4b8aff92 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:29:04,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:29:04,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:29:04,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:29:04,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:29:04,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:29:04,656 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:29:04,658 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:29:04,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:29:04,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:29:04,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:29:04,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:29:04,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:29:04,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:29:04,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:29:04,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:29:04,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:29:04,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:29:04,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:29:04,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:29:04,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:29:04,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:29:04,686 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:29:04,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:29:04,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:29:04,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:29:04,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:29:04,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:29:04,692 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:29:04,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:29:04,692 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:29:04,693 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:29:04,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:29:04,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:29:04,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:29:04,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:29:04,696 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:29:04,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:29:04,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:29:04,697 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:29:04,698 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:29:04,698 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:29:04,723 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:29:04,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:29:04,723 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:29:04,723 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:29:04,724 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:29:04,724 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:29:04,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:29:04,725 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:29:04,725 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:29:04,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:29:04,726 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:29:04,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:29:04,726 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:29:04,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:29:04,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:29:04,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:29:04,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:29:04,727 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:29:04,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:29:04,727 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:29:04,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:29:04,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:29:04,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:29:04,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:29:04,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:29:04,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:29:04,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:29:04,729 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:29:04,729 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:29:04,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:29:04,729 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:29:04,729 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:29:04,730 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:29:04,730 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 -> 5d3b64744a19af136ca9c439b2264a15465f658e2e3d4a576a98d96e4b8aff92 [2022-02-20 18:29:04,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:29:04,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:29:04,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:29:04,889 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:29:04,890 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:29:04,891 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2022-02-20 18:29:04,924 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf5e6f828/9d8ac59a6f914d06bc3f3c9b44156555/FLAG52a9e02a7 [2022-02-20 18:29:05,324 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:29:05,324 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2022-02-20 18:29:05,330 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf5e6f828/9d8ac59a6f914d06bc3f3c9b44156555/FLAG52a9e02a7 [2022-02-20 18:29:05,341 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf5e6f828/9d8ac59a6f914d06bc3f3c9b44156555 [2022-02-20 18:29:05,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:29:05,345 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:29:05,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:29:05,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:29:05,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:29:05,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:29:05" (1/1) ... [2022-02-20 18:29:05,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@633eecf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:05, skipping insertion in model container [2022-02-20 18:29:05,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:29:05" (1/1) ... [2022-02-20 18:29:05,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:29:05,388 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:29:05,596 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.4.1.ufo.BOUNDED-8.pals.c[8246,8259] [2022-02-20 18:29:05,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:29:05,612 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:29:05,657 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.4.1.ufo.BOUNDED-8.pals.c[8246,8259] [2022-02-20 18:29:05,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:29:05,667 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:29:05,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:05 WrapperNode [2022-02-20 18:29:05,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:29:05,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:29:05,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:29:05,670 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:29:05,675 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:29:05" (1/1) ... [2022-02-20 18:29:05,687 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:29:05" (1/1) ... [2022-02-20 18:29:05,718 INFO L137 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 275 [2022-02-20 18:29:05,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:29:05,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:29:05,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:29:05,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:29:05,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:05" (1/1) ... [2022-02-20 18:29:05,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:05" (1/1) ... [2022-02-20 18:29:05,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:05" (1/1) ... [2022-02-20 18:29:05,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:05" (1/1) ... [2022-02-20 18:29:05,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:05" (1/1) ... [2022-02-20 18:29:05,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:05" (1/1) ... [2022-02-20 18:29:05,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:05" (1/1) ... [2022-02-20 18:29:05,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:29:05,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:29:05,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:29:05,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:29:05,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:05" (1/1) ... [2022-02-20 18:29:05,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:29:05,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:29:05,784 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:29:05,794 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:29:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:29:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:29:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:29:05,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:29:05,904 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:29:05,905 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:29:06,346 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:29:06,350 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:29:06,351 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:29:06,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:29:06 BoogieIcfgContainer [2022-02-20 18:29:06,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:29:06,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:29:06,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:29:06,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:29:06,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:29:05" (1/3) ... [2022-02-20 18:29:06,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aab9c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:29:06, skipping insertion in model container [2022-02-20 18:29:06,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:05" (2/3) ... [2022-02-20 18:29:06,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aab9c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:29:06, skipping insertion in model container [2022-02-20 18:29:06,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:29:06" (3/3) ... [2022-02-20 18:29:06,358 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2022-02-20 18:29:06,361 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:29:06,361 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:29:06,405 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:29:06,409 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:29:06,409 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:29:06,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 75 states have (on average 1.7066666666666668) internal successors, (128), 76 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call 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:06,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 18:29:06,427 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:06,428 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] [2022-02-20 18:29:06,428 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:06,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:06,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1837107710, now seen corresponding path program 1 times [2022-02-20 18:29:06,438 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:06,438 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14321512] [2022-02-20 18:29:06,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:06,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:06,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {80#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {80#true} is VALID [2022-02-20 18:29:06,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {80#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#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~nondet8#1 && main_#t~nondet8#1 <= 127;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {80#true} is VALID [2022-02-20 18:29:06,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {80#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {80#true} is VALID [2022-02-20 18:29:06,618 INFO L290 TraceCheckUtils]: 3: Hoare triple {80#true} init_#res#1 := init_~tmp~0#1; {80#true} is VALID [2022-02-20 18:29:06,618 INFO L290 TraceCheckUtils]: 4: Hoare triple {80#true} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {80#true} is VALID [2022-02-20 18:29:06,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {80#true} assume 0 == main_~i2~0#1;assume false; {81#false} is VALID [2022-02-20 18:29:06,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {81#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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {81#false} is VALID [2022-02-20 18:29:06,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {81#false} assume !!(main_~i2~0#1 < 8);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; {81#false} is VALID [2022-02-20 18:29:06,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {81#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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {81#false} is VALID [2022-02-20 18:29:06,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {81#false} assume !(node1_~m1~0#1 != ~nomsg~0); {81#false} is VALID [2022-02-20 18:29:06,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {81#false} ~mode1~0 := 0; {81#false} is VALID [2022-02-20 18:29:06,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {81#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; {81#false} is VALID [2022-02-20 18:29:06,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {81#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {81#false} is VALID [2022-02-20 18:29:06,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {81#false} assume !(node2_~m2~0#1 != ~nomsg~0); {81#false} is VALID [2022-02-20 18:29:06,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {81#false} ~mode2~0 := 0; {81#false} is VALID [2022-02-20 18:29:06,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {81#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; {81#false} is VALID [2022-02-20 18:29:06,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {81#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {81#false} is VALID [2022-02-20 18:29:06,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {81#false} assume !(node3_~m3~0#1 != ~nomsg~0); {81#false} is VALID [2022-02-20 18:29:06,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {81#false} ~mode3~0 := 0; {81#false} is VALID [2022-02-20 18:29:06,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {81#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {81#false} is VALID [2022-02-20 18:29:06,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {81#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {81#false} is VALID [2022-02-20 18:29:06,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {81#false} assume !(node4_~m4~0#1 != ~nomsg~0); {81#false} is VALID [2022-02-20 18:29:06,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {81#false} ~mode4~0 := 0; {81#false} is VALID [2022-02-20 18:29:06,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {81#false} assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {81#false} is VALID [2022-02-20 18:29:06,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {81#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {81#false} is VALID [2022-02-20 18:29:06,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {81#false} check_#res#1 := check_~tmp~1#1; {81#false} is VALID [2022-02-20 18:29:06,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {81#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {81#false} is VALID [2022-02-20 18:29:06,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {81#false} assume 0 == assert_~arg#1 % 256; {81#false} is VALID [2022-02-20 18:29:06,629 INFO L290 TraceCheckUtils]: 28: Hoare triple {81#false} assume !false; {81#false} is VALID [2022-02-20 18:29:06,629 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:29:06,630 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:06,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14321512] [2022-02-20 18:29:06,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14321512] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:06,630 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:06,631 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:29:06,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383572361] [2022-02-20 18:29:06,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:06,636 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-02-20 18:29:06,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:06,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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:06,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:06,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:29:06,663 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:06,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:29:06,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:29:06,683 INFO L87 Difference]: Start difference. First operand has 77 states, 75 states have (on average 1.7066666666666668) internal successors, (128), 76 states have internal predecessors, (128), 0 states have call successors, (0), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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:06,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:06,767 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2022-02-20 18:29:06,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:29:06,768 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-02-20 18:29:06,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 204 transitions. [2022-02-20 18:29:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 204 transitions. [2022-02-20 18:29:06,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 204 transitions. [2022-02-20 18:29:06,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:06,917 INFO L225 Difference]: With dead ends: 126 [2022-02-20 18:29:06,917 INFO L226 Difference]: Without dead ends: 73 [2022-02-20 18:29:06,919 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:29:06,922 INFO L933 BasicCegarLoop]: 125 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, 125 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:29:06,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:06,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-20 18:29:06,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-02-20 18:29:06,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:06,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 72 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:06,950 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 72 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:06,950 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 72 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:06,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:06,956 INFO L93 Difference]: Finished difference Result 73 states and 121 transitions. [2022-02-20 18:29:06,956 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 121 transitions. [2022-02-20 18:29:06,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:06,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:06,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 72 states have internal predecessors, (121), 0 states have call successors, (0), 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 73 states. [2022-02-20 18:29:06,958 INFO L87 Difference]: Start difference. First operand has 73 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 72 states have internal predecessors, (121), 0 states have call successors, (0), 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 73 states. [2022-02-20 18:29:06,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:06,966 INFO L93 Difference]: Finished difference Result 73 states and 121 transitions. [2022-02-20 18:29:06,967 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 121 transitions. [2022-02-20 18:29:06,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:06,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:06,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:06,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:06,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 72 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 121 transitions. [2022-02-20 18:29:06,977 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 121 transitions. Word has length 29 [2022-02-20 18:29:06,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:06,978 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 121 transitions. [2022-02-20 18:29:06,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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:06,978 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 121 transitions. [2022-02-20 18:29:06,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 18:29:06,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:06,983 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] [2022-02-20 18:29:06,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:29:06,991 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:06,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:06,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1971121216, now seen corresponding path program 1 times [2022-02-20 18:29:06,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:06,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498905170] [2022-02-20 18:29:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:06,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:07,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {454#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {454#true} is VALID [2022-02-20 18:29:07,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {454#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#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~nondet8#1 && main_#t~nondet8#1 <= 127;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {454#true} is VALID [2022-02-20 18:29:07,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {454#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {456#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:29:07,106 INFO L290 TraceCheckUtils]: 3: Hoare triple {456#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {457#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:29:07,107 INFO L290 TraceCheckUtils]: 4: Hoare triple {457#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {458#(= |ULTIMATE.start_main_~i2~0#1| 0)} is VALID [2022-02-20 18:29:07,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {458#(= |ULTIMATE.start_main_~i2~0#1| 0)} assume !(0 == main_~i2~0#1); {455#false} is VALID [2022-02-20 18:29:07,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {455#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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {455#false} is VALID [2022-02-20 18:29:07,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {455#false} assume !!(main_~i2~0#1 < 8);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; {455#false} is VALID [2022-02-20 18:29:07,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {455#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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {455#false} is VALID [2022-02-20 18:29:07,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {455#false} assume !(node1_~m1~0#1 != ~nomsg~0); {455#false} is VALID [2022-02-20 18:29:07,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {455#false} ~mode1~0 := 0; {455#false} is VALID [2022-02-20 18:29:07,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {455#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; {455#false} is VALID [2022-02-20 18:29:07,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {455#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {455#false} is VALID [2022-02-20 18:29:07,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {455#false} assume !(node2_~m2~0#1 != ~nomsg~0); {455#false} is VALID [2022-02-20 18:29:07,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {455#false} ~mode2~0 := 0; {455#false} is VALID [2022-02-20 18:29:07,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {455#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; {455#false} is VALID [2022-02-20 18:29:07,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {455#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {455#false} is VALID [2022-02-20 18:29:07,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {455#false} assume !(node3_~m3~0#1 != ~nomsg~0); {455#false} is VALID [2022-02-20 18:29:07,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {455#false} ~mode3~0 := 0; {455#false} is VALID [2022-02-20 18:29:07,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {455#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {455#false} is VALID [2022-02-20 18:29:07,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {455#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {455#false} is VALID [2022-02-20 18:29:07,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {455#false} assume !(node4_~m4~0#1 != ~nomsg~0); {455#false} is VALID [2022-02-20 18:29:07,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {455#false} ~mode4~0 := 0; {455#false} is VALID [2022-02-20 18:29:07,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {455#false} assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {455#false} is VALID [2022-02-20 18:29:07,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {455#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {455#false} is VALID [2022-02-20 18:29:07,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {455#false} check_#res#1 := check_~tmp~1#1; {455#false} is VALID [2022-02-20 18:29:07,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {455#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {455#false} is VALID [2022-02-20 18:29:07,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {455#false} assume 0 == assert_~arg#1 % 256; {455#false} is VALID [2022-02-20 18:29:07,111 INFO L290 TraceCheckUtils]: 28: Hoare triple {455#false} assume !false; {455#false} is VALID [2022-02-20 18:29:07,111 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:29:07,111 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:07,111 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498905170] [2022-02-20 18:29:07,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498905170] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:07,111 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:07,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:29:07,112 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985545933] [2022-02-20 18:29:07,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:07,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-02-20 18:29:07,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:07,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:07,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:29:07,142 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:07,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:29:07,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:29:07,143 INFO L87 Difference]: Start difference. First operand 73 states and 121 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:07,398 INFO L93 Difference]: Finished difference Result 165 states and 263 transitions. [2022-02-20 18:29:07,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:29:07,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-02-20 18:29:07,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 263 transitions. [2022-02-20 18:29:07,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 263 transitions. [2022-02-20 18:29:07,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 263 transitions. [2022-02-20 18:29:07,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:07,583 INFO L225 Difference]: With dead ends: 165 [2022-02-20 18:29:07,583 INFO L226 Difference]: Without dead ends: 117 [2022-02-20 18:29:07,584 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:29:07,585 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 71 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:07,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 440 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:07,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-02-20 18:29:07,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 73. [2022-02-20 18:29:07,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:07,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 73 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call 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,590 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 73 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call 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,590 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 73 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call 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,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:07,593 INFO L93 Difference]: Finished difference Result 117 states and 167 transitions. [2022-02-20 18:29:07,593 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2022-02-20 18:29:07,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:07,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:07,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 0 states have call successors, (0), 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 117 states. [2022-02-20 18:29:07,595 INFO L87 Difference]: Start difference. First operand has 73 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 0 states have call successors, (0), 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 117 states. [2022-02-20 18:29:07,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:07,597 INFO L93 Difference]: Finished difference Result 117 states and 167 transitions. [2022-02-20 18:29:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2022-02-20 18:29:07,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:07,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:07,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:07,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:07,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call 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,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2022-02-20 18:29:07,600 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 98 transitions. Word has length 29 [2022-02-20 18:29:07,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:07,600 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 98 transitions. [2022-02-20 18:29:07,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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,601 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2022-02-20 18:29:07,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:29:07,601 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:07,602 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:07,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:29:07,602 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:07,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:07,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1333293339, now seen corresponding path program 1 times [2022-02-20 18:29:07,603 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:07,603 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673809109] [2022-02-20 18:29:07,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:07,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:07,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {968#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {968#true} is VALID [2022-02-20 18:29:07,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {968#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#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~nondet8#1 && main_#t~nondet8#1 <= 127;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {968#true} is VALID [2022-02-20 18:29:07,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {968#true} assume 0 == ~r1~0; {968#true} is VALID [2022-02-20 18:29:07,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {968#true} assume ~id1~0 >= 0; {968#true} is VALID [2022-02-20 18:29:07,664 INFO L290 TraceCheckUtils]: 4: Hoare triple {968#true} assume 0 == ~st1~0; {968#true} is VALID [2022-02-20 18:29:07,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {968#true} assume ~send1~0 == ~id1~0; {968#true} is VALID [2022-02-20 18:29:07,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {968#true} assume 0 == ~mode1~0 % 256; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main_~i2~0#1); {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {970#(= (+ (* (- 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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 8);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; {970#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:07,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {970#(= (+ (* (- 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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 18:29:07,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {969#false} assume !(node1_~m1~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 18:29:07,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {969#false} ~mode1~0 := 0; {969#false} is VALID [2022-02-20 18:29:07,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {969#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; {969#false} is VALID [2022-02-20 18:29:07,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {969#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 18:29:07,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {969#false} assume !(node2_~m2~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 18:29:07,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {969#false} ~mode2~0 := 0; {969#false} is VALID [2022-02-20 18:29:07,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {969#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; {969#false} is VALID [2022-02-20 18:29:07,677 INFO L290 TraceCheckUtils]: 38: Hoare triple {969#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 18:29:07,678 INFO L290 TraceCheckUtils]: 39: Hoare triple {969#false} assume !(node3_~m3~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 18:29:07,678 INFO L290 TraceCheckUtils]: 40: Hoare triple {969#false} ~mode3~0 := 0; {969#false} is VALID [2022-02-20 18:29:07,678 INFO L290 TraceCheckUtils]: 41: Hoare triple {969#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {969#false} is VALID [2022-02-20 18:29:07,678 INFO L290 TraceCheckUtils]: 42: Hoare triple {969#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 18:29:07,678 INFO L290 TraceCheckUtils]: 43: Hoare triple {969#false} assume !(node4_~m4~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 18:29:07,678 INFO L290 TraceCheckUtils]: 44: Hoare triple {969#false} ~mode4~0 := 0; {969#false} is VALID [2022-02-20 18:29:07,679 INFO L290 TraceCheckUtils]: 45: Hoare triple {969#false} assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {969#false} is VALID [2022-02-20 18:29:07,679 INFO L290 TraceCheckUtils]: 46: Hoare triple {969#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {969#false} is VALID [2022-02-20 18:29:07,679 INFO L290 TraceCheckUtils]: 47: Hoare triple {969#false} check_#res#1 := check_~tmp~1#1; {969#false} is VALID [2022-02-20 18:29:07,679 INFO L290 TraceCheckUtils]: 48: Hoare triple {969#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {969#false} is VALID [2022-02-20 18:29:07,679 INFO L290 TraceCheckUtils]: 49: Hoare triple {969#false} assume 0 == assert_~arg#1 % 256; {969#false} is VALID [2022-02-20 18:29:07,680 INFO L290 TraceCheckUtils]: 50: Hoare triple {969#false} assume !false; {969#false} is VALID [2022-02-20 18:29:07,680 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:29:07,680 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:07,680 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673809109] [2022-02-20 18:29:07,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673809109] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:07,681 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:07,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:07,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032443728] [2022-02-20 18:29:07,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:07,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:29:07,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:07,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:07,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:07,715 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:07,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:07,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:07,716 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:07,837 INFO L93 Difference]: Finished difference Result 155 states and 226 transitions. [2022-02-20 18:29:07,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:07,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:29:07,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-02-20 18:29:07,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-02-20 18:29:07,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 226 transitions. [2022-02-20 18:29:07,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:07,985 INFO L225 Difference]: With dead ends: 155 [2022-02-20 18:29:07,985 INFO L226 Difference]: Without dead ends: 111 [2022-02-20 18:29:07,986 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:29:07,986 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 59 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 220 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:29:07,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:07,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-20 18:29:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2022-02-20 18:29:07,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:07,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 109 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 108 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call 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,993 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 109 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 108 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call 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,993 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 109 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 108 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call 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,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:07,995 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2022-02-20 18:29:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 156 transitions. [2022-02-20 18:29:07,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:07,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:07,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 108 states have internal predecessors, (155), 0 states have call successors, (0), 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 111 states. [2022-02-20 18:29:07,996 INFO L87 Difference]: Start difference. First operand has 109 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 108 states have internal predecessors, (155), 0 states have call successors, (0), 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 111 states. [2022-02-20 18:29:07,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:07,999 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2022-02-20 18:29:07,999 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 156 transitions. [2022-02-20 18:29:07,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:07,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:07,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:08,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 108 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call 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:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2022-02-20 18:29:08,002 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 51 [2022-02-20 18:29:08,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:08,002 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2022-02-20 18:29:08,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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:08,003 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2022-02-20 18:29:08,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:29:08,003 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:08,004 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:08,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:29:08,004 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:08,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:08,004 INFO L85 PathProgramCache]: Analyzing trace with hash -606737519, now seen corresponding path program 1 times [2022-02-20 18:29:08,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:08,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936406803] [2022-02-20 18:29:08,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:08,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:08,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {1496#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {1496#true} is VALID [2022-02-20 18:29:08,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {1496#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#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~nondet8#1 && main_#t~nondet8#1 <= 127;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1496#true} is VALID [2022-02-20 18:29:08,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {1496#true} assume 0 == ~r1~0; {1496#true} is VALID [2022-02-20 18:29:08,055 INFO L290 TraceCheckUtils]: 3: Hoare triple {1496#true} assume ~id1~0 >= 0; {1496#true} is VALID [2022-02-20 18:29:08,055 INFO L290 TraceCheckUtils]: 4: Hoare triple {1496#true} assume 0 == ~st1~0; {1496#true} is VALID [2022-02-20 18:29:08,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {1496#true} assume ~send1~0 == ~id1~0; {1496#true} is VALID [2022-02-20 18:29:08,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {1496#true} assume 0 == ~mode1~0 % 256; {1496#true} is VALID [2022-02-20 18:29:08,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {1496#true} assume ~id2~0 >= 0; {1496#true} is VALID [2022-02-20 18:29:08,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {1496#true} assume 0 == ~st2~0; {1496#true} is VALID [2022-02-20 18:29:08,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {1496#true} assume ~send2~0 == ~id2~0; {1496#true} is VALID [2022-02-20 18:29:08,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {1496#true} assume 0 == ~mode2~0 % 256; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == main_~i2~0#1); {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {1498#(= (+ (* (- 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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,064 INFO L290 TraceCheckUtils]: 29: Hoare triple {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main_~i2~0#1 < 8);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; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,064 INFO L290 TraceCheckUtils]: 30: Hoare triple {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {1498#(= (+ (* (- 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; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {1498#(= (+ (* (- 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; {1498#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:08,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {1498#(= (+ (* (- 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; {1497#false} is VALID [2022-02-20 18:29:08,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {1497#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1497#false} is VALID [2022-02-20 18:29:08,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {1497#false} ~mode2~0 := 0; {1497#false} is VALID [2022-02-20 18:29:08,066 INFO L290 TraceCheckUtils]: 37: Hoare triple {1497#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; {1497#false} is VALID [2022-02-20 18:29:08,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {1497#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1497#false} is VALID [2022-02-20 18:29:08,067 INFO L290 TraceCheckUtils]: 39: Hoare triple {1497#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1497#false} is VALID [2022-02-20 18:29:08,067 INFO L290 TraceCheckUtils]: 40: Hoare triple {1497#false} ~mode3~0 := 0; {1497#false} is VALID [2022-02-20 18:29:08,067 INFO L290 TraceCheckUtils]: 41: Hoare triple {1497#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1497#false} is VALID [2022-02-20 18:29:08,067 INFO L290 TraceCheckUtils]: 42: Hoare triple {1497#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1497#false} is VALID [2022-02-20 18:29:08,067 INFO L290 TraceCheckUtils]: 43: Hoare triple {1497#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1497#false} is VALID [2022-02-20 18:29:08,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {1497#false} ~mode4~0 := 0; {1497#false} is VALID [2022-02-20 18:29:08,067 INFO L290 TraceCheckUtils]: 45: Hoare triple {1497#false} assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1497#false} is VALID [2022-02-20 18:29:08,068 INFO L290 TraceCheckUtils]: 46: Hoare triple {1497#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {1497#false} is VALID [2022-02-20 18:29:08,068 INFO L290 TraceCheckUtils]: 47: Hoare triple {1497#false} check_#res#1 := check_~tmp~1#1; {1497#false} is VALID [2022-02-20 18:29:08,068 INFO L290 TraceCheckUtils]: 48: Hoare triple {1497#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {1497#false} is VALID [2022-02-20 18:29:08,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {1497#false} assume 0 == assert_~arg#1 % 256; {1497#false} is VALID [2022-02-20 18:29:08,068 INFO L290 TraceCheckUtils]: 50: Hoare triple {1497#false} assume !false; {1497#false} is VALID [2022-02-20 18:29:08,069 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:29:08,069 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:08,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936406803] [2022-02-20 18:29:08,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936406803] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:08,069 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:08,069 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:08,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427565426] [2022-02-20 18:29:08,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:08,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:29:08,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:08,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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:08,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:08,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:08,103 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:08,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:08,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:08,103 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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:08,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:08,218 INFO L93 Difference]: Finished difference Result 257 states and 387 transitions. [2022-02-20 18:29:08,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:08,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:29:08,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:08,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-02-20 18:29:08,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-02-20 18:29:08,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 226 transitions. [2022-02-20 18:29:08,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:08,360 INFO L225 Difference]: With dead ends: 257 [2022-02-20 18:29:08,360 INFO L226 Difference]: Without dead ends: 177 [2022-02-20 18:29:08,361 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:29:08,362 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 55 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 219 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:29:08,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 219 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:08,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-02-20 18:29:08,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2022-02-20 18:29:08,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:08,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 175 states, 174 states have (on average 1.4827586206896552) internal successors, (258), 174 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call 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:08,371 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 175 states, 174 states have (on average 1.4827586206896552) internal successors, (258), 174 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call 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:08,371 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 175 states, 174 states have (on average 1.4827586206896552) internal successors, (258), 174 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call 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:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:08,374 INFO L93 Difference]: Finished difference Result 177 states and 259 transitions. [2022-02-20 18:29:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 259 transitions. [2022-02-20 18:29:08,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:08,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:08,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 174 states have (on average 1.4827586206896552) internal successors, (258), 174 states have internal predecessors, (258), 0 states have call successors, (0), 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 177 states. [2022-02-20 18:29:08,376 INFO L87 Difference]: Start difference. First operand has 175 states, 174 states have (on average 1.4827586206896552) internal successors, (258), 174 states have internal predecessors, (258), 0 states have call successors, (0), 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 177 states. [2022-02-20 18:29:08,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:08,379 INFO L93 Difference]: Finished difference Result 177 states and 259 transitions. [2022-02-20 18:29:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 259 transitions. [2022-02-20 18:29:08,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:08,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:08,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:08,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.4827586206896552) internal successors, (258), 174 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call 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:08,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 258 transitions. [2022-02-20 18:29:08,383 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 258 transitions. Word has length 51 [2022-02-20 18:29:08,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:08,384 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 258 transitions. [2022-02-20 18:29:08,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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:08,384 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 258 transitions. [2022-02-20 18:29:08,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:29:08,385 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:08,385 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:08,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:29:08,385 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:08,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:08,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2093945095, now seen corresponding path program 1 times [2022-02-20 18:29:08,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:08,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358813418] [2022-02-20 18:29:08,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:08,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:08,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {2359#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {2359#true} is VALID [2022-02-20 18:29:08,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {2359#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#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~nondet8#1 && main_#t~nondet8#1 <= 127;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {2359#true} is VALID [2022-02-20 18:29:08,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {2359#true} assume 0 == ~r1~0; {2359#true} is VALID [2022-02-20 18:29:08,431 INFO L290 TraceCheckUtils]: 3: Hoare triple {2359#true} assume ~id1~0 >= 0; {2359#true} is VALID [2022-02-20 18:29:08,431 INFO L290 TraceCheckUtils]: 4: Hoare triple {2359#true} assume 0 == ~st1~0; {2359#true} is VALID [2022-02-20 18:29:08,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {2359#true} assume ~send1~0 == ~id1~0; {2359#true} is VALID [2022-02-20 18:29:08,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {2359#true} assume 0 == ~mode1~0 % 256; {2359#true} is VALID [2022-02-20 18:29:08,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {2359#true} assume ~id2~0 >= 0; {2359#true} is VALID [2022-02-20 18:29:08,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {2359#true} assume 0 == ~st2~0; {2359#true} is VALID [2022-02-20 18:29:08,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {2359#true} assume ~send2~0 == ~id2~0; {2359#true} is VALID [2022-02-20 18:29:08,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {2359#true} assume 0 == ~mode2~0 % 256; {2359#true} is VALID [2022-02-20 18:29:08,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {2359#true} assume ~id3~0 >= 0; {2359#true} is VALID [2022-02-20 18:29:08,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {2359#true} assume 0 == ~st3~0; {2359#true} is VALID [2022-02-20 18:29:08,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {2359#true} assume ~send3~0 == ~id3~0; {2359#true} is VALID [2022-02-20 18:29:08,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {2359#true} assume 0 == ~mode3~0 % 256; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == main_~i2~0#1); {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {2361#(= (+ (* (- 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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main_~i2~0#1 < 8);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; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {2361#(= (+ (* (- 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; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {2361#(= (+ (* (- 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; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,441 INFO L290 TraceCheckUtils]: 35: Hoare triple {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,441 INFO L290 TraceCheckUtils]: 36: Hoare triple {2361#(= (+ (* (- 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; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,441 INFO L290 TraceCheckUtils]: 37: Hoare triple {2361#(= (+ (* (- 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; {2361#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:08,442 INFO L290 TraceCheckUtils]: 38: Hoare triple {2361#(= (+ (* (- 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; {2360#false} is VALID [2022-02-20 18:29:08,442 INFO L290 TraceCheckUtils]: 39: Hoare triple {2360#false} assume !(node3_~m3~0#1 != ~nomsg~0); {2360#false} is VALID [2022-02-20 18:29:08,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {2360#false} ~mode3~0 := 0; {2360#false} is VALID [2022-02-20 18:29:08,442 INFO L290 TraceCheckUtils]: 41: Hoare triple {2360#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {2360#false} is VALID [2022-02-20 18:29:08,442 INFO L290 TraceCheckUtils]: 42: Hoare triple {2360#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2360#false} is VALID [2022-02-20 18:29:08,443 INFO L290 TraceCheckUtils]: 43: Hoare triple {2360#false} assume !(node4_~m4~0#1 != ~nomsg~0); {2360#false} is VALID [2022-02-20 18:29:08,443 INFO L290 TraceCheckUtils]: 44: Hoare triple {2360#false} ~mode4~0 := 0; {2360#false} is VALID [2022-02-20 18:29:08,443 INFO L290 TraceCheckUtils]: 45: Hoare triple {2360#false} assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2360#false} is VALID [2022-02-20 18:29:08,443 INFO L290 TraceCheckUtils]: 46: Hoare triple {2360#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {2360#false} is VALID [2022-02-20 18:29:08,443 INFO L290 TraceCheckUtils]: 47: Hoare triple {2360#false} check_#res#1 := check_~tmp~1#1; {2360#false} is VALID [2022-02-20 18:29:08,443 INFO L290 TraceCheckUtils]: 48: Hoare triple {2360#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {2360#false} is VALID [2022-02-20 18:29:08,443 INFO L290 TraceCheckUtils]: 49: Hoare triple {2360#false} assume 0 == assert_~arg#1 % 256; {2360#false} is VALID [2022-02-20 18:29:08,444 INFO L290 TraceCheckUtils]: 50: Hoare triple {2360#false} assume !false; {2360#false} is VALID [2022-02-20 18:29:08,444 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:29:08,444 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:08,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358813418] [2022-02-20 18:29:08,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358813418] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:08,451 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:08,451 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:08,451 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388323144] [2022-02-20 18:29:08,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:08,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:29:08,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:08,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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:08,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:08,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:08,483 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:08,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:08,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:08,484 INFO L87 Difference]: Start difference. First operand 175 states and 258 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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:08,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:08,606 INFO L93 Difference]: Finished difference Result 443 states and 676 transitions. [2022-02-20 18:29:08,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:08,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:29:08,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:08,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-02-20 18:29:08,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-02-20 18:29:08,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 226 transitions. [2022-02-20 18:29:08,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:08,759 INFO L225 Difference]: With dead ends: 443 [2022-02-20 18:29:08,759 INFO L226 Difference]: Without dead ends: 297 [2022-02-20 18:29:08,760 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:29:08,761 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 51 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 218 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:29:08,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 218 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-02-20 18:29:08,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2022-02-20 18:29:08,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:08,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 295 states, 294 states have (on average 1.5034013605442176) internal successors, (442), 294 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call 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:08,773 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 295 states, 294 states have (on average 1.5034013605442176) internal successors, (442), 294 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call 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:08,773 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 295 states, 294 states have (on average 1.5034013605442176) internal successors, (442), 294 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call 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:08,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:08,779 INFO L93 Difference]: Finished difference Result 297 states and 443 transitions. [2022-02-20 18:29:08,780 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 443 transitions. [2022-02-20 18:29:08,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:08,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:08,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 294 states have (on average 1.5034013605442176) internal successors, (442), 294 states have internal predecessors, (442), 0 states have call successors, (0), 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 297 states. [2022-02-20 18:29:08,781 INFO L87 Difference]: Start difference. First operand has 295 states, 294 states have (on average 1.5034013605442176) internal successors, (442), 294 states have internal predecessors, (442), 0 states have call successors, (0), 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 297 states. [2022-02-20 18:29:08,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:08,787 INFO L93 Difference]: Finished difference Result 297 states and 443 transitions. [2022-02-20 18:29:08,788 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 443 transitions. [2022-02-20 18:29:08,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:08,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:08,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:08,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:08,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 1.5034013605442176) internal successors, (442), 294 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call 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:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 442 transitions. [2022-02-20 18:29:08,796 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 442 transitions. Word has length 51 [2022-02-20 18:29:08,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:08,796 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 442 transitions. [2022-02-20 18:29:08,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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:08,796 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 442 transitions. [2022-02-20 18:29:08,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:29:08,797 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:08,797 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:08,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:29:08,797 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:08,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:08,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1863229059, now seen corresponding path program 1 times [2022-02-20 18:29:08,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:08,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711750570] [2022-02-20 18:29:08,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:08,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:08,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {3838#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {3838#true} is VALID [2022-02-20 18:29:08,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {3838#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#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~nondet8#1 && main_#t~nondet8#1 <= 127;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {3838#true} is VALID [2022-02-20 18:29:08,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {3838#true} assume 0 == ~r1~0; {3838#true} is VALID [2022-02-20 18:29:08,840 INFO L290 TraceCheckUtils]: 3: Hoare triple {3838#true} assume ~id1~0 >= 0; {3838#true} is VALID [2022-02-20 18:29:08,840 INFO L290 TraceCheckUtils]: 4: Hoare triple {3838#true} assume 0 == ~st1~0; {3838#true} is VALID [2022-02-20 18:29:08,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {3838#true} assume ~send1~0 == ~id1~0; {3838#true} is VALID [2022-02-20 18:29:08,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {3838#true} assume 0 == ~mode1~0 % 256; {3838#true} is VALID [2022-02-20 18:29:08,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {3838#true} assume ~id2~0 >= 0; {3838#true} is VALID [2022-02-20 18:29:08,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {3838#true} assume 0 == ~st2~0; {3838#true} is VALID [2022-02-20 18:29:08,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {3838#true} assume ~send2~0 == ~id2~0; {3838#true} is VALID [2022-02-20 18:29:08,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {3838#true} assume 0 == ~mode2~0 % 256; {3838#true} is VALID [2022-02-20 18:29:08,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {3838#true} assume ~id3~0 >= 0; {3838#true} is VALID [2022-02-20 18:29:08,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {3838#true} assume 0 == ~st3~0; {3838#true} is VALID [2022-02-20 18:29:08,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {3838#true} assume ~send3~0 == ~id3~0; {3838#true} is VALID [2022-02-20 18:29:08,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {3838#true} assume 0 == ~mode3~0 % 256; {3838#true} is VALID [2022-02-20 18:29:08,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {3838#true} assume ~id4~0 >= 0; {3838#true} is VALID [2022-02-20 18:29:08,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {3838#true} assume 0 == ~st4~0; {3838#true} is VALID [2022-02-20 18:29:08,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {3838#true} assume ~send4~0 == ~id4~0; {3838#true} is VALID [2022-02-20 18:29:08,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {3838#true} assume 0 == ~mode4~0 % 256; {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == main_~i2~0#1); {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,847 INFO L290 TraceCheckUtils]: 28: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,847 INFO L290 TraceCheckUtils]: 29: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main_~i2~0#1 < 8);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; {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,848 INFO L290 TraceCheckUtils]: 32: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~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; {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~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; {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,849 INFO L290 TraceCheckUtils]: 35: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,850 INFO L290 TraceCheckUtils]: 36: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~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; {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,850 INFO L290 TraceCheckUtils]: 37: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~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; {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,851 INFO L290 TraceCheckUtils]: 38: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,851 INFO L290 TraceCheckUtils]: 39: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,851 INFO L290 TraceCheckUtils]: 40: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~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; {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,852 INFO L290 TraceCheckUtils]: 41: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:29:08,852 INFO L290 TraceCheckUtils]: 42: Hoare triple {3840#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3839#false} is VALID [2022-02-20 18:29:08,853 INFO L290 TraceCheckUtils]: 43: Hoare triple {3839#false} assume !(node4_~m4~0#1 != ~nomsg~0); {3839#false} is VALID [2022-02-20 18:29:08,853 INFO L290 TraceCheckUtils]: 44: Hoare triple {3839#false} ~mode4~0 := 0; {3839#false} is VALID [2022-02-20 18:29:08,853 INFO L290 TraceCheckUtils]: 45: Hoare triple {3839#false} assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3839#false} is VALID [2022-02-20 18:29:08,853 INFO L290 TraceCheckUtils]: 46: Hoare triple {3839#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {3839#false} is VALID [2022-02-20 18:29:08,853 INFO L290 TraceCheckUtils]: 47: Hoare triple {3839#false} check_#res#1 := check_~tmp~1#1; {3839#false} is VALID [2022-02-20 18:29:08,853 INFO L290 TraceCheckUtils]: 48: Hoare triple {3839#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {3839#false} is VALID [2022-02-20 18:29:08,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {3839#false} assume 0 == assert_~arg#1 % 256; {3839#false} is VALID [2022-02-20 18:29:08,854 INFO L290 TraceCheckUtils]: 50: Hoare triple {3839#false} assume !false; {3839#false} is VALID [2022-02-20 18:29:08,854 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:29:08,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:08,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711750570] [2022-02-20 18:29:08,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711750570] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:08,854 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:08,855 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:08,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686689974] [2022-02-20 18:29:08,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:08,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:29:08,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:08,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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:08,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:08,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:08,887 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:08,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:08,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:08,888 INFO L87 Difference]: Start difference. First operand 295 states and 442 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:09,056 INFO L93 Difference]: Finished difference Result 779 states and 1188 transitions. [2022-02-20 18:29:09,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:09,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:29:09,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:09,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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:09,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-02-20 18:29:09,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-02-20 18:29:09,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 226 transitions. [2022-02-20 18:29:09,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:09,182 INFO L225 Difference]: With dead ends: 779 [2022-02-20 18:29:09,183 INFO L226 Difference]: Without dead ends: 513 [2022-02-20 18:29:09,183 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:29:09,186 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 47 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 217 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:29:09,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 217 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:09,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-02-20 18:29:09,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 511. [2022-02-20 18:29:09,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:09,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 513 states. Second operand has 511 states, 510 states have (on average 1.5019607843137255) internal successors, (766), 510 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call 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:09,204 INFO L74 IsIncluded]: Start isIncluded. First operand 513 states. Second operand has 511 states, 510 states have (on average 1.5019607843137255) internal successors, (766), 510 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call 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:09,204 INFO L87 Difference]: Start difference. First operand 513 states. Second operand has 511 states, 510 states have (on average 1.5019607843137255) internal successors, (766), 510 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call 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:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:09,216 INFO L93 Difference]: Finished difference Result 513 states and 767 transitions. [2022-02-20 18:29:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 767 transitions. [2022-02-20 18:29:09,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:09,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:09,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 511 states, 510 states have (on average 1.5019607843137255) internal successors, (766), 510 states have internal predecessors, (766), 0 states have call successors, (0), 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 513 states. [2022-02-20 18:29:09,218 INFO L87 Difference]: Start difference. First operand has 511 states, 510 states have (on average 1.5019607843137255) internal successors, (766), 510 states have internal predecessors, (766), 0 states have call successors, (0), 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 513 states. [2022-02-20 18:29:09,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:09,229 INFO L93 Difference]: Finished difference Result 513 states and 767 transitions. [2022-02-20 18:29:09,229 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 767 transitions. [2022-02-20 18:29:09,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:09,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:09,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:09,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 1.5019607843137255) internal successors, (766), 510 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call 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:09,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 766 transitions. [2022-02-20 18:29:09,243 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 766 transitions. Word has length 51 [2022-02-20 18:29:09,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:09,244 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 766 transitions. [2022-02-20 18:29:09,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 766 transitions. [2022-02-20 18:29:09,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:29:09,244 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:09,244 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:09,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:29:09,245 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:09,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:09,245 INFO L85 PathProgramCache]: Analyzing trace with hash -645243661, now seen corresponding path program 1 times [2022-02-20 18:29:09,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:09,246 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104456996] [2022-02-20 18:29:09,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:09,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:09,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {6441#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {6441#true} is VALID [2022-02-20 18:29:09,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {6441#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#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~nondet8#1 && main_#t~nondet8#1 <= 127;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {6441#true} is VALID [2022-02-20 18:29:09,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {6441#true} assume 0 == ~r1~0; {6441#true} is VALID [2022-02-20 18:29:09,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {6441#true} assume ~id1~0 >= 0; {6441#true} is VALID [2022-02-20 18:29:09,305 INFO L290 TraceCheckUtils]: 4: Hoare triple {6441#true} assume 0 == ~st1~0; {6443#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:09,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {6443#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {6443#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:09,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {6443#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {6443#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:09,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {6443#(<= ~st1~0 0)} assume ~id2~0 >= 0; {6443#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:09,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {6443#(<= ~st1~0 0)} assume 0 == ~st2~0; {6444#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {6444#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {6444#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {6444#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6444#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {6444#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {6444#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {6444#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6445#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {6445#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {6445#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {6445#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {6445#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {6445#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {6445#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {6445#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~i2~0#1); {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {6446#(<= (+ ~st4~0 ~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 8);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; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {6446#(<= (+ ~st4~0 ~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; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {6446#(<= (+ ~st4~0 ~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; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {6446#(<= (+ ~st4~0 ~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; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {6446#(<= (+ ~st4~0 ~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; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,317 INFO L290 TraceCheckUtils]: 39: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,317 INFO L290 TraceCheckUtils]: 40: Hoare triple {6446#(<= (+ ~st4~0 ~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; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,317 INFO L290 TraceCheckUtils]: 41: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,318 INFO L290 TraceCheckUtils]: 43: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,318 INFO L290 TraceCheckUtils]: 44: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,319 INFO L290 TraceCheckUtils]: 45: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:09,319 INFO L290 TraceCheckUtils]: 46: Hoare triple {6446#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {6442#false} is VALID [2022-02-20 18:29:09,319 INFO L290 TraceCheckUtils]: 47: Hoare triple {6442#false} check_#res#1 := check_~tmp~1#1; {6442#false} is VALID [2022-02-20 18:29:09,319 INFO L290 TraceCheckUtils]: 48: Hoare triple {6442#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {6442#false} is VALID [2022-02-20 18:29:09,320 INFO L290 TraceCheckUtils]: 49: Hoare triple {6442#false} assume 0 == assert_~arg#1 % 256; {6442#false} is VALID [2022-02-20 18:29:09,320 INFO L290 TraceCheckUtils]: 50: Hoare triple {6442#false} assume !false; {6442#false} is VALID [2022-02-20 18:29:09,320 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:29:09,320 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:09,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104456996] [2022-02-20 18:29:09,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104456996] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:09,321 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:09,321 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:29:09,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683083145] [2022-02-20 18:29:09,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:09,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:29:09,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:09,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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:09,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:09,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:29:09,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:09,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:29:09,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:29:09,351 INFO L87 Difference]: Start difference. First operand 511 states and 766 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:11,406 INFO L93 Difference]: Finished difference Result 4367 states and 6662 transitions. [2022-02-20 18:29:11,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 18:29:11,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:29:11,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 650 transitions. [2022-02-20 18:29:11,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 650 transitions. [2022-02-20 18:29:11,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 650 transitions. [2022-02-20 18:29:11,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 650 edges. 650 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:12,780 INFO L225 Difference]: With dead ends: 4367 [2022-02-20 18:29:12,786 INFO L226 Difference]: Without dead ends: 3885 [2022-02-20 18:29:12,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:29:12,789 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 765 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:12,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 629 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:12,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3885 states. [2022-02-20 18:29:13,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3885 to 991. [2022-02-20 18:29:13,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:13,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3885 states. Second operand has 991 states, 990 states have (on average 1.4848484848484849) internal successors, (1470), 990 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call 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,337 INFO L74 IsIncluded]: Start isIncluded. First operand 3885 states. Second operand has 991 states, 990 states have (on average 1.4848484848484849) internal successors, (1470), 990 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call 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,339 INFO L87 Difference]: Start difference. First operand 3885 states. Second operand has 991 states, 990 states have (on average 1.4848484848484849) internal successors, (1470), 990 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call 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,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:13,977 INFO L93 Difference]: Finished difference Result 3885 states and 5797 transitions. [2022-02-20 18:29:13,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 5797 transitions. [2022-02-20 18:29:13,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:13,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:13,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 991 states, 990 states have (on average 1.4848484848484849) internal successors, (1470), 990 states have internal predecessors, (1470), 0 states have call successors, (0), 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 3885 states. [2022-02-20 18:29:13,987 INFO L87 Difference]: Start difference. First operand has 991 states, 990 states have (on average 1.4848484848484849) internal successors, (1470), 990 states have internal predecessors, (1470), 0 states have call successors, (0), 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 3885 states. [2022-02-20 18:29:14,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:14,465 INFO L93 Difference]: Finished difference Result 3885 states and 5797 transitions. [2022-02-20 18:29:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 5797 transitions. [2022-02-20 18:29:14,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:14,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:14,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:14,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:14,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 1.4848484848484849) internal successors, (1470), 990 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call 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:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1470 transitions. [2022-02-20 18:29:14,510 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1470 transitions. Word has length 51 [2022-02-20 18:29:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:14,510 INFO L470 AbstractCegarLoop]: Abstraction has 991 states and 1470 transitions. [2022-02-20 18:29:14,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1470 transitions. [2022-02-20 18:29:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:29:14,511 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:14,511 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:14,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:29:14,512 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:14,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:14,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1275401347, now seen corresponding path program 1 times [2022-02-20 18:29:14,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:14,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781554199] [2022-02-20 18:29:14,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:14,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:14,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {20822#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {20822#true} is VALID [2022-02-20 18:29:14,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {20822#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#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~nondet8#1 && main_#t~nondet8#1 <= 127;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {20822#true} is VALID [2022-02-20 18:29:14,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {20822#true} assume 0 == ~r1~0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {20824#(<= ~r1~0 0)} assume ~id1~0 >= 0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,551 INFO L290 TraceCheckUtils]: 4: Hoare triple {20824#(<= ~r1~0 0)} assume 0 == ~st1~0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {20824#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {20824#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {20824#(<= ~r1~0 0)} assume ~id2~0 >= 0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {20824#(<= ~r1~0 0)} assume 0 == ~st2~0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {20824#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {20824#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {20824#(<= ~r1~0 0)} assume ~id3~0 >= 0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {20824#(<= ~r1~0 0)} assume 0 == ~st3~0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {20824#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {20824#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {20824#(<= ~r1~0 0)} assume ~id4~0 >= 0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {20824#(<= ~r1~0 0)} assume 0 == ~st4~0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {20824#(<= ~r1~0 0)} assume ~send4~0 == ~id4~0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {20824#(<= ~r1~0 0)} assume 0 == ~mode4~0 % 256; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {20824#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {20824#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {20824#(<= ~r1~0 0)} assume ~id1~0 != ~id4~0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {20824#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {20824#(<= ~r1~0 0)} assume ~id2~0 != ~id4~0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {20824#(<= ~r1~0 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {20824#(<= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {20824#(<= ~r1~0 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {20824#(<= ~r1~0 0)} assume !(0 == main_~i2~0#1); {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {20824#(<= ~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,559 INFO L290 TraceCheckUtils]: 29: Hoare triple {20824#(<= ~r1~0 0)} assume !!(main_~i2~0#1 < 8);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; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {20824#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,559 INFO L290 TraceCheckUtils]: 31: Hoare triple {20824#(<= ~r1~0 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,560 INFO L290 TraceCheckUtils]: 32: Hoare triple {20824#(<= ~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; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,560 INFO L290 TraceCheckUtils]: 33: Hoare triple {20824#(<= ~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; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,560 INFO L290 TraceCheckUtils]: 34: Hoare triple {20824#(<= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,560 INFO L290 TraceCheckUtils]: 35: Hoare triple {20824#(<= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,561 INFO L290 TraceCheckUtils]: 36: Hoare triple {20824#(<= ~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; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,561 INFO L290 TraceCheckUtils]: 37: Hoare triple {20824#(<= ~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; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,561 INFO L290 TraceCheckUtils]: 38: Hoare triple {20824#(<= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,562 INFO L290 TraceCheckUtils]: 39: Hoare triple {20824#(<= ~r1~0 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,562 INFO L290 TraceCheckUtils]: 40: Hoare triple {20824#(<= ~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; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,562 INFO L290 TraceCheckUtils]: 41: Hoare triple {20824#(<= ~r1~0 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,563 INFO L290 TraceCheckUtils]: 42: Hoare triple {20824#(<= ~r1~0 0)} assume !(0 != ~mode4~0 % 256); {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,563 INFO L290 TraceCheckUtils]: 43: Hoare triple {20824#(<= ~r1~0 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,563 INFO L290 TraceCheckUtils]: 44: Hoare triple {20824#(<= ~r1~0 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,564 INFO L290 TraceCheckUtils]: 45: Hoare triple {20824#(<= ~r1~0 0)} assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,564 INFO L290 TraceCheckUtils]: 46: Hoare triple {20824#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {20824#(<= ~r1~0 0)} is VALID [2022-02-20 18:29:14,564 INFO L290 TraceCheckUtils]: 47: Hoare triple {20824#(<= ~r1~0 0)} assume ~r1~0 >= 4; {20823#false} is VALID [2022-02-20 18:29:14,564 INFO L290 TraceCheckUtils]: 48: Hoare triple {20823#false} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {20823#false} is VALID [2022-02-20 18:29:14,565 INFO L290 TraceCheckUtils]: 49: Hoare triple {20823#false} check_#res#1 := check_~tmp~1#1; {20823#false} is VALID [2022-02-20 18:29:14,565 INFO L290 TraceCheckUtils]: 50: Hoare triple {20823#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {20823#false} is VALID [2022-02-20 18:29:14,565 INFO L290 TraceCheckUtils]: 51: Hoare triple {20823#false} assume 0 == assert_~arg#1 % 256; {20823#false} is VALID [2022-02-20 18:29:14,565 INFO L290 TraceCheckUtils]: 52: Hoare triple {20823#false} assume !false; {20823#false} is VALID [2022-02-20 18:29:14,565 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:29:14,565 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:14,566 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781554199] [2022-02-20 18:29:14,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781554199] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:14,566 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:14,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:14,566 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473724568] [2022-02-20 18:29:14,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:14,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:29:14,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:14,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:14,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:14,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:14,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:14,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:14,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:14,606 INFO L87 Difference]: Start difference. First operand 991 states and 1470 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:15,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:15,770 INFO L93 Difference]: Finished difference Result 2397 states and 3570 transitions. [2022-02-20 18:29:15,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:15,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:29:15,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:15,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2022-02-20 18:29:15,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2022-02-20 18:29:15,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 227 transitions. [2022-02-20 18:29:15,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:15,980 INFO L225 Difference]: With dead ends: 2397 [2022-02-20 18:29:15,980 INFO L226 Difference]: Without dead ends: 1435 [2022-02-20 18:29:15,981 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:29:15,982 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 39 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 184 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:29:15,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 184 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:15,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2022-02-20 18:29:16,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1433. [2022-02-20 18:29:16,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:16,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1435 states. Second operand has 1433 states, 1432 states have (on average 1.4692737430167597) internal successors, (2104), 1432 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call 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:16,774 INFO L74 IsIncluded]: Start isIncluded. First operand 1435 states. Second operand has 1433 states, 1432 states have (on average 1.4692737430167597) internal successors, (2104), 1432 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call 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:16,776 INFO L87 Difference]: Start difference. First operand 1435 states. Second operand has 1433 states, 1432 states have (on average 1.4692737430167597) internal successors, (2104), 1432 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call 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:16,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:16,851 INFO L93 Difference]: Finished difference Result 1435 states and 2105 transitions. [2022-02-20 18:29:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2105 transitions. [2022-02-20 18:29:16,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:16,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:16,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 1433 states, 1432 states have (on average 1.4692737430167597) internal successors, (2104), 1432 states have internal predecessors, (2104), 0 states have call successors, (0), 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 1435 states. [2022-02-20 18:29:16,858 INFO L87 Difference]: Start difference. First operand has 1433 states, 1432 states have (on average 1.4692737430167597) internal successors, (2104), 1432 states have internal predecessors, (2104), 0 states have call successors, (0), 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 1435 states. [2022-02-20 18:29:16,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:16,915 INFO L93 Difference]: Finished difference Result 1435 states and 2105 transitions. [2022-02-20 18:29:16,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2105 transitions. [2022-02-20 18:29:16,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:16,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:16,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:16,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:16,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1432 states have (on average 1.4692737430167597) internal successors, (2104), 1432 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call 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:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2104 transitions. [2022-02-20 18:29:16,992 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2104 transitions. Word has length 53 [2022-02-20 18:29:16,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:16,992 INFO L470 AbstractCegarLoop]: Abstraction has 1433 states and 2104 transitions. [2022-02-20 18:29:16,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:16,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2104 transitions. [2022-02-20 18:29:16,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:29:16,993 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:16,993 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:16,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:29:16,993 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:16,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:16,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1341894859, now seen corresponding path program 1 times [2022-02-20 18:29:16,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:16,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348495026] [2022-02-20 18:29:16,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:16,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:17,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {28411#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {28411#true} is VALID [2022-02-20 18:29:17,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {28411#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#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~nondet8#1 && main_#t~nondet8#1 <= 127;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {28411#true} is VALID [2022-02-20 18:29:17,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {28411#true} assume 0 == ~r1~0; {28411#true} is VALID [2022-02-20 18:29:17,178 INFO L290 TraceCheckUtils]: 3: Hoare triple {28411#true} assume ~id1~0 >= 0; {28411#true} is VALID [2022-02-20 18:29:17,179 INFO L290 TraceCheckUtils]: 4: Hoare triple {28411#true} assume 0 == ~st1~0; {28413#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:29:17,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {28413#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~send1~0 == ~id1~0; {28413#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:29:17,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {28413#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~mode1~0 % 256; {28413#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:29:17,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {28413#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~id2~0 >= 0; {28413#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:29:17,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {28413#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~st2~0; {28414#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:29:17,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {28414#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {28414#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:29:17,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {28414#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {28414#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:29:17,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {28414#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {28414#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:29:17,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {28414#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {28415#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:29:17,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {28415#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {28415#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:29:17,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {28415#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {28415#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:29:17,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {28415#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {28415#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:29:17,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {28415#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 == ~id4~0; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 == ~mode4~0 % 256; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id2~0; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id3~0; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id4~0; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id3~0; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id4~0; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,196 INFO L290 TraceCheckUtils]: 24: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} init_#res#1 := init_~tmp~0#1; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == main_~i2~0#1); {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(main_~i2~0#1 < 8);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; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode1~0 % 256); {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,198 INFO L290 TraceCheckUtils]: 31: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~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; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode2~0 % 256); {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,200 INFO L290 TraceCheckUtils]: 35: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~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; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,205 INFO L290 TraceCheckUtils]: 38: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode3~0 % 256); {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,205 INFO L290 TraceCheckUtils]: 39: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,206 INFO L290 TraceCheckUtils]: 40: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,206 INFO L290 TraceCheckUtils]: 42: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 != ~mode4~0 % 256); {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,207 INFO L290 TraceCheckUtils]: 44: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,208 INFO L290 TraceCheckUtils]: 45: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,211 INFO L290 TraceCheckUtils]: 46: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,211 INFO L290 TraceCheckUtils]: 47: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 >= 4); {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:29:17,217 INFO L290 TraceCheckUtils]: 48: Hoare triple {28416#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);check_~tmp~1#1 := 0; {28412#false} is VALID [2022-02-20 18:29:17,218 INFO L290 TraceCheckUtils]: 49: Hoare triple {28412#false} check_#res#1 := check_~tmp~1#1; {28412#false} is VALID [2022-02-20 18:29:17,218 INFO L290 TraceCheckUtils]: 50: Hoare triple {28412#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {28412#false} is VALID [2022-02-20 18:29:17,218 INFO L290 TraceCheckUtils]: 51: Hoare triple {28412#false} assume 0 == assert_~arg#1 % 256; {28412#false} is VALID [2022-02-20 18:29:17,218 INFO L290 TraceCheckUtils]: 52: Hoare triple {28412#false} assume !false; {28412#false} is VALID [2022-02-20 18:29:17,220 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:29:17,220 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:17,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348495026] [2022-02-20 18:29:17,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348495026] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:17,221 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:17,221 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:29:17,221 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012045029] [2022-02-20 18:29:17,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:17,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:29:17,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:17,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:17,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:17,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:29:17,277 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:17,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:29:17,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:29:17,278 INFO L87 Difference]: Start difference. First operand 1433 states and 2104 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:18,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:18,569 INFO L93 Difference]: Finished difference Result 2837 states and 4178 transitions. [2022-02-20 18:29:18,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:29:18,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:29:18,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:18,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:18,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2022-02-20 18:29:18,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:18,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2022-02-20 18:29:18,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 234 transitions. [2022-02-20 18:29:18,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:18,791 INFO L225 Difference]: With dead ends: 2837 [2022-02-20 18:29:18,791 INFO L226 Difference]: Without dead ends: 1435 [2022-02-20 18:29:18,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:29:18,795 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 151 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:18,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 354 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:18,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2022-02-20 18:29:19,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1433. [2022-02-20 18:29:19,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:19,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1435 states. Second operand has 1433 states, 1432 states have (on average 1.452513966480447) internal successors, (2080), 1432 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call 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,432 INFO L74 IsIncluded]: Start isIncluded. First operand 1435 states. Second operand has 1433 states, 1432 states have (on average 1.452513966480447) internal successors, (2080), 1432 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call 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,433 INFO L87 Difference]: Start difference. First operand 1435 states. Second operand has 1433 states, 1432 states have (on average 1.452513966480447) internal successors, (2080), 1432 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call 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,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:19,489 INFO L93 Difference]: Finished difference Result 1435 states and 2081 transitions. [2022-02-20 18:29:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2081 transitions. [2022-02-20 18:29:19,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:19,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:19,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 1433 states, 1432 states have (on average 1.452513966480447) internal successors, (2080), 1432 states have internal predecessors, (2080), 0 states have call successors, (0), 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 1435 states. [2022-02-20 18:29:19,493 INFO L87 Difference]: Start difference. First operand has 1433 states, 1432 states have (on average 1.452513966480447) internal successors, (2080), 1432 states have internal predecessors, (2080), 0 states have call successors, (0), 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 1435 states. [2022-02-20 18:29:19,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:19,548 INFO L93 Difference]: Finished difference Result 1435 states and 2081 transitions. [2022-02-20 18:29:19,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2081 transitions. [2022-02-20 18:29:19,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:19,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:19,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:19,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1432 states have (on average 1.452513966480447) internal successors, (2080), 1432 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call 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,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2080 transitions. [2022-02-20 18:29:19,624 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2080 transitions. Word has length 53 [2022-02-20 18:29:19,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:19,624 INFO L470 AbstractCegarLoop]: Abstraction has 1433 states and 2080 transitions. [2022-02-20 18:29:19,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:19,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2080 transitions. [2022-02-20 18:29:19,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:29:19,625 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:19,625 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:19,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:29:19,625 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:19,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:19,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1765655459, now seen corresponding path program 1 times [2022-02-20 18:29:19,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:19,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774943142] [2022-02-20 18:29:19,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:19,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:19,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {36551#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {36551#true} is VALID [2022-02-20 18:29:19,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {36551#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#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~nondet8#1 && main_#t~nondet8#1 <= 127;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {36551#true} is VALID [2022-02-20 18:29:19,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {36551#true} assume 0 == ~r1~0; {36551#true} is VALID [2022-02-20 18:29:19,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {36551#true} assume ~id1~0 >= 0; {36551#true} is VALID [2022-02-20 18:29:19,713 INFO L290 TraceCheckUtils]: 4: Hoare triple {36551#true} assume 0 == ~st1~0; {36551#true} is VALID [2022-02-20 18:29:19,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {36551#true} assume ~send1~0 == ~id1~0; {36551#true} is VALID [2022-02-20 18:29:19,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {36551#true} assume 0 == ~mode1~0 % 256; {36551#true} is VALID [2022-02-20 18:29:19,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {36551#true} assume ~id2~0 >= 0; {36551#true} is VALID [2022-02-20 18:29:19,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {36551#true} assume 0 == ~st2~0; {36551#true} is VALID [2022-02-20 18:29:19,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {36551#true} assume ~send2~0 == ~id2~0; {36551#true} is VALID [2022-02-20 18:29:19,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {36551#true} assume 0 == ~mode2~0 % 256; {36551#true} is VALID [2022-02-20 18:29:19,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {36551#true} assume ~id3~0 >= 0; {36551#true} is VALID [2022-02-20 18:29:19,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {36551#true} assume 0 == ~st3~0; {36551#true} is VALID [2022-02-20 18:29:19,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {36551#true} assume ~send3~0 == ~id3~0; {36551#true} is VALID [2022-02-20 18:29:19,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {36551#true} assume 0 == ~mode3~0 % 256; {36551#true} is VALID [2022-02-20 18:29:19,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {36551#true} assume ~id4~0 >= 0; {36551#true} is VALID [2022-02-20 18:29:19,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {36551#true} assume 0 == ~st4~0; {36551#true} is VALID [2022-02-20 18:29:19,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {36551#true} assume ~send4~0 == ~id4~0; {36551#true} is VALID [2022-02-20 18:29:19,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {36551#true} assume 0 == ~mode4~0 % 256; {36551#true} is VALID [2022-02-20 18:29:19,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {36551#true} assume ~id1~0 != ~id2~0; {36551#true} is VALID [2022-02-20 18:29:19,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {36551#true} assume ~id1~0 != ~id3~0; {36551#true} is VALID [2022-02-20 18:29:19,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {36551#true} assume ~id1~0 != ~id4~0; {36551#true} is VALID [2022-02-20 18:29:19,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {36551#true} assume ~id2~0 != ~id3~0; {36551#true} is VALID [2022-02-20 18:29:19,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {36551#true} assume ~id2~0 != ~id4~0; {36551#true} is VALID [2022-02-20 18:29:19,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {36551#true} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {36553#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 18:29:19,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {36553#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {36554#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 18:29:19,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {36554#(= |ULTIMATE.start_init_#res#1| 1)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {36555#(= |ULTIMATE.start_main_~i2~0#1| 1)} is VALID [2022-02-20 18:29:19,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {36555#(= |ULTIMATE.start_main_~i2~0#1| 1)} assume !(0 == main_~i2~0#1); {36551#true} is VALID [2022-02-20 18:29:19,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {36551#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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {36551#true} is VALID [2022-02-20 18:29:19,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {36551#true} assume !!(main_~i2~0#1 < 8);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; {36551#true} is VALID [2022-02-20 18:29:19,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {36551#true} assume !(0 != ~mode1~0 % 256); {36551#true} is VALID [2022-02-20 18:29:19,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {36551#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {36551#true} is VALID [2022-02-20 18:29:19,717 INFO L290 TraceCheckUtils]: 32: Hoare triple {36551#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; {36551#true} is VALID [2022-02-20 18:29:19,717 INFO L290 TraceCheckUtils]: 33: Hoare triple {36551#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; {36551#true} is VALID [2022-02-20 18:29:19,717 INFO L290 TraceCheckUtils]: 34: Hoare triple {36551#true} assume !(0 != ~mode2~0 % 256); {36551#true} is VALID [2022-02-20 18:29:19,717 INFO L290 TraceCheckUtils]: 35: Hoare triple {36551#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {36551#true} is VALID [2022-02-20 18:29:19,717 INFO L290 TraceCheckUtils]: 36: Hoare triple {36551#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; {36551#true} is VALID [2022-02-20 18:29:19,718 INFO L290 TraceCheckUtils]: 37: Hoare triple {36551#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; {36551#true} is VALID [2022-02-20 18:29:19,718 INFO L290 TraceCheckUtils]: 38: Hoare triple {36551#true} assume !(0 != ~mode3~0 % 256); {36551#true} is VALID [2022-02-20 18:29:19,718 INFO L290 TraceCheckUtils]: 39: Hoare triple {36551#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {36551#true} is VALID [2022-02-20 18:29:19,718 INFO L290 TraceCheckUtils]: 40: Hoare triple {36551#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; {36551#true} is VALID [2022-02-20 18:29:19,718 INFO L290 TraceCheckUtils]: 41: Hoare triple {36551#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {36551#true} is VALID [2022-02-20 18:29:19,718 INFO L290 TraceCheckUtils]: 42: Hoare triple {36551#true} assume !(0 != ~mode4~0 % 256); {36551#true} is VALID [2022-02-20 18:29:19,718 INFO L290 TraceCheckUtils]: 43: Hoare triple {36551#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {36551#true} is VALID [2022-02-20 18:29:19,718 INFO L290 TraceCheckUtils]: 44: Hoare triple {36551#true} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {36551#true} is VALID [2022-02-20 18:29:19,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {36551#true} assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {36551#true} is VALID [2022-02-20 18:29:19,719 INFO L290 TraceCheckUtils]: 46: Hoare triple {36551#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {36551#true} is VALID [2022-02-20 18:29:19,719 INFO L290 TraceCheckUtils]: 47: Hoare triple {36551#true} assume !(~r1~0 >= 4); {36551#true} is VALID [2022-02-20 18:29:19,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {36551#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {36551#true} is VALID [2022-02-20 18:29:19,719 INFO L290 TraceCheckUtils]: 49: Hoare triple {36551#true} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {36556#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 18:29:19,720 INFO L290 TraceCheckUtils]: 50: Hoare triple {36556#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {36557#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 18:29:19,720 INFO L290 TraceCheckUtils]: 51: Hoare triple {36557#(not (= 0 |ULTIMATE.start_check_#res#1|))} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {36558#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 18:29:19,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {36558#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {36552#false} is VALID [2022-02-20 18:29:19,721 INFO L290 TraceCheckUtils]: 53: Hoare triple {36552#false} assume !false; {36552#false} is VALID [2022-02-20 18:29:19,721 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:29:19,721 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:19,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774943142] [2022-02-20 18:29:19,721 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774943142] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:19,721 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:19,721 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:29:19,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510415035] [2022-02-20 18:29:19,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:19,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:29:19,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:19,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:19,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:19,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:29:19,758 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:19,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:29:19,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:29:19,758 INFO L87 Difference]: Start difference. First operand 1433 states and 2080 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:21,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:21,845 INFO L93 Difference]: Finished difference Result 2664 states and 3817 transitions. [2022-02-20 18:29:21,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:29:21,845 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:29:21,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:21,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2022-02-20 18:29:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2022-02-20 18:29:21,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 171 transitions. [2022-02-20 18:29:21,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:22,224 INFO L225 Difference]: With dead ends: 2664 [2022-02-20 18:29:22,224 INFO L226 Difference]: Without dead ends: 2662 [2022-02-20 18:29:22,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-02-20 18:29:22,225 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 412 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:22,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 554 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:22,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2022-02-20 18:29:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 1529. [2022-02-20 18:29:23,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:23,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2662 states. Second operand has 1529 states, 1528 states have (on average 1.418848167539267) internal successors, (2168), 1528 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call 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:23,150 INFO L74 IsIncluded]: Start isIncluded. First operand 2662 states. Second operand has 1529 states, 1528 states have (on average 1.418848167539267) internal successors, (2168), 1528 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call 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:23,151 INFO L87 Difference]: Start difference. First operand 2662 states. Second operand has 1529 states, 1528 states have (on average 1.418848167539267) internal successors, (2168), 1528 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call 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:23,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:23,343 INFO L93 Difference]: Finished difference Result 2662 states and 3776 transitions. [2022-02-20 18:29:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3776 transitions. [2022-02-20 18:29:23,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:23,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:23,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 1529 states, 1528 states have (on average 1.418848167539267) internal successors, (2168), 1528 states have internal predecessors, (2168), 0 states have call successors, (0), 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 2662 states. [2022-02-20 18:29:23,349 INFO L87 Difference]: Start difference. First operand has 1529 states, 1528 states have (on average 1.418848167539267) internal successors, (2168), 1528 states have internal predecessors, (2168), 0 states have call successors, (0), 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 2662 states. [2022-02-20 18:29:23,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:23,550 INFO L93 Difference]: Finished difference Result 2662 states and 3776 transitions. [2022-02-20 18:29:23,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3776 transitions. [2022-02-20 18:29:23,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:23,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:23,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:23,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1528 states have (on average 1.418848167539267) internal successors, (2168), 1528 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call 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:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2168 transitions. [2022-02-20 18:29:23,635 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2168 transitions. Word has length 54 [2022-02-20 18:29:23,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:23,636 INFO L470 AbstractCegarLoop]: Abstraction has 1529 states and 2168 transitions. [2022-02-20 18:29:23,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:23,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2168 transitions. [2022-02-20 18:29:23,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:29:23,637 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:23,637 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:23,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:29:23,637 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:23,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:23,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1473223963, now seen corresponding path program 1 times [2022-02-20 18:29:23,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:23,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425519269] [2022-02-20 18:29:23,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:23,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:23,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {47120#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {47120#true} is VALID [2022-02-20 18:29:23,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {47120#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#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~nondet8#1 && main_#t~nondet8#1 <= 127;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {47120#true} is VALID [2022-02-20 18:29:23,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {47120#true} assume 0 == ~r1~0; {47120#true} is VALID [2022-02-20 18:29:23,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {47120#true} assume ~id1~0 >= 0; {47120#true} is VALID [2022-02-20 18:29:23,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {47120#true} assume 0 == ~st1~0; {47122#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:23,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {47122#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {47122#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:23,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {47122#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {47122#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:23,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {47122#(<= ~st1~0 0)} assume ~id2~0 >= 0; {47122#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:23,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {47122#(<= ~st1~0 0)} assume 0 == ~st2~0; {47123#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {47123#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {47123#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {47123#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {47123#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {47123#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {47123#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {47123#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~i2~0#1); {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {47124#(<= (+ ~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 8);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; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,748 INFO L290 TraceCheckUtils]: 31: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {47124#(<= (+ ~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; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {47124#(<= (+ ~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; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,750 INFO L290 TraceCheckUtils]: 35: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,751 INFO L290 TraceCheckUtils]: 36: Hoare triple {47124#(<= (+ ~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; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,751 INFO L290 TraceCheckUtils]: 37: Hoare triple {47124#(<= (+ ~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; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,752 INFO L290 TraceCheckUtils]: 38: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,752 INFO L290 TraceCheckUtils]: 39: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,752 INFO L290 TraceCheckUtils]: 40: Hoare triple {47124#(<= (+ ~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; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,752 INFO L290 TraceCheckUtils]: 41: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,753 INFO L290 TraceCheckUtils]: 42: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,753 INFO L290 TraceCheckUtils]: 43: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,753 INFO L290 TraceCheckUtils]: 44: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,754 INFO L290 TraceCheckUtils]: 45: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,754 INFO L290 TraceCheckUtils]: 46: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,754 INFO L290 TraceCheckUtils]: 47: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 4); {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,754 INFO L290 TraceCheckUtils]: 48: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,755 INFO L290 TraceCheckUtils]: 49: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,755 INFO L290 TraceCheckUtils]: 50: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,755 INFO L290 TraceCheckUtils]: 51: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,756 INFO L290 TraceCheckUtils]: 52: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,756 INFO L290 TraceCheckUtils]: 53: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assert } true;main_#t~post27#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,756 INFO L290 TraceCheckUtils]: 54: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 8);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; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,757 INFO L290 TraceCheckUtils]: 55: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,757 INFO L290 TraceCheckUtils]: 56: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node1_~m1~0#1 != ~nomsg~0); {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,757 INFO L290 TraceCheckUtils]: 57: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,757 INFO L290 TraceCheckUtils]: 58: Hoare triple {47124#(<= (+ ~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; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,758 INFO L290 TraceCheckUtils]: 59: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,758 INFO L290 TraceCheckUtils]: 60: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node2_~m2~0#1 != ~nomsg~0); {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,758 INFO L290 TraceCheckUtils]: 61: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,759 INFO L290 TraceCheckUtils]: 62: Hoare triple {47124#(<= (+ ~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; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,759 INFO L290 TraceCheckUtils]: 63: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,759 INFO L290 TraceCheckUtils]: 64: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node3_~m3~0#1 != ~nomsg~0); {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,759 INFO L290 TraceCheckUtils]: 65: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,760 INFO L290 TraceCheckUtils]: 66: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,760 INFO L290 TraceCheckUtils]: 67: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,760 INFO L290 TraceCheckUtils]: 68: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume node4_~m4~0#1 != ~nomsg~0; {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,761 INFO L290 TraceCheckUtils]: 69: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node4_~m4~0#1 > ~id4~0); {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:23,761 INFO L290 TraceCheckUtils]: 70: Hoare triple {47124#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume node4_~m4~0#1 == ~id4~0;~st4~0 := 1; {47125#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:29:23,761 INFO L290 TraceCheckUtils]: 71: Hoare triple {47125#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} ~mode4~0 := 0; {47125#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:29:23,762 INFO L290 TraceCheckUtils]: 72: Hoare triple {47125#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {47125#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:29:23,762 INFO L290 TraceCheckUtils]: 73: Hoare triple {47125#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {47121#false} is VALID [2022-02-20 18:29:23,762 INFO L290 TraceCheckUtils]: 74: Hoare triple {47121#false} check_#res#1 := check_~tmp~1#1; {47121#false} is VALID [2022-02-20 18:29:23,762 INFO L290 TraceCheckUtils]: 75: Hoare triple {47121#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {47121#false} is VALID [2022-02-20 18:29:23,763 INFO L290 TraceCheckUtils]: 76: Hoare triple {47121#false} assume 0 == assert_~arg#1 % 256; {47121#false} is VALID [2022-02-20 18:29:23,763 INFO L290 TraceCheckUtils]: 77: Hoare triple {47121#false} assume !false; {47121#false} is VALID [2022-02-20 18:29:23,764 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 18:29:23,764 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:23,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425519269] [2022-02-20 18:29:23,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425519269] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:23,765 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:23,765 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:29:23,765 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732645430] [2022-02-20 18:29:23,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:23,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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 78 [2022-02-20 18:29:23,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:23,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call 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:23,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:23,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:29:23,824 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:23,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:29:23,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:29:23,824 INFO L87 Difference]: Start difference. First operand 1529 states and 2168 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call 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:29,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:29,998 INFO L93 Difference]: Finished difference Result 7835 states and 11137 transitions. [2022-02-20 18:29:29,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:29:29,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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 78 [2022-02-20 18:29:29,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call 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:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 440 transitions. [2022-02-20 18:29:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call 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:30,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 440 transitions. [2022-02-20 18:29:30,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 440 transitions. [2022-02-20 18:29:30,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:31,730 INFO L225 Difference]: With dead ends: 7835 [2022-02-20 18:29:31,730 INFO L226 Difference]: Without dead ends: 6337 [2022-02-20 18:29:31,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:29:31,740 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 445 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:31,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [445 Valid, 475 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:31,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2022-02-20 18:29:33,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 3025. [2022-02-20 18:29:33,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:33,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6337 states. Second operand has 3025 states, 3024 states have (on average 1.4153439153439153) internal successors, (4280), 3024 states have internal predecessors, (4280), 0 states have call successors, (0), 0 states have call 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:33,147 INFO L74 IsIncluded]: Start isIncluded. First operand 6337 states. Second operand has 3025 states, 3024 states have (on average 1.4153439153439153) internal successors, (4280), 3024 states have internal predecessors, (4280), 0 states have call successors, (0), 0 states have call 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:33,156 INFO L87 Difference]: Start difference. First operand 6337 states. Second operand has 3025 states, 3024 states have (on average 1.4153439153439153) internal successors, (4280), 3024 states have internal predecessors, (4280), 0 states have call successors, (0), 0 states have call 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:34,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:34,518 INFO L93 Difference]: Finished difference Result 6337 states and 8976 transitions. [2022-02-20 18:29:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 6337 states and 8976 transitions. [2022-02-20 18:29:34,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:34,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:34,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 3025 states, 3024 states have (on average 1.4153439153439153) internal successors, (4280), 3024 states have internal predecessors, (4280), 0 states have call successors, (0), 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 6337 states. [2022-02-20 18:29:34,528 INFO L87 Difference]: Start difference. First operand has 3025 states, 3024 states have (on average 1.4153439153439153) internal successors, (4280), 3024 states have internal predecessors, (4280), 0 states have call successors, (0), 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 6337 states. [2022-02-20 18:29:35,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:35,826 INFO L93 Difference]: Finished difference Result 6337 states and 8976 transitions. [2022-02-20 18:29:35,826 INFO L276 IsEmpty]: Start isEmpty. Operand 6337 states and 8976 transitions. [2022-02-20 18:29:35,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:35,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:35,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:35,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3025 states, 3024 states have (on average 1.4153439153439153) internal successors, (4280), 3024 states have internal predecessors, (4280), 0 states have call successors, (0), 0 states have call 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:36,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 4280 transitions. [2022-02-20 18:29:36,169 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 4280 transitions. Word has length 78 [2022-02-20 18:29:36,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:36,169 INFO L470 AbstractCegarLoop]: Abstraction has 3025 states and 4280 transitions. [2022-02-20 18:29:36,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call 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:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 4280 transitions. [2022-02-20 18:29:36,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:29:36,172 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:36,172 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:36,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:29:36,172 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:36,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:36,173 INFO L85 PathProgramCache]: Analyzing trace with hash -295558853, now seen corresponding path program 1 times [2022-02-20 18:29:36,173 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:36,173 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745287810] [2022-02-20 18:29:36,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:36,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:36,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {73273#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {73273#true} is VALID [2022-02-20 18:29:36,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {73273#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#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~nondet8#1 && main_#t~nondet8#1 <= 127;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {73273#true} is VALID [2022-02-20 18:29:36,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {73273#true} assume 0 == ~r1~0; {73273#true} is VALID [2022-02-20 18:29:36,233 INFO L290 TraceCheckUtils]: 3: Hoare triple {73273#true} assume ~id1~0 >= 0; {73273#true} is VALID [2022-02-20 18:29:36,233 INFO L290 TraceCheckUtils]: 4: Hoare triple {73273#true} assume 0 == ~st1~0; {73275#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:36,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {73275#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {73275#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:36,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {73275#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {73275#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:36,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {73275#(<= ~st1~0 0)} assume ~id2~0 >= 0; {73275#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:36,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {73275#(<= ~st1~0 0)} assume 0 == ~st2~0; {73276#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {73276#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {73276#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {73276#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {73276#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {73276#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {73276#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {73276#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {73276#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {73276#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {73276#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {73276#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {73276#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {73276#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {73276#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {73276#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~i2~0#1); {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {73277#(<= (+ ~st4~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 8);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; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {73277#(<= (+ ~st4~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; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {73277#(<= (+ ~st4~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; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,243 INFO L290 TraceCheckUtils]: 36: Hoare triple {73277#(<= (+ ~st4~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; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {73277#(<= (+ ~st4~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; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,245 INFO L290 TraceCheckUtils]: 40: Hoare triple {73277#(<= (+ ~st4~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; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,245 INFO L290 TraceCheckUtils]: 41: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,246 INFO L290 TraceCheckUtils]: 43: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,246 INFO L290 TraceCheckUtils]: 44: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,246 INFO L290 TraceCheckUtils]: 45: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,247 INFO L290 TraceCheckUtils]: 46: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,247 INFO L290 TraceCheckUtils]: 47: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 4); {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,247 INFO L290 TraceCheckUtils]: 48: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,248 INFO L290 TraceCheckUtils]: 49: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,248 INFO L290 TraceCheckUtils]: 50: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,249 INFO L290 TraceCheckUtils]: 51: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,249 INFO L290 TraceCheckUtils]: 52: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,250 INFO L290 TraceCheckUtils]: 53: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assert } true;main_#t~post27#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,250 INFO L290 TraceCheckUtils]: 54: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 8);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; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,250 INFO L290 TraceCheckUtils]: 55: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,251 INFO L290 TraceCheckUtils]: 56: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(node1_~m1~0#1 != ~nomsg~0); {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,251 INFO L290 TraceCheckUtils]: 57: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,251 INFO L290 TraceCheckUtils]: 58: Hoare triple {73277#(<= (+ ~st4~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; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,252 INFO L290 TraceCheckUtils]: 59: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,252 INFO L290 TraceCheckUtils]: 60: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(node2_~m2~0#1 != ~nomsg~0); {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,252 INFO L290 TraceCheckUtils]: 61: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,253 INFO L290 TraceCheckUtils]: 62: Hoare triple {73277#(<= (+ ~st4~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; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,253 INFO L290 TraceCheckUtils]: 63: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,253 INFO L290 TraceCheckUtils]: 64: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 != ~nomsg~0; {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,254 INFO L290 TraceCheckUtils]: 65: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(node3_~m3~0#1 > ~id3~0); {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:36,254 INFO L290 TraceCheckUtils]: 66: Hoare triple {73277#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {73278#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:36,254 INFO L290 TraceCheckUtils]: 67: Hoare triple {73278#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {73278#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:36,255 INFO L290 TraceCheckUtils]: 68: Hoare triple {73278#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {73278#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:36,255 INFO L290 TraceCheckUtils]: 69: Hoare triple {73278#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {73278#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:36,255 INFO L290 TraceCheckUtils]: 70: Hoare triple {73278#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume !(node4_~m4~0#1 != ~nomsg~0); {73278#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:36,256 INFO L290 TraceCheckUtils]: 71: Hoare triple {73278#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} ~mode4~0 := 0; {73278#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:36,256 INFO L290 TraceCheckUtils]: 72: Hoare triple {73278#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {73278#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:36,257 INFO L290 TraceCheckUtils]: 73: Hoare triple {73278#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {73274#false} is VALID [2022-02-20 18:29:36,257 INFO L290 TraceCheckUtils]: 74: Hoare triple {73274#false} check_#res#1 := check_~tmp~1#1; {73274#false} is VALID [2022-02-20 18:29:36,257 INFO L290 TraceCheckUtils]: 75: Hoare triple {73274#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {73274#false} is VALID [2022-02-20 18:29:36,257 INFO L290 TraceCheckUtils]: 76: Hoare triple {73274#false} assume 0 == assert_~arg#1 % 256; {73274#false} is VALID [2022-02-20 18:29:36,257 INFO L290 TraceCheckUtils]: 77: Hoare triple {73274#false} assume !false; {73274#false} is VALID [2022-02-20 18:29:36,257 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 18:29:36,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:36,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745287810] [2022-02-20 18:29:36,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745287810] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:36,258 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:36,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:29:36,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795707514] [2022-02-20 18:29:36,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:36,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 78 [2022-02-20 18:29:36,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:36,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call 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:36,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:36,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:29:36,303 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:36,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:29:36,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:29:36,303 INFO L87 Difference]: Start difference. First operand 3025 states and 4280 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call 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:45,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:45,123 INFO L93 Difference]: Finished difference Result 9331 states and 13249 transitions. [2022-02-20 18:29:45,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:29:45,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 78 [2022-02-20 18:29:45,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call 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:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 440 transitions. [2022-02-20 18:29:45,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call 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:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 440 transitions. [2022-02-20 18:29:45,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 440 transitions. [2022-02-20 18:29:45,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:47,713 INFO L225 Difference]: With dead ends: 9331 [2022-02-20 18:29:47,713 INFO L226 Difference]: Without dead ends: 7833 [2022-02-20 18:29:47,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:29:47,716 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 401 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:47,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [401 Valid, 515 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:29:47,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7833 states. [2022-02-20 18:29:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7833 to 5273. [2022-02-20 18:29:52,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:52,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7833 states. Second operand has 5273 states, 5272 states have (on average 1.4089529590288317) internal successors, (7428), 5272 states have internal predecessors, (7428), 0 states have call successors, (0), 0 states have call 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:52,181 INFO L74 IsIncluded]: Start isIncluded. First operand 7833 states. Second operand has 5273 states, 5272 states have (on average 1.4089529590288317) internal successors, (7428), 5272 states have internal predecessors, (7428), 0 states have call successors, (0), 0 states have call 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:52,184 INFO L87 Difference]: Start difference. First operand 7833 states. Second operand has 5273 states, 5272 states have (on average 1.4089529590288317) internal successors, (7428), 5272 states have internal predecessors, (7428), 0 states have call successors, (0), 0 states have call 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:54,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:54,257 INFO L93 Difference]: Finished difference Result 7833 states and 11088 transitions. [2022-02-20 18:29:54,257 INFO L276 IsEmpty]: Start isEmpty. Operand 7833 states and 11088 transitions. [2022-02-20 18:29:54,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:54,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:54,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 5273 states, 5272 states have (on average 1.4089529590288317) internal successors, (7428), 5272 states have internal predecessors, (7428), 0 states have call successors, (0), 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 7833 states. [2022-02-20 18:29:54,271 INFO L87 Difference]: Start difference. First operand has 5273 states, 5272 states have (on average 1.4089529590288317) internal successors, (7428), 5272 states have internal predecessors, (7428), 0 states have call successors, (0), 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 7833 states. [2022-02-20 18:29:56,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:56,354 INFO L93 Difference]: Finished difference Result 7833 states and 11088 transitions. [2022-02-20 18:29:56,355 INFO L276 IsEmpty]: Start isEmpty. Operand 7833 states and 11088 transitions. [2022-02-20 18:29:56,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:56,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:56,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:56,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:56,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5273 states, 5272 states have (on average 1.4089529590288317) internal successors, (7428), 5272 states have internal predecessors, (7428), 0 states have call successors, (0), 0 states have call 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:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5273 states to 5273 states and 7428 transitions. [2022-02-20 18:29:57,492 INFO L78 Accepts]: Start accepts. Automaton has 5273 states and 7428 transitions. Word has length 78 [2022-02-20 18:29:57,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:57,493 INFO L470 AbstractCegarLoop]: Abstraction has 5273 states and 7428 transitions. [2022-02-20 18:29:57,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call 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:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand 5273 states and 7428 transitions. [2022-02-20 18:29:57,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:29:57,494 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:57,494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:57,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:29:57,495 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:57,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:57,495 INFO L85 PathProgramCache]: Analyzing trace with hash 836080987, now seen corresponding path program 1 times [2022-02-20 18:29:57,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:57,495 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403137330] [2022-02-20 18:29:57,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:57,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:57,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {107066#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; {107066#true} is VALID [2022-02-20 18:29:57,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {107066#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#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~nondet8#1 && main_#t~nondet8#1 <= 127;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {107066#true} is VALID [2022-02-20 18:29:57,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {107066#true} assume 0 == ~r1~0; {107066#true} is VALID [2022-02-20 18:29:57,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {107066#true} assume ~id1~0 >= 0; {107066#true} is VALID [2022-02-20 18:29:57,552 INFO L290 TraceCheckUtils]: 4: Hoare triple {107066#true} assume 0 == ~st1~0; {107068#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:57,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {107068#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {107068#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:57,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {107068#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {107068#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:57,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {107068#(<= ~st1~0 0)} assume ~id2~0 >= 0; {107068#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:57,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {107068#(<= ~st1~0 0)} assume 0 == ~st2~0; {107068#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:57,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {107068#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {107068#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:57,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {107068#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {107068#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:57,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {107068#(<= ~st1~0 0)} assume ~id3~0 >= 0; {107068#(<= ~st1~0 0)} is VALID [2022-02-20 18:29:57,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {107068#(<= ~st1~0 0)} assume 0 == ~st3~0; {107069#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {107069#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {107069#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {107069#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {107069#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {107069#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id4~0 >= 0; {107069#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {107069#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st4~0; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,559 INFO L290 TraceCheckUtils]: 26: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret25#1 && main_#t~ret25#1 <= 2147483647;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == main_~i2~0#1); {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {107070#(<= (+ ~st4~0 ~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,560 INFO L290 TraceCheckUtils]: 29: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 8);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; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,561 INFO L290 TraceCheckUtils]: 32: Hoare triple {107070#(<= (+ ~st4~0 ~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; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,561 INFO L290 TraceCheckUtils]: 33: Hoare triple {107070#(<= (+ ~st4~0 ~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; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,562 INFO L290 TraceCheckUtils]: 34: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,562 INFO L290 TraceCheckUtils]: 36: Hoare triple {107070#(<= (+ ~st4~0 ~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; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {107070#(<= (+ ~st4~0 ~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; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,563 INFO L290 TraceCheckUtils]: 39: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,564 INFO L290 TraceCheckUtils]: 40: Hoare triple {107070#(<= (+ ~st4~0 ~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; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,564 INFO L290 TraceCheckUtils]: 41: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,564 INFO L290 TraceCheckUtils]: 42: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,565 INFO L290 TraceCheckUtils]: 43: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,565 INFO L290 TraceCheckUtils]: 44: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,566 INFO L290 TraceCheckUtils]: 45: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,566 INFO L290 TraceCheckUtils]: 46: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,566 INFO L290 TraceCheckUtils]: 47: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~r1~0 >= 4); {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,566 INFO L290 TraceCheckUtils]: 48: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,567 INFO L290 TraceCheckUtils]: 49: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,567 INFO L290 TraceCheckUtils]: 50: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,567 INFO L290 TraceCheckUtils]: 51: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,568 INFO L290 TraceCheckUtils]: 52: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,568 INFO L290 TraceCheckUtils]: 53: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume { :end_inline_assert } true;main_#t~post27#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,568 INFO L290 TraceCheckUtils]: 54: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 8);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; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,569 INFO L290 TraceCheckUtils]: 55: Hoare triple {107070#(<= (+ ~st4~0 ~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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,569 INFO L290 TraceCheckUtils]: 56: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(node1_~m1~0#1 != ~nomsg~0); {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,570 INFO L290 TraceCheckUtils]: 57: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~mode1~0 := 0; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,570 INFO L290 TraceCheckUtils]: 58: Hoare triple {107070#(<= (+ ~st4~0 ~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; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,570 INFO L290 TraceCheckUtils]: 59: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,571 INFO L290 TraceCheckUtils]: 60: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 != ~nomsg~0; {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,571 INFO L290 TraceCheckUtils]: 61: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(node2_~m2~0#1 > ~id2~0); {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:29:57,571 INFO L290 TraceCheckUtils]: 62: Hoare triple {107070#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:57,572 INFO L290 TraceCheckUtils]: 63: Hoare triple {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} ~mode2~0 := 0; {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:57,572 INFO L290 TraceCheckUtils]: 64: Hoare triple {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~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; {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:57,572 INFO L290 TraceCheckUtils]: 65: Hoare triple {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:57,573 INFO L290 TraceCheckUtils]: 66: Hoare triple {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(node3_~m3~0#1 != ~nomsg~0); {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:57,573 INFO L290 TraceCheckUtils]: 67: Hoare triple {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} ~mode3~0 := 0; {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:57,573 INFO L290 TraceCheckUtils]: 68: Hoare triple {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:57,574 INFO L290 TraceCheckUtils]: 69: Hoare triple {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:57,574 INFO L290 TraceCheckUtils]: 70: Hoare triple {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(node4_~m4~0#1 != ~nomsg~0); {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:57,575 INFO L290 TraceCheckUtils]: 71: Hoare triple {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} ~mode4~0 := 0; {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:57,575 INFO L290 TraceCheckUtils]: 72: Hoare triple {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:29:57,575 INFO L290 TraceCheckUtils]: 73: Hoare triple {107071#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {107067#false} is VALID [2022-02-20 18:29:57,575 INFO L290 TraceCheckUtils]: 74: Hoare triple {107067#false} check_#res#1 := check_~tmp~1#1; {107067#false} is VALID [2022-02-20 18:29:57,576 INFO L290 TraceCheckUtils]: 75: Hoare triple {107067#false} main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret26#1 && main_#t~ret26#1 <= 2147483647;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; {107067#false} is VALID [2022-02-20 18:29:57,576 INFO L290 TraceCheckUtils]: 76: Hoare triple {107067#false} assume 0 == assert_~arg#1 % 256; {107067#false} is VALID [2022-02-20 18:29:57,576 INFO L290 TraceCheckUtils]: 77: Hoare triple {107067#false} assume !false; {107067#false} is VALID [2022-02-20 18:29:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 18:29:57,576 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:57,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403137330] [2022-02-20 18:29:57,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403137330] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:57,577 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:57,577 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:29:57,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565431711] [2022-02-20 18:29:57,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:57,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 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 78 [2022-02-20 18:29:57,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:57,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:57,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:57,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:29:57,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:57,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:29:57,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:29:57,628 INFO L87 Difference]: Start difference. First operand 5273 states and 7428 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:07,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:07,849 INFO L93 Difference]: Finished difference Result 10827 states and 15361 transitions. [2022-02-20 18:30:07,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:30:07,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 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 78 [2022-02-20 18:30:07,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:07,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:07,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 440 transitions. [2022-02-20 18:30:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 440 transitions. [2022-02-20 18:30:07,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 440 transitions. [2022-02-20 18:30:08,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:11,045 INFO L225 Difference]: With dead ends: 10827 [2022-02-20 18:30:11,046 INFO L226 Difference]: Without dead ends: 9329 [2022-02-20 18:30:11,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:30:11,048 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 434 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:11,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 532 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:11,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9329 states. [2022-02-20 18:30:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9329 to 6769. [2022-02-20 18:30:17,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:17,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9329 states. Second operand has 6769 states, 6768 states have (on average 1.4095744680851063) internal successors, (9540), 6768 states have internal predecessors, (9540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:17,260 INFO L74 IsIncluded]: Start isIncluded. First operand 9329 states. Second operand has 6769 states, 6768 states have (on average 1.4095744680851063) internal successors, (9540), 6768 states have internal predecessors, (9540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:17,264 INFO L87 Difference]: Start difference. First operand 9329 states. Second operand has 6769 states, 6768 states have (on average 1.4095744680851063) internal successors, (9540), 6768 states have internal predecessors, (9540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)