./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.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/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.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 355322de5dcfb8cbd44ad690b6b14768d5a2fa38ff5dfd1ede94c260e278eb8b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:41:31,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:41:31,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:41:31,743 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:41:31,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:41:31,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:41:31,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:41:31,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:41:31,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:41:31,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:41:31,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:41:31,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:41:31,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:41:31,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:41:31,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:41:31,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:41:31,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:41:31,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:41:31,785 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:41:31,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:41:31,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:41:31,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:41:31,791 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:41:31,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:41:31,792 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:41:31,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:41:31,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:41:31,793 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:41:31,794 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:41:31,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:41:31,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:41:31,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:41:31,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:41:31,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:41:31,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:41:31,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:41:31,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:41:31,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:41:31,797 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:41:31,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:41:31,798 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:41:31,799 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:41:31,812 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:41:31,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:41:31,814 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:41:31,814 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:41:31,814 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:41:31,815 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:41:31,815 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:41:31,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:41:31,816 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:41:31,816 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:41:31,816 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:41:31,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:41:31,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:41:31,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:41:31,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:41:31,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:41:31,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:41:31,818 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:41:31,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:41:31,818 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:41:31,818 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:41:31,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:41:31,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:41:31,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:41:31,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:41:31,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:41:31,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:41:31,820 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:41:31,820 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:41:31,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:41:31,820 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:41:31,820 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:41:31,820 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:41:31,821 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 -> 355322de5dcfb8cbd44ad690b6b14768d5a2fa38ff5dfd1ede94c260e278eb8b [2022-02-20 19:41:31,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:41:31,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:41:31,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:41:31,987 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:41:31,988 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:41:31,989 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c [2022-02-20 19:41:32,025 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f62c5303/8fbb26c3fccc4f9497297e532d09a0c7/FLAG592a55ca3 [2022-02-20 19:41:32,516 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:41:32,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c [2022-02-20 19:41:32,543 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f62c5303/8fbb26c3fccc4f9497297e532d09a0c7/FLAG592a55ca3 [2022-02-20 19:41:32,558 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f62c5303/8fbb26c3fccc4f9497297e532d09a0c7 [2022-02-20 19:41:32,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:41:32,562 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:41:32,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:41:32,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:41:32,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:41:32,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:41:32" (1/1) ... [2022-02-20 19:41:32,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16da41c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:32, skipping insertion in model container [2022-02-20 19:41:32,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:41:32" (1/1) ... [2022-02-20 19:41:32,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:41:32,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:41:32,928 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/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c[8616,8629] [2022-02-20 19:41:32,946 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/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c[10953,10966] [2022-02-20 19:41:33,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:41:33,484 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:41:33,522 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/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c[8616,8629] [2022-02-20 19:41:33,527 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/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c[10953,10966] [2022-02-20 19:41:33,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:41:33,926 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:41:33,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:33 WrapperNode [2022-02-20 19:41:33,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:41:33,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:41:33,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:41:33,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:41:33,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:33" (1/1) ... [2022-02-20 19:41:33,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:33" (1/1) ... [2022-02-20 19:41:34,296 INFO L137 Inliner]: procedures = 34, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 5031 [2022-02-20 19:41:34,296 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:41:34,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:41:34,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:41:34,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:41:34,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:33" (1/1) ... [2022-02-20 19:41:34,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:33" (1/1) ... [2022-02-20 19:41:34,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:33" (1/1) ... [2022-02-20 19:41:34,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:33" (1/1) ... [2022-02-20 19:41:34,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:33" (1/1) ... [2022-02-20 19:41:34,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:33" (1/1) ... [2022-02-20 19:41:34,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:33" (1/1) ... [2022-02-20 19:41:34,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:41:34,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:41:34,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:41:34,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:41:34,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:33" (1/1) ... [2022-02-20 19:41:34,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:41:34,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:41:34,564 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 19:41:34,584 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 19:41:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:41:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:41:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:41:34,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:41:34,693 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:41:34,693 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:41:41,409 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:41:41,421 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:41:41,421 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:41:41,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:41:41 BoogieIcfgContainer [2022-02-20 19:41:41,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:41:41,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:41:41,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:41:41,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:41:41,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:41:32" (1/3) ... [2022-02-20 19:41:41,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d78ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:41:41, skipping insertion in model container [2022-02-20 19:41:41,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:33" (2/3) ... [2022-02-20 19:41:41,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d78ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:41:41, skipping insertion in model container [2022-02-20 19:41:41,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:41:41" (3/3) ... [2022-02-20 19:41:41,430 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c [2022-02-20 19:41:41,434 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:41:41,435 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:41:41,484 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:41:41,498 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 19:41:41,499 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:41:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 893 states, 890 states have (on average 1.902247191011236) internal successors, (1693), 892 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:41,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 19:41:41,543 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:41:41,543 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] [2022-02-20 19:41:41,544 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:41:41,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:41:41,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1736774821, now seen corresponding path program 1 times [2022-02-20 19:41:41,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:41:41,557 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129843195] [2022-02-20 19:41:41,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:41:41,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:41:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:41:41,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {896#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {898#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:41:41,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {898#(<= (+ ~a17~0 124) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {898#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:41:41,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {898#(<= (+ ~a17~0 124) 0)} assume !(0 != main_#t~nondet43#1);havoc main_#t~nondet43#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet41#1, main2_#t~ret42#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {898#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:41:41,792 INFO L290 TraceCheckUtils]: 3: Hoare triple {898#(<= (+ ~a17~0 124) 0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet41#1 && main2_#t~nondet41#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet41#1;havoc main2_#t~nondet41#1; {898#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:41:41,792 INFO L290 TraceCheckUtils]: 4: Hoare triple {898#(<= (+ ~a17~0 124) 0)} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret38#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {898#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:41:41,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {898#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {898#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:41:41,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {898#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {898#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:41:41,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {898#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {898#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:41:41,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {898#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {898#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:41:41,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {898#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {898#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:41:41,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {898#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {898#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:41:41,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {898#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {898#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:41:41,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {898#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {898#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:41:41,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {898#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {898#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:41:41,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {898#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {898#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:41:41,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {898#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {898#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:41:41,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {898#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {898#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:41:41,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {898#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {898#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:41:41,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {898#(<= (+ ~a17~0 124) 0)} assume (((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {897#false} is VALID [2022-02-20 19:41:41,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {897#false} assume !false; {897#false} is VALID [2022-02-20 19:41:41,804 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 19:41:41,804 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:41:41,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129843195] [2022-02-20 19:41:41,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129843195] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:41:41,805 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:41:41,805 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:41:41,806 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569589050] [2022-02-20 19:41:41,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:41:41,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 19:41:41,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:41:41,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:41,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:41,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:41:41,835 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:41:41,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:41:41,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:41:41,855 INFO L87 Difference]: Start difference. First operand has 893 states, 890 states have (on average 1.902247191011236) internal successors, (1693), 892 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:47,611 INFO L93 Difference]: Finished difference Result 2528 states and 4850 transitions. [2022-02-20 19:41:47,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:41:47,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 19:41:47,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:41:47,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4850 transitions. [2022-02-20 19:41:47,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4850 transitions. [2022-02-20 19:41:47,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4850 transitions. [2022-02-20 19:41:51,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4850 edges. 4850 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:51,460 INFO L225 Difference]: With dead ends: 2528 [2022-02-20 19:41:51,460 INFO L226 Difference]: Without dead ends: 1578 [2022-02-20 19:41:51,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 19:41:51,472 INFO L933 BasicCegarLoop]: 640 mSDtfsCounter, 925 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:41:51,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [925 Valid, 651 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-02-20 19:41:51,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2022-02-20 19:41:51,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2022-02-20 19:41:51,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:41:51,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1578 states. Second operand has 1578 states, 1576 states have (on average 1.611040609137056) internal successors, (2539), 1577 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:51,574 INFO L74 IsIncluded]: Start isIncluded. First operand 1578 states. Second operand has 1578 states, 1576 states have (on average 1.611040609137056) internal successors, (2539), 1577 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:51,576 INFO L87 Difference]: Start difference. First operand 1578 states. Second operand has 1578 states, 1576 states have (on average 1.611040609137056) internal successors, (2539), 1577 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:51,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:51,650 INFO L93 Difference]: Finished difference Result 1578 states and 2539 transitions. [2022-02-20 19:41:51,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2539 transitions. [2022-02-20 19:41:51,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:51,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:51,663 INFO L74 IsIncluded]: Start isIncluded. First operand has 1578 states, 1576 states have (on average 1.611040609137056) internal successors, (2539), 1577 states have internal predecessors, (2539), 0 states have call successors, (0), 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 1578 states. [2022-02-20 19:41:51,665 INFO L87 Difference]: Start difference. First operand has 1578 states, 1576 states have (on average 1.611040609137056) internal successors, (2539), 1577 states have internal predecessors, (2539), 0 states have call successors, (0), 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 1578 states. [2022-02-20 19:41:51,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:51,740 INFO L93 Difference]: Finished difference Result 1578 states and 2539 transitions. [2022-02-20 19:41:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2539 transitions. [2022-02-20 19:41:51,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:51,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:51,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:41:51,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:41:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1576 states have (on average 1.611040609137056) internal successors, (2539), 1577 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:51,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2539 transitions. [2022-02-20 19:41:51,819 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2539 transitions. Word has length 20 [2022-02-20 19:41:51,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:41:51,820 INFO L470 AbstractCegarLoop]: Abstraction has 1578 states and 2539 transitions. [2022-02-20 19:41:51,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:51,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2539 transitions. [2022-02-20 19:41:51,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:41:51,823 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:41:51,824 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] [2022-02-20 19:41:51,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:41:51,824 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:41:51,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:41:51,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1541863076, now seen corresponding path program 1 times [2022-02-20 19:41:51,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:41:51,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448602679] [2022-02-20 19:41:51,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:41:51,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:41:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:41:51,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {8216#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {8216#true} is VALID [2022-02-20 19:41:51,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {8216#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {8216#true} is VALID [2022-02-20 19:41:51,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {8216#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8216#true} is VALID [2022-02-20 19:41:51,929 INFO L290 TraceCheckUtils]: 3: Hoare triple {8216#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {8218#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:41:51,929 INFO L290 TraceCheckUtils]: 4: Hoare triple {8218#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8219#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:41:51,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {8219#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {8220#(= |ULTIMATE.start_main1_~i2~0#1| 0)} is VALID [2022-02-20 19:41:51,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {8220#(= |ULTIMATE.start_main1_~i2~0#1| 0)} assume !(0 == main1_~i2~0#1); {8217#false} is VALID [2022-02-20 19:41:51,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {8217#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;main1_~i2~0#1 := 0; {8217#false} is VALID [2022-02-20 19:41:51,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {8217#false} assume !!(main1_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {8217#false} is VALID [2022-02-20 19:41:51,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {8217#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; {8217#false} is VALID [2022-02-20 19:41:51,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {8217#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8217#false} is VALID [2022-02-20 19:41:51,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {8217#false} ~mode1~0 := 0; {8217#false} is VALID [2022-02-20 19:41:51,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {8217#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {8217#false} is VALID [2022-02-20 19:41:51,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {8217#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8217#false} is VALID [2022-02-20 19:41:51,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {8217#false} assume !(node2_~m2~0#1 != ~nomsg~0); {8217#false} is VALID [2022-02-20 19:41:51,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {8217#false} ~mode2~0 := 0; {8217#false} is VALID [2022-02-20 19:41:51,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {8217#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {8217#false} is VALID [2022-02-20 19:41:51,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {8217#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8217#false} is VALID [2022-02-20 19:41:51,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {8217#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8217#false} is VALID [2022-02-20 19:41:51,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {8217#false} ~mode3~0 := 0; {8217#false} is VALID [2022-02-20 19:41:51,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {8217#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {8217#false} is VALID [2022-02-20 19:41:51,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {8217#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8217#false} is VALID [2022-02-20 19:41:51,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {8217#false} assume !(node4_~m4~0#1 != ~nomsg~0); {8217#false} is VALID [2022-02-20 19:41:51,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {8217#false} ~mode4~0 := 0; {8217#false} is VALID [2022-02-20 19:41:51,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {8217#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; {8217#false} is VALID [2022-02-20 19:41:51,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {8217#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {8217#false} is VALID [2022-02-20 19:41:51,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {8217#false} check_#res#1 := check_~tmp~1#1; {8217#false} is VALID [2022-02-20 19:41:51,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {8217#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {8217#false} is VALID [2022-02-20 19:41:51,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {8217#false} assume 0 == assert_~arg#1 % 256; {8217#false} is VALID [2022-02-20 19:41:51,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {8217#false} assume !false; {8217#false} is VALID [2022-02-20 19:41:51,938 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 19:41:51,939 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:41:51,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448602679] [2022-02-20 19:41:51,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448602679] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:41:51,939 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:41:51,939 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:41:51,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947636327] [2022-02-20 19:41:51,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:41:51,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:41:51,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:41:51,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:51,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:51,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:41:51,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:41:51,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:41:51,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:41:51,967 INFO L87 Difference]: Start difference. First operand 1578 states and 2539 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:55,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:55,875 INFO L93 Difference]: Finished difference Result 1670 states and 2681 transitions. [2022-02-20 19:41:55,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:41:55,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:41:55,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:41:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1702 transitions. [2022-02-20 19:41:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1702 transitions. [2022-02-20 19:41:55,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1702 transitions. [2022-02-20 19:41:57,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1702 edges. 1702 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:57,151 INFO L225 Difference]: With dead ends: 1670 [2022-02-20 19:41:57,151 INFO L226 Difference]: Without dead ends: 1622 [2022-02-20 19:41:57,153 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 19:41:57,154 INFO L933 BasicCegarLoop]: 1556 mSDtfsCounter, 71 mSDsluCounter, 4640 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 6196 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 19:41:57,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 6196 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:41:57,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2022-02-20 19:41:57,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1578. [2022-02-20 19:41:57,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:41:57,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1622 states. Second operand has 1578 states, 1576 states have (on average 1.5964467005076142) internal successors, (2516), 1577 states have internal predecessors, (2516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:57,193 INFO L74 IsIncluded]: Start isIncluded. First operand 1622 states. Second operand has 1578 states, 1576 states have (on average 1.5964467005076142) internal successors, (2516), 1577 states have internal predecessors, (2516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:57,195 INFO L87 Difference]: Start difference. First operand 1622 states. Second operand has 1578 states, 1576 states have (on average 1.5964467005076142) internal successors, (2516), 1577 states have internal predecessors, (2516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:57,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:57,270 INFO L93 Difference]: Finished difference Result 1622 states and 2585 transitions. [2022-02-20 19:41:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2585 transitions. [2022-02-20 19:41:57,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:57,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:57,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 1578 states, 1576 states have (on average 1.5964467005076142) internal successors, (2516), 1577 states have internal predecessors, (2516), 0 states have call successors, (0), 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 1622 states. [2022-02-20 19:41:57,277 INFO L87 Difference]: Start difference. First operand has 1578 states, 1576 states have (on average 1.5964467005076142) internal successors, (2516), 1577 states have internal predecessors, (2516), 0 states have call successors, (0), 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 1622 states. [2022-02-20 19:41:57,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:57,351 INFO L93 Difference]: Finished difference Result 1622 states and 2585 transitions. [2022-02-20 19:41:57,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2585 transitions. [2022-02-20 19:41:57,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:57,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:57,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:41:57,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:41:57,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1576 states have (on average 1.5964467005076142) internal successors, (2516), 1577 states have internal predecessors, (2516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2516 transitions. [2022-02-20 19:41:57,430 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2516 transitions. Word has length 30 [2022-02-20 19:41:57,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:41:57,430 INFO L470 AbstractCegarLoop]: Abstraction has 1578 states and 2516 transitions. [2022-02-20 19:41:57,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2516 transitions. [2022-02-20 19:41:57,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:41:57,433 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:41:57,433 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:41:57,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:41:57,433 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:41:57,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:41:57,434 INFO L85 PathProgramCache]: Analyzing trace with hash 159296799, now seen corresponding path program 1 times [2022-02-20 19:41:57,434 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:41:57,434 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146659739] [2022-02-20 19:41:57,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:41:57,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:41:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:41:57,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {14770#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {14770#true} is VALID [2022-02-20 19:41:57,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {14770#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {14770#true} is VALID [2022-02-20 19:41:57,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {14770#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {14770#true} is VALID [2022-02-20 19:41:57,532 INFO L290 TraceCheckUtils]: 3: Hoare triple {14770#true} assume 0 == ~r1~0; {14770#true} is VALID [2022-02-20 19:41:57,532 INFO L290 TraceCheckUtils]: 4: Hoare triple {14770#true} assume ~id1~0 >= 0; {14770#true} is VALID [2022-02-20 19:41:57,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {14770#true} assume 0 == ~st1~0; {14770#true} is VALID [2022-02-20 19:41:57,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {14770#true} assume ~send1~0 == ~id1~0; {14770#true} is VALID [2022-02-20 19:41:57,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {14770#true} assume 0 == ~mode1~0 % 256; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,545 INFO L290 TraceCheckUtils]: 27: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main1_~i2~0#1); {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {14772#(= (+ (* (- 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;main1_~i2~0#1 := 0; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {14772#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:41:57,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {14772#(= (+ (* (- 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; {14771#false} is VALID [2022-02-20 19:41:57,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {14771#false} assume !(node1_~m1~0#1 != ~nomsg~0); {14771#false} is VALID [2022-02-20 19:41:57,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {14771#false} ~mode1~0 := 0; {14771#false} is VALID [2022-02-20 19:41:57,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {14771#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {14771#false} is VALID [2022-02-20 19:41:57,548 INFO L290 TraceCheckUtils]: 35: Hoare triple {14771#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {14771#false} is VALID [2022-02-20 19:41:57,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {14771#false} assume !(node2_~m2~0#1 != ~nomsg~0); {14771#false} is VALID [2022-02-20 19:41:57,548 INFO L290 TraceCheckUtils]: 37: Hoare triple {14771#false} ~mode2~0 := 0; {14771#false} is VALID [2022-02-20 19:41:57,548 INFO L290 TraceCheckUtils]: 38: Hoare triple {14771#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {14771#false} is VALID [2022-02-20 19:41:57,548 INFO L290 TraceCheckUtils]: 39: Hoare triple {14771#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {14771#false} is VALID [2022-02-20 19:41:57,548 INFO L290 TraceCheckUtils]: 40: Hoare triple {14771#false} assume !(node3_~m3~0#1 != ~nomsg~0); {14771#false} is VALID [2022-02-20 19:41:57,549 INFO L290 TraceCheckUtils]: 41: Hoare triple {14771#false} ~mode3~0 := 0; {14771#false} is VALID [2022-02-20 19:41:57,549 INFO L290 TraceCheckUtils]: 42: Hoare triple {14771#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {14771#false} is VALID [2022-02-20 19:41:57,549 INFO L290 TraceCheckUtils]: 43: Hoare triple {14771#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {14771#false} is VALID [2022-02-20 19:41:57,549 INFO L290 TraceCheckUtils]: 44: Hoare triple {14771#false} assume !(node4_~m4~0#1 != ~nomsg~0); {14771#false} is VALID [2022-02-20 19:41:57,549 INFO L290 TraceCheckUtils]: 45: Hoare triple {14771#false} ~mode4~0 := 0; {14771#false} is VALID [2022-02-20 19:41:57,549 INFO L290 TraceCheckUtils]: 46: Hoare triple {14771#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; {14771#false} is VALID [2022-02-20 19:41:57,550 INFO L290 TraceCheckUtils]: 47: Hoare triple {14771#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {14771#false} is VALID [2022-02-20 19:41:57,550 INFO L290 TraceCheckUtils]: 48: Hoare triple {14771#false} check_#res#1 := check_~tmp~1#1; {14771#false} is VALID [2022-02-20 19:41:57,550 INFO L290 TraceCheckUtils]: 49: Hoare triple {14771#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {14771#false} is VALID [2022-02-20 19:41:57,550 INFO L290 TraceCheckUtils]: 50: Hoare triple {14771#false} assume 0 == assert_~arg#1 % 256; {14771#false} is VALID [2022-02-20 19:41:57,550 INFO L290 TraceCheckUtils]: 51: Hoare triple {14771#false} assume !false; {14771#false} is VALID [2022-02-20 19:41:57,551 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 19:41:57,551 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:41:57,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146659739] [2022-02-20 19:41:57,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146659739] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:41:57,552 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:41:57,552 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:41:57,552 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012522956] [2022-02-20 19:41:57,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:41:57,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:41:57,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:41:57,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:57,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:57,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:41:57,594 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:41:57,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:41:57,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:41:57,595 INFO L87 Difference]: Start difference. First operand 1578 states and 2516 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:59,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:59,428 INFO L93 Difference]: Finished difference Result 1660 states and 2644 transitions. [2022-02-20 19:41:59,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:41:59,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:41:59,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:41:59,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:41:59,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:41:59,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1665 transitions. [2022-02-20 19:42:01,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:01,101 INFO L225 Difference]: With dead ends: 1660 [2022-02-20 19:42:01,102 INFO L226 Difference]: Without dead ends: 1616 [2022-02-20 19:42:01,104 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 19:42:01,109 INFO L933 BasicCegarLoop]: 1592 mSDtfsCounter, 1498 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1659 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 19:42:01,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1498 Valid, 1659 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:01,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2022-02-20 19:42:01,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1614. [2022-02-20 19:42:01,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:01,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1616 states. Second operand has 1614 states, 1612 states have (on average 1.5961538461538463) internal successors, (2573), 1613 states have internal predecessors, (2573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:01,195 INFO L74 IsIncluded]: Start isIncluded. First operand 1616 states. Second operand has 1614 states, 1612 states have (on average 1.5961538461538463) internal successors, (2573), 1613 states have internal predecessors, (2573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:01,203 INFO L87 Difference]: Start difference. First operand 1616 states. Second operand has 1614 states, 1612 states have (on average 1.5961538461538463) internal successors, (2573), 1613 states have internal predecessors, (2573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:01,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:01,278 INFO L93 Difference]: Finished difference Result 1616 states and 2574 transitions. [2022-02-20 19:42:01,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2574 transitions. [2022-02-20 19:42:01,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:01,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:01,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 1614 states, 1612 states have (on average 1.5961538461538463) internal successors, (2573), 1613 states have internal predecessors, (2573), 0 states have call successors, (0), 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 1616 states. [2022-02-20 19:42:01,286 INFO L87 Difference]: Start difference. First operand has 1614 states, 1612 states have (on average 1.5961538461538463) internal successors, (2573), 1613 states have internal predecessors, (2573), 0 states have call successors, (0), 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 1616 states. [2022-02-20 19:42:01,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:01,356 INFO L93 Difference]: Finished difference Result 1616 states and 2574 transitions. [2022-02-20 19:42:01,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2574 transitions. [2022-02-20 19:42:01,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:01,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:01,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:01,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1612 states have (on average 1.5961538461538463) internal successors, (2573), 1613 states have internal predecessors, (2573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:01,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2573 transitions. [2022-02-20 19:42:01,432 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2573 transitions. Word has length 52 [2022-02-20 19:42:01,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:01,434 INFO L470 AbstractCegarLoop]: Abstraction has 1614 states and 2573 transitions. [2022-02-20 19:42:01,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2573 transitions. [2022-02-20 19:42:01,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:42:01,436 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:01,436 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:42:01,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:42:01,436 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:01,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:01,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1780734059, now seen corresponding path program 1 times [2022-02-20 19:42:01,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:01,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520662317] [2022-02-20 19:42:01,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:01,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:01,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {21338#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {21338#true} is VALID [2022-02-20 19:42:01,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {21338#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {21338#true} is VALID [2022-02-20 19:42:01,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {21338#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {21338#true} is VALID [2022-02-20 19:42:01,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {21338#true} assume 0 == ~r1~0; {21338#true} is VALID [2022-02-20 19:42:01,514 INFO L290 TraceCheckUtils]: 4: Hoare triple {21338#true} assume ~id1~0 >= 0; {21338#true} is VALID [2022-02-20 19:42:01,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {21338#true} assume 0 == ~st1~0; {21338#true} is VALID [2022-02-20 19:42:01,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {21338#true} assume ~send1~0 == ~id1~0; {21338#true} is VALID [2022-02-20 19:42:01,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {21338#true} assume 0 == ~mode1~0 % 256; {21338#true} is VALID [2022-02-20 19:42:01,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {21338#true} assume ~id2~0 >= 0; {21338#true} is VALID [2022-02-20 19:42:01,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {21338#true} assume 0 == ~st2~0; {21338#true} is VALID [2022-02-20 19:42:01,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {21338#true} assume ~send2~0 == ~id2~0; {21338#true} is VALID [2022-02-20 19:42:01,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {21338#true} assume 0 == ~mode2~0 % 256; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,538 INFO L290 TraceCheckUtils]: 27: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == main1_~i2~0#1); {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {21340#(= (+ (* (- 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;main1_~i2~0#1 := 0; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,539 INFO L290 TraceCheckUtils]: 30: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main1_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,540 INFO L290 TraceCheckUtils]: 32: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {21340#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:01,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {21340#(= (+ (* (- 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; {21339#false} is VALID [2022-02-20 19:42:01,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {21339#false} assume !(node2_~m2~0#1 != ~nomsg~0); {21339#false} is VALID [2022-02-20 19:42:01,542 INFO L290 TraceCheckUtils]: 37: Hoare triple {21339#false} ~mode2~0 := 0; {21339#false} is VALID [2022-02-20 19:42:01,542 INFO L290 TraceCheckUtils]: 38: Hoare triple {21339#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {21339#false} is VALID [2022-02-20 19:42:01,542 INFO L290 TraceCheckUtils]: 39: Hoare triple {21339#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {21339#false} is VALID [2022-02-20 19:42:01,543 INFO L290 TraceCheckUtils]: 40: Hoare triple {21339#false} assume !(node3_~m3~0#1 != ~nomsg~0); {21339#false} is VALID [2022-02-20 19:42:01,543 INFO L290 TraceCheckUtils]: 41: Hoare triple {21339#false} ~mode3~0 := 0; {21339#false} is VALID [2022-02-20 19:42:01,543 INFO L290 TraceCheckUtils]: 42: Hoare triple {21339#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {21339#false} is VALID [2022-02-20 19:42:01,543 INFO L290 TraceCheckUtils]: 43: Hoare triple {21339#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {21339#false} is VALID [2022-02-20 19:42:01,548 INFO L290 TraceCheckUtils]: 44: Hoare triple {21339#false} assume !(node4_~m4~0#1 != ~nomsg~0); {21339#false} is VALID [2022-02-20 19:42:01,549 INFO L290 TraceCheckUtils]: 45: Hoare triple {21339#false} ~mode4~0 := 0; {21339#false} is VALID [2022-02-20 19:42:01,549 INFO L290 TraceCheckUtils]: 46: Hoare triple {21339#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; {21339#false} is VALID [2022-02-20 19:42:01,549 INFO L290 TraceCheckUtils]: 47: Hoare triple {21339#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {21339#false} is VALID [2022-02-20 19:42:01,549 INFO L290 TraceCheckUtils]: 48: Hoare triple {21339#false} check_#res#1 := check_~tmp~1#1; {21339#false} is VALID [2022-02-20 19:42:01,549 INFO L290 TraceCheckUtils]: 49: Hoare triple {21339#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {21339#false} is VALID [2022-02-20 19:42:01,550 INFO L290 TraceCheckUtils]: 50: Hoare triple {21339#false} assume 0 == assert_~arg#1 % 256; {21339#false} is VALID [2022-02-20 19:42:01,550 INFO L290 TraceCheckUtils]: 51: Hoare triple {21339#false} assume !false; {21339#false} is VALID [2022-02-20 19:42:01,550 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 19:42:01,550 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:01,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520662317] [2022-02-20 19:42:01,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520662317] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:01,551 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:01,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:42:01,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725308671] [2022-02-20 19:42:01,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:01,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:42:01,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:01,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:01,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:01,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:42:01,582 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:01,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:42:01,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:42:01,583 INFO L87 Difference]: Start difference. First operand 1614 states and 2573 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:03,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:03,277 INFO L93 Difference]: Finished difference Result 1762 states and 2805 transitions. [2022-02-20 19:42:03,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:42:03,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:42:03,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:42:03,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:03,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:42:03,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1665 transitions. [2022-02-20 19:42:04,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:04,640 INFO L225 Difference]: With dead ends: 1762 [2022-02-20 19:42:04,640 INFO L226 Difference]: Without dead ends: 1682 [2022-02-20 19:42:04,641 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 19:42:04,646 INFO L933 BasicCegarLoop]: 1587 mSDtfsCounter, 1494 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1658 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 19:42:04,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1494 Valid, 1658 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:04,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2022-02-20 19:42:04,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1680. [2022-02-20 19:42:04,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:04,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1682 states. Second operand has 1680 states, 1678 states have (on average 1.594755661501788) internal successors, (2676), 1679 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:04,721 INFO L74 IsIncluded]: Start isIncluded. First operand 1682 states. Second operand has 1680 states, 1678 states have (on average 1.594755661501788) internal successors, (2676), 1679 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:04,722 INFO L87 Difference]: Start difference. First operand 1682 states. Second operand has 1680 states, 1678 states have (on average 1.594755661501788) internal successors, (2676), 1679 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:04,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:04,852 INFO L93 Difference]: Finished difference Result 1682 states and 2677 transitions. [2022-02-20 19:42:04,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2677 transitions. [2022-02-20 19:42:04,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:04,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:04,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 1680 states, 1678 states have (on average 1.594755661501788) internal successors, (2676), 1679 states have internal predecessors, (2676), 0 states have call successors, (0), 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 1682 states. [2022-02-20 19:42:04,858 INFO L87 Difference]: Start difference. First operand has 1680 states, 1678 states have (on average 1.594755661501788) internal successors, (2676), 1679 states have internal predecessors, (2676), 0 states have call successors, (0), 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 1682 states. [2022-02-20 19:42:04,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:04,931 INFO L93 Difference]: Finished difference Result 1682 states and 2677 transitions. [2022-02-20 19:42:04,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2677 transitions. [2022-02-20 19:42:04,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:04,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:04,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:04,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:04,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1678 states have (on average 1.594755661501788) internal successors, (2676), 1679 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:05,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2676 transitions. [2022-02-20 19:42:05,012 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2676 transitions. Word has length 52 [2022-02-20 19:42:05,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:05,012 INFO L470 AbstractCegarLoop]: Abstraction has 1680 states and 2676 transitions. [2022-02-20 19:42:05,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:05,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2676 transitions. [2022-02-20 19:42:05,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:42:05,014 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:05,014 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:42:05,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:42:05,015 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:05,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:05,016 INFO L85 PathProgramCache]: Analyzing trace with hash 919948555, now seen corresponding path program 1 times [2022-02-20 19:42:05,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:05,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510176739] [2022-02-20 19:42:05,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:05,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:05,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {28241#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {28241#true} is VALID [2022-02-20 19:42:05,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {28241#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {28241#true} is VALID [2022-02-20 19:42:05,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {28241#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {28241#true} is VALID [2022-02-20 19:42:05,074 INFO L290 TraceCheckUtils]: 3: Hoare triple {28241#true} assume 0 == ~r1~0; {28241#true} is VALID [2022-02-20 19:42:05,074 INFO L290 TraceCheckUtils]: 4: Hoare triple {28241#true} assume ~id1~0 >= 0; {28241#true} is VALID [2022-02-20 19:42:05,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {28241#true} assume 0 == ~st1~0; {28241#true} is VALID [2022-02-20 19:42:05,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {28241#true} assume ~send1~0 == ~id1~0; {28241#true} is VALID [2022-02-20 19:42:05,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {28241#true} assume 0 == ~mode1~0 % 256; {28241#true} is VALID [2022-02-20 19:42:05,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {28241#true} assume ~id2~0 >= 0; {28241#true} is VALID [2022-02-20 19:42:05,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {28241#true} assume 0 == ~st2~0; {28241#true} is VALID [2022-02-20 19:42:05,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {28241#true} assume ~send2~0 == ~id2~0; {28241#true} is VALID [2022-02-20 19:42:05,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {28241#true} assume 0 == ~mode2~0 % 256; {28241#true} is VALID [2022-02-20 19:42:05,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {28241#true} assume ~id3~0 >= 0; {28241#true} is VALID [2022-02-20 19:42:05,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {28241#true} assume 0 == ~st3~0; {28241#true} is VALID [2022-02-20 19:42:05,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {28241#true} assume ~send3~0 == ~id3~0; {28241#true} is VALID [2022-02-20 19:42:05,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {28241#true} assume 0 == ~mode3~0 % 256; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == main1_~i2~0#1); {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {28243#(= (+ (* (- 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;main1_~i2~0#1 := 0; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main1_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,082 INFO L290 TraceCheckUtils]: 34: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,083 INFO L290 TraceCheckUtils]: 35: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,083 INFO L290 TraceCheckUtils]: 36: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,084 INFO L290 TraceCheckUtils]: 37: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,084 INFO L290 TraceCheckUtils]: 38: Hoare triple {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {28243#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:05,084 INFO L290 TraceCheckUtils]: 39: Hoare triple {28243#(= (+ (* (- 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; {28242#false} is VALID [2022-02-20 19:42:05,085 INFO L290 TraceCheckUtils]: 40: Hoare triple {28242#false} assume !(node3_~m3~0#1 != ~nomsg~0); {28242#false} is VALID [2022-02-20 19:42:05,085 INFO L290 TraceCheckUtils]: 41: Hoare triple {28242#false} ~mode3~0 := 0; {28242#false} is VALID [2022-02-20 19:42:05,085 INFO L290 TraceCheckUtils]: 42: Hoare triple {28242#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {28242#false} is VALID [2022-02-20 19:42:05,085 INFO L290 TraceCheckUtils]: 43: Hoare triple {28242#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {28242#false} is VALID [2022-02-20 19:42:05,085 INFO L290 TraceCheckUtils]: 44: Hoare triple {28242#false} assume !(node4_~m4~0#1 != ~nomsg~0); {28242#false} is VALID [2022-02-20 19:42:05,085 INFO L290 TraceCheckUtils]: 45: Hoare triple {28242#false} ~mode4~0 := 0; {28242#false} is VALID [2022-02-20 19:42:05,085 INFO L290 TraceCheckUtils]: 46: Hoare triple {28242#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; {28242#false} is VALID [2022-02-20 19:42:05,085 INFO L290 TraceCheckUtils]: 47: Hoare triple {28242#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {28242#false} is VALID [2022-02-20 19:42:05,086 INFO L290 TraceCheckUtils]: 48: Hoare triple {28242#false} check_#res#1 := check_~tmp~1#1; {28242#false} is VALID [2022-02-20 19:42:05,086 INFO L290 TraceCheckUtils]: 49: Hoare triple {28242#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {28242#false} is VALID [2022-02-20 19:42:05,086 INFO L290 TraceCheckUtils]: 50: Hoare triple {28242#false} assume 0 == assert_~arg#1 % 256; {28242#false} is VALID [2022-02-20 19:42:05,086 INFO L290 TraceCheckUtils]: 51: Hoare triple {28242#false} assume !false; {28242#false} is VALID [2022-02-20 19:42:05,086 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 19:42:05,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:05,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510176739] [2022-02-20 19:42:05,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510176739] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:05,087 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:05,087 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:42:05,087 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761789655] [2022-02-20 19:42:05,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:05,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:42:05,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:05,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:05,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:05,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:42:05,120 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:05,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:42:05,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:42:05,120 INFO L87 Difference]: Start difference. First operand 1680 states and 2676 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:06,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:06,816 INFO L93 Difference]: Finished difference Result 1948 states and 3094 transitions. [2022-02-20 19:42:06,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:42:06,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:42:06,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:42:06,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:06,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:42:06,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1665 transitions. [2022-02-20 19:42:07,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:08,081 INFO L225 Difference]: With dead ends: 1948 [2022-02-20 19:42:08,082 INFO L226 Difference]: Without dead ends: 1802 [2022-02-20 19:42:08,083 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 19:42:08,084 INFO L933 BasicCegarLoop]: 1582 mSDtfsCounter, 1490 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1657 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 19:42:08,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1490 Valid, 1657 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:08,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2022-02-20 19:42:08,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1800. [2022-02-20 19:42:08,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:08,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1802 states. Second operand has 1800 states, 1798 states have (on average 1.5906562847608454) internal successors, (2860), 1799 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:08,170 INFO L74 IsIncluded]: Start isIncluded. First operand 1802 states. Second operand has 1800 states, 1798 states have (on average 1.5906562847608454) internal successors, (2860), 1799 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:08,171 INFO L87 Difference]: Start difference. First operand 1802 states. Second operand has 1800 states, 1798 states have (on average 1.5906562847608454) internal successors, (2860), 1799 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:08,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:08,254 INFO L93 Difference]: Finished difference Result 1802 states and 2861 transitions. [2022-02-20 19:42:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2861 transitions. [2022-02-20 19:42:08,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:08,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:08,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 1800 states, 1798 states have (on average 1.5906562847608454) internal successors, (2860), 1799 states have internal predecessors, (2860), 0 states have call successors, (0), 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 1802 states. [2022-02-20 19:42:08,261 INFO L87 Difference]: Start difference. First operand has 1800 states, 1798 states have (on average 1.5906562847608454) internal successors, (2860), 1799 states have internal predecessors, (2860), 0 states have call successors, (0), 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 1802 states. [2022-02-20 19:42:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:08,344 INFO L93 Difference]: Finished difference Result 1802 states and 2861 transitions. [2022-02-20 19:42:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2861 transitions. [2022-02-20 19:42:08,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:08,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:08,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:08,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1798 states have (on average 1.5906562847608454) internal successors, (2860), 1799 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2860 transitions. [2022-02-20 19:42:08,497 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2860 transitions. Word has length 52 [2022-02-20 19:42:08,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:08,498 INFO L470 AbstractCegarLoop]: Abstraction has 1800 states and 2860 transitions. [2022-02-20 19:42:08,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:08,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2860 transitions. [2022-02-20 19:42:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:42:08,500 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:08,500 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:42:08,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:42:08,501 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:08,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:08,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1515907135, now seen corresponding path program 1 times [2022-02-20 19:42:08,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:08,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003974979] [2022-02-20 19:42:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:08,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:08,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {35760#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {35760#true} is VALID [2022-02-20 19:42:08,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {35760#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {35760#true} is VALID [2022-02-20 19:42:08,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {35760#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {35760#true} is VALID [2022-02-20 19:42:08,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {35760#true} assume 0 == ~r1~0; {35760#true} is VALID [2022-02-20 19:42:08,579 INFO L290 TraceCheckUtils]: 4: Hoare triple {35760#true} assume ~id1~0 >= 0; {35760#true} is VALID [2022-02-20 19:42:08,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {35760#true} assume 0 == ~st1~0; {35760#true} is VALID [2022-02-20 19:42:08,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {35760#true} assume ~send1~0 == ~id1~0; {35760#true} is VALID [2022-02-20 19:42:08,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {35760#true} assume 0 == ~mode1~0 % 256; {35760#true} is VALID [2022-02-20 19:42:08,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {35760#true} assume ~id2~0 >= 0; {35760#true} is VALID [2022-02-20 19:42:08,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {35760#true} assume 0 == ~st2~0; {35760#true} is VALID [2022-02-20 19:42:08,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {35760#true} assume ~send2~0 == ~id2~0; {35760#true} is VALID [2022-02-20 19:42:08,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {35760#true} assume 0 == ~mode2~0 % 256; {35760#true} is VALID [2022-02-20 19:42:08,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {35760#true} assume ~id3~0 >= 0; {35760#true} is VALID [2022-02-20 19:42:08,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {35760#true} assume 0 == ~st3~0; {35760#true} is VALID [2022-02-20 19:42:08,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {35760#true} assume ~send3~0 == ~id3~0; {35760#true} is VALID [2022-02-20 19:42:08,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {35760#true} assume 0 == ~mode3~0 % 256; {35760#true} is VALID [2022-02-20 19:42:08,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {35760#true} assume ~id4~0 >= 0; {35760#true} is VALID [2022-02-20 19:42:08,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {35760#true} assume 0 == ~st4~0; {35760#true} is VALID [2022-02-20 19:42:08,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {35760#true} assume ~send4~0 == ~id4~0; {35760#true} is VALID [2022-02-20 19:42:08,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {35760#true} assume 0 == ~mode4~0 % 256; {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == main1_~i2~0#1); {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {35762#(= (+ (* (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;main1_~i2~0#1 := 0; {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main1_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,588 INFO L290 TraceCheckUtils]: 33: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,589 INFO L290 TraceCheckUtils]: 34: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,589 INFO L290 TraceCheckUtils]: 35: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,589 INFO L290 TraceCheckUtils]: 36: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,590 INFO L290 TraceCheckUtils]: 38: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,591 INFO L290 TraceCheckUtils]: 39: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,591 INFO L290 TraceCheckUtils]: 40: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,592 INFO L290 TraceCheckUtils]: 41: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,592 INFO L290 TraceCheckUtils]: 42: Hoare triple {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {35762#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:08,593 INFO L290 TraceCheckUtils]: 43: Hoare triple {35762#(= (+ (* (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; {35761#false} is VALID [2022-02-20 19:42:08,593 INFO L290 TraceCheckUtils]: 44: Hoare triple {35761#false} assume !(node4_~m4~0#1 != ~nomsg~0); {35761#false} is VALID [2022-02-20 19:42:08,593 INFO L290 TraceCheckUtils]: 45: Hoare triple {35761#false} ~mode4~0 := 0; {35761#false} is VALID [2022-02-20 19:42:08,593 INFO L290 TraceCheckUtils]: 46: Hoare triple {35761#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; {35761#false} is VALID [2022-02-20 19:42:08,593 INFO L290 TraceCheckUtils]: 47: Hoare triple {35761#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {35761#false} is VALID [2022-02-20 19:42:08,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {35761#false} check_#res#1 := check_~tmp~1#1; {35761#false} is VALID [2022-02-20 19:42:08,594 INFO L290 TraceCheckUtils]: 49: Hoare triple {35761#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {35761#false} is VALID [2022-02-20 19:42:08,594 INFO L290 TraceCheckUtils]: 50: Hoare triple {35761#false} assume 0 == assert_~arg#1 % 256; {35761#false} is VALID [2022-02-20 19:42:08,594 INFO L290 TraceCheckUtils]: 51: Hoare triple {35761#false} assume !false; {35761#false} is VALID [2022-02-20 19:42:08,594 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 19:42:08,594 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:08,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003974979] [2022-02-20 19:42:08,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003974979] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:08,595 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:08,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:42:08,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137078854] [2022-02-20 19:42:08,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:08,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:42:08,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:08,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:08,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:08,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:42:08,632 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:08,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:42:08,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:42:08,632 INFO L87 Difference]: Start difference. First operand 1800 states and 2860 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:10,537 INFO L93 Difference]: Finished difference Result 2284 states and 3606 transitions. [2022-02-20 19:42:10,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:42:10,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:42:10,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:10,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:42:10,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:10,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:42:10,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1665 transitions. [2022-02-20 19:42:11,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:12,042 INFO L225 Difference]: With dead ends: 2284 [2022-02-20 19:42:12,043 INFO L226 Difference]: Without dead ends: 2018 [2022-02-20 19:42:12,044 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 19:42:12,045 INFO L933 BasicCegarLoop]: 1577 mSDtfsCounter, 1486 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1656 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 19:42:12,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1486 Valid, 1656 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:12,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2022-02-20 19:42:12,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 2016. [2022-02-20 19:42:12,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:12,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2018 states. Second operand has 2016 states, 2014 states have (on average 1.5809334657398213) internal successors, (3184), 2015 states have internal predecessors, (3184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:12,172 INFO L74 IsIncluded]: Start isIncluded. First operand 2018 states. Second operand has 2016 states, 2014 states have (on average 1.5809334657398213) internal successors, (3184), 2015 states have internal predecessors, (3184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:12,173 INFO L87 Difference]: Start difference. First operand 2018 states. Second operand has 2016 states, 2014 states have (on average 1.5809334657398213) internal successors, (3184), 2015 states have internal predecessors, (3184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:12,275 INFO L93 Difference]: Finished difference Result 2018 states and 3185 transitions. [2022-02-20 19:42:12,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 3185 transitions. [2022-02-20 19:42:12,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:12,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:12,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 2016 states, 2014 states have (on average 1.5809334657398213) internal successors, (3184), 2015 states have internal predecessors, (3184), 0 states have call successors, (0), 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 2018 states. [2022-02-20 19:42:12,281 INFO L87 Difference]: Start difference. First operand has 2016 states, 2014 states have (on average 1.5809334657398213) internal successors, (3184), 2015 states have internal predecessors, (3184), 0 states have call successors, (0), 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 2018 states. [2022-02-20 19:42:12,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:12,384 INFO L93 Difference]: Finished difference Result 2018 states and 3185 transitions. [2022-02-20 19:42:12,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 3185 transitions. [2022-02-20 19:42:12,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:12,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:12,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:12,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:12,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2016 states, 2014 states have (on average 1.5809334657398213) internal successors, (3184), 2015 states have internal predecessors, (3184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 3184 transitions. [2022-02-20 19:42:12,499 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 3184 transitions. Word has length 52 [2022-02-20 19:42:12,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:12,499 INFO L470 AbstractCegarLoop]: Abstraction has 2016 states and 3184 transitions. [2022-02-20 19:42:12,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:12,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 3184 transitions. [2022-02-20 19:42:12,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:42:12,500 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:12,500 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:42:12,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:42:12,500 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:12,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:12,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1924545907, now seen corresponding path program 1 times [2022-02-20 19:42:12,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:12,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613089398] [2022-02-20 19:42:12,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:12,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:12,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {44403#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {44403#true} is VALID [2022-02-20 19:42:12,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {44403#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {44403#true} is VALID [2022-02-20 19:42:12,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {44403#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {44403#true} is VALID [2022-02-20 19:42:12,585 INFO L290 TraceCheckUtils]: 3: Hoare triple {44403#true} assume 0 == ~r1~0; {44403#true} is VALID [2022-02-20 19:42:12,585 INFO L290 TraceCheckUtils]: 4: Hoare triple {44403#true} assume ~id1~0 >= 0; {44403#true} is VALID [2022-02-20 19:42:12,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {44403#true} assume 0 == ~st1~0; {44405#(<= ~st1~0 0)} is VALID [2022-02-20 19:42:12,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {44405#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {44405#(<= ~st1~0 0)} is VALID [2022-02-20 19:42:12,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {44405#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {44405#(<= ~st1~0 0)} is VALID [2022-02-20 19:42:12,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {44405#(<= ~st1~0 0)} assume ~id2~0 >= 0; {44405#(<= ~st1~0 0)} is VALID [2022-02-20 19:42:12,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {44405#(<= ~st1~0 0)} assume 0 == ~st2~0; {44406#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {44406#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {44406#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {44406#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {44406#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {44406#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {44406#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {44406#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {44407#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {44407#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {44407#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {44407#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {44407#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {44407#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {44407#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {44407#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main1_~i2~0#1); {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {44408#(<= (+ ~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;main1_~i2~0#1 := 0; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main1_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,595 INFO L290 TraceCheckUtils]: 32: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,596 INFO L290 TraceCheckUtils]: 35: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,598 INFO L290 TraceCheckUtils]: 37: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,599 INFO L290 TraceCheckUtils]: 39: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,600 INFO L290 TraceCheckUtils]: 40: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,600 INFO L290 TraceCheckUtils]: 41: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,600 INFO L290 TraceCheckUtils]: 42: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,601 INFO L290 TraceCheckUtils]: 43: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,601 INFO L290 TraceCheckUtils]: 44: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,601 INFO L290 TraceCheckUtils]: 45: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,603 INFO L290 TraceCheckUtils]: 46: Hoare triple {44408#(<= (+ ~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; {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:12,603 INFO L290 TraceCheckUtils]: 47: Hoare triple {44408#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {44404#false} is VALID [2022-02-20 19:42:12,603 INFO L290 TraceCheckUtils]: 48: Hoare triple {44404#false} check_#res#1 := check_~tmp~1#1; {44404#false} is VALID [2022-02-20 19:42:12,604 INFO L290 TraceCheckUtils]: 49: Hoare triple {44404#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {44404#false} is VALID [2022-02-20 19:42:12,604 INFO L290 TraceCheckUtils]: 50: Hoare triple {44404#false} assume 0 == assert_~arg#1 % 256; {44404#false} is VALID [2022-02-20 19:42:12,604 INFO L290 TraceCheckUtils]: 51: Hoare triple {44404#false} assume !false; {44404#false} is VALID [2022-02-20 19:42:12,604 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 19:42:12,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:12,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613089398] [2022-02-20 19:42:12,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613089398] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:12,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:12,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:42:12,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472925555] [2022-02-20 19:42:12,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:12,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:42:12,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:12,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:12,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:12,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:42:12,639 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:12,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:42:12,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:42:12,640 INFO L87 Difference]: Start difference. First operand 2016 states and 3184 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:18,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:18,208 INFO L93 Difference]: Finished difference Result 5872 states and 9080 transitions. [2022-02-20 19:42:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 19:42:18,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 19:42:18,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:18,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2089 transitions. [2022-02-20 19:42:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:18,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2089 transitions. [2022-02-20 19:42:18,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 2089 transitions. [2022-02-20 19:42:19,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2089 edges. 2089 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:20,818 INFO L225 Difference]: With dead ends: 5872 [2022-02-20 19:42:20,818 INFO L226 Difference]: Without dead ends: 5390 [2022-02-20 19:42:20,836 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 19:42:20,837 INFO L933 BasicCegarLoop]: 1531 mSDtfsCounter, 6521 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6521 SdHoareTripleChecker+Valid, 2068 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 19:42:20,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6521 Valid, 2068 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:20,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5390 states. [2022-02-20 19:42:21,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5390 to 2496. [2022-02-20 19:42:21,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:21,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5390 states. Second operand has 2496 states, 2494 states have (on average 1.5589414595028068) internal successors, (3888), 2495 states have internal predecessors, (3888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:21,425 INFO L74 IsIncluded]: Start isIncluded. First operand 5390 states. Second operand has 2496 states, 2494 states have (on average 1.5589414595028068) internal successors, (3888), 2495 states have internal predecessors, (3888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:21,427 INFO L87 Difference]: Start difference. First operand 5390 states. Second operand has 2496 states, 2494 states have (on average 1.5589414595028068) internal successors, (3888), 2495 states have internal predecessors, (3888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:22,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:22,123 INFO L93 Difference]: Finished difference Result 5390 states and 8215 transitions. [2022-02-20 19:42:22,123 INFO L276 IsEmpty]: Start isEmpty. Operand 5390 states and 8215 transitions. [2022-02-20 19:42:22,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:22,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:22,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 2496 states, 2494 states have (on average 1.5589414595028068) internal successors, (3888), 2495 states have internal predecessors, (3888), 0 states have call successors, (0), 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 5390 states. [2022-02-20 19:42:22,132 INFO L87 Difference]: Start difference. First operand has 2496 states, 2494 states have (on average 1.5589414595028068) internal successors, (3888), 2495 states have internal predecessors, (3888), 0 states have call successors, (0), 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 5390 states. [2022-02-20 19:42:22,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:22,839 INFO L93 Difference]: Finished difference Result 5390 states and 8215 transitions. [2022-02-20 19:42:22,839 INFO L276 IsEmpty]: Start isEmpty. Operand 5390 states and 8215 transitions. [2022-02-20 19:42:22,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:22,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:22,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:22,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:22,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2494 states have (on average 1.5589414595028068) internal successors, (3888), 2495 states have internal predecessors, (3888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:23,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 3888 transitions. [2022-02-20 19:42:23,020 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 3888 transitions. Word has length 52 [2022-02-20 19:42:23,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:23,020 INFO L470 AbstractCegarLoop]: Abstraction has 2496 states and 3888 transitions. [2022-02-20 19:42:23,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:23,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 3888 transitions. [2022-02-20 19:42:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:42:23,021 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:23,021 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 19:42:23,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:42:23,022 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:23,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:23,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1236981091, now seen corresponding path program 1 times [2022-02-20 19:42:23,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:23,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596445661] [2022-02-20 19:42:23,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:23,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:23,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {64824#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {64824#true} is VALID [2022-02-20 19:42:23,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {64824#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {64824#true} is VALID [2022-02-20 19:42:23,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {64824#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {64824#true} is VALID [2022-02-20 19:42:23,061 INFO L290 TraceCheckUtils]: 3: Hoare triple {64824#true} assume 0 == ~r1~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,062 INFO L290 TraceCheckUtils]: 4: Hoare triple {64826#(<= ~r1~0 0)} assume ~id1~0 >= 0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {64826#(<= ~r1~0 0)} assume 0 == ~st1~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {64826#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {64826#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {64826#(<= ~r1~0 0)} assume ~id2~0 >= 0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {64826#(<= ~r1~0 0)} assume 0 == ~st2~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {64826#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {64826#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {64826#(<= ~r1~0 0)} assume ~id3~0 >= 0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {64826#(<= ~r1~0 0)} assume 0 == ~st3~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {64826#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {64826#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {64826#(<= ~r1~0 0)} assume ~id4~0 >= 0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {64826#(<= ~r1~0 0)} assume 0 == ~st4~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {64826#(<= ~r1~0 0)} assume ~send4~0 == ~id4~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {64826#(<= ~r1~0 0)} assume 0 == ~mode4~0 % 256; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {64826#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {64826#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {64826#(<= ~r1~0 0)} assume ~id1~0 != ~id4~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {64826#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {64826#(<= ~r1~0 0)} assume ~id2~0 != ~id4~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {64826#(<= ~r1~0 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {64826#(<= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {64826#(<= ~r1~0 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {64826#(<= ~r1~0 0)} assume !(0 == main1_~i2~0#1); {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {64826#(<= ~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;main1_~i2~0#1 := 0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {64826#(<= ~r1~0 0)} assume !!(main1_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {64826#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {64826#(<= ~r1~0 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {64826#(<= ~r1~0 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {64826#(<= ~r1~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {64826#(<= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,071 INFO L290 TraceCheckUtils]: 36: Hoare triple {64826#(<= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,072 INFO L290 TraceCheckUtils]: 37: Hoare triple {64826#(<= ~r1~0 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,072 INFO L290 TraceCheckUtils]: 38: Hoare triple {64826#(<= ~r1~0 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {64826#(<= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,073 INFO L290 TraceCheckUtils]: 40: Hoare triple {64826#(<= ~r1~0 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,073 INFO L290 TraceCheckUtils]: 41: Hoare triple {64826#(<= ~r1~0 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,073 INFO L290 TraceCheckUtils]: 42: Hoare triple {64826#(<= ~r1~0 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,073 INFO L290 TraceCheckUtils]: 43: Hoare triple {64826#(<= ~r1~0 0)} assume !(0 != ~mode4~0 % 256); {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {64826#(<= ~r1~0 0)} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {64826#(<= ~r1~0 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,074 INFO L290 TraceCheckUtils]: 46: Hoare triple {64826#(<= ~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; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,075 INFO L290 TraceCheckUtils]: 47: Hoare triple {64826#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {64826#(<= ~r1~0 0)} is VALID [2022-02-20 19:42:23,075 INFO L290 TraceCheckUtils]: 48: Hoare triple {64826#(<= ~r1~0 0)} assume ~r1~0 >= 4; {64825#false} is VALID [2022-02-20 19:42:23,075 INFO L290 TraceCheckUtils]: 49: Hoare triple {64825#false} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {64825#false} is VALID [2022-02-20 19:42:23,075 INFO L290 TraceCheckUtils]: 50: Hoare triple {64825#false} check_#res#1 := check_~tmp~1#1; {64825#false} is VALID [2022-02-20 19:42:23,075 INFO L290 TraceCheckUtils]: 51: Hoare triple {64825#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {64825#false} is VALID [2022-02-20 19:42:23,076 INFO L290 TraceCheckUtils]: 52: Hoare triple {64825#false} assume 0 == assert_~arg#1 % 256; {64825#false} is VALID [2022-02-20 19:42:23,076 INFO L290 TraceCheckUtils]: 53: Hoare triple {64825#false} assume !false; {64825#false} is VALID [2022-02-20 19:42:23,076 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 19:42:23,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:23,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596445661] [2022-02-20 19:42:23,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596445661] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:23,077 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:23,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:42:23,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916569742] [2022-02-20 19:42:23,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:23,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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 19:42:23,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:23,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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 19:42:23,118 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 19:42:23,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:42:23,119 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:23,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:42:23,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:42:23,120 INFO L87 Difference]: Start difference. First operand 2496 states and 3888 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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 19:42:25,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:25,597 INFO L93 Difference]: Finished difference Result 3902 states and 5988 transitions. [2022-02-20 19:42:25,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:42:25,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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 19:42:25,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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 19:42:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1666 transitions. [2022-02-20 19:42:25,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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 19:42:25,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1666 transitions. [2022-02-20 19:42:25,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1666 transitions. [2022-02-20 19:42:26,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1666 edges. 1666 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:27,165 INFO L225 Difference]: With dead ends: 3902 [2022-02-20 19:42:27,166 INFO L226 Difference]: Without dead ends: 2940 [2022-02-20 19:42:27,167 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 19:42:27,168 INFO L933 BasicCegarLoop]: 1559 mSDtfsCounter, 1478 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1623 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 19:42:27,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1478 Valid, 1623 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:27,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2022-02-20 19:42:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2938. [2022-02-20 19:42:28,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:28,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2940 states. Second operand has 2938 states, 2936 states have (on average 1.5401907356948228) internal successors, (4522), 2937 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:28,010 INFO L74 IsIncluded]: Start isIncluded. First operand 2940 states. Second operand has 2938 states, 2936 states have (on average 1.5401907356948228) internal successors, (4522), 2937 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:28,013 INFO L87 Difference]: Start difference. First operand 2940 states. Second operand has 2938 states, 2936 states have (on average 1.5401907356948228) internal successors, (4522), 2937 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:28,235 INFO L93 Difference]: Finished difference Result 2940 states and 4523 transitions. [2022-02-20 19:42:28,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2940 states and 4523 transitions. [2022-02-20 19:42:28,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:28,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:28,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 2938 states, 2936 states have (on average 1.5401907356948228) internal successors, (4522), 2937 states have internal predecessors, (4522), 0 states have call successors, (0), 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 2940 states. [2022-02-20 19:42:28,290 INFO L87 Difference]: Start difference. First operand has 2938 states, 2936 states have (on average 1.5401907356948228) internal successors, (4522), 2937 states have internal predecessors, (4522), 0 states have call successors, (0), 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 2940 states. [2022-02-20 19:42:28,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:28,517 INFO L93 Difference]: Finished difference Result 2940 states and 4523 transitions. [2022-02-20 19:42:28,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2940 states and 4523 transitions. [2022-02-20 19:42:28,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:28,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:28,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:28,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2938 states, 2936 states have (on average 1.5401907356948228) internal successors, (4522), 2937 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2938 states and 4522 transitions. [2022-02-20 19:42:28,800 INFO L78 Accepts]: Start accepts. Automaton has 2938 states and 4522 transitions. Word has length 54 [2022-02-20 19:42:28,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:28,801 INFO L470 AbstractCegarLoop]: Abstraction has 2938 states and 4522 transitions. [2022-02-20 19:42:28,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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 19:42:28,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2938 states and 4522 transitions. [2022-02-20 19:42:28,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 19:42:28,801 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:28,802 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 19:42:28,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:42:28,802 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:28,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:28,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1303474603, now seen corresponding path program 1 times [2022-02-20 19:42:28,803 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:28,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478746710] [2022-02-20 19:42:28,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:28,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:28,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {78453#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {78453#true} is VALID [2022-02-20 19:42:28,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {78453#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {78453#true} is VALID [2022-02-20 19:42:28,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {78453#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {78453#true} is VALID [2022-02-20 19:42:28,929 INFO L290 TraceCheckUtils]: 3: Hoare triple {78453#true} assume 0 == ~r1~0; {78453#true} is VALID [2022-02-20 19:42:28,929 INFO L290 TraceCheckUtils]: 4: Hoare triple {78453#true} assume ~id1~0 >= 0; {78453#true} is VALID [2022-02-20 19:42:28,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {78453#true} assume 0 == ~st1~0; {78455#(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 19:42:28,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {78455#(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; {78455#(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 19:42:28,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {78455#(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; {78455#(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 19:42:28,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {78455#(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; {78455#(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 19:42:28,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {78455#(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; {78456#(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 19:42:28,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {78456#(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; {78456#(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 19:42:28,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {78456#(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; {78456#(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 19:42:28,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {78456#(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; {78456#(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 19:42:28,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {78456#(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; {78457#(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 19:42:28,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {78457#(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; {78457#(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 19:42:28,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {78457#(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; {78457#(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 19:42:28,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {78457#(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; {78457#(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 19:42:28,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {78457#(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; {78458#(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 19:42:28,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {78458#(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; {78458#(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 19:42:28,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {78458#(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; {78458#(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 19:42:28,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {78458#(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; {78458#(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 19:42:28,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {78458#(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; {78458#(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 19:42:28,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {78458#(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; {78458#(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 19:42:28,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {78458#(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; {78458#(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 19:42:28,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {78458#(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; {78458#(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 19:42:28,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {78458#(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; {78458#(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 19:42:28,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {78458#(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; {78458#(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 19:42:28,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {78458#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {78458#(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 19:42:28,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {78458#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == main1_~i2~0#1); {78458#(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 19:42:28,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {78458#(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;main1_~i2~0#1 := 0; {78458#(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 19:42:28,942 INFO L290 TraceCheckUtils]: 30: Hoare triple {78458#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(main1_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {78458#(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 19:42:28,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {78458#(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); {78458#(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 19:42:28,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {78458#(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~ite5#1 := ~send1~0; {78458#(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 19:42:28,943 INFO L290 TraceCheckUtils]: 33: Hoare triple {78458#(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~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {78458#(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 19:42:28,944 INFO L290 TraceCheckUtils]: 34: Hoare triple {78458#(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~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {78458#(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 19:42:28,944 INFO L290 TraceCheckUtils]: 35: Hoare triple {78458#(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); {78458#(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 19:42:28,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {78458#(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~ite6#1 := ~send2~0; {78458#(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 19:42:28,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {78458#(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~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {78458#(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 19:42:28,945 INFO L290 TraceCheckUtils]: 38: Hoare triple {78458#(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~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {78458#(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 19:42:28,946 INFO L290 TraceCheckUtils]: 39: Hoare triple {78458#(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); {78458#(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 19:42:28,946 INFO L290 TraceCheckUtils]: 40: Hoare triple {78458#(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~ite7#1 := ~p3_new~0; {78458#(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 19:42:28,947 INFO L290 TraceCheckUtils]: 41: Hoare triple {78458#(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~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {78458#(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 19:42:28,947 INFO L290 TraceCheckUtils]: 42: Hoare triple {78458#(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~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {78458#(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 19:42:28,948 INFO L290 TraceCheckUtils]: 43: Hoare triple {78458#(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); {78458#(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 19:42:28,948 INFO L290 TraceCheckUtils]: 44: Hoare triple {78458#(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~ite8#1 := ~p4_new~0; {78458#(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 19:42:28,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {78458#(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~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {78458#(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 19:42:28,949 INFO L290 TraceCheckUtils]: 46: Hoare triple {78458#(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; {78458#(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 19:42:28,949 INFO L290 TraceCheckUtils]: 47: Hoare triple {78458#(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; {78458#(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 19:42:28,950 INFO L290 TraceCheckUtils]: 48: Hoare triple {78458#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 >= 4); {78458#(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 19:42:28,950 INFO L290 TraceCheckUtils]: 49: Hoare triple {78458#(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; {78454#false} is VALID [2022-02-20 19:42:28,951 INFO L290 TraceCheckUtils]: 50: Hoare triple {78454#false} check_#res#1 := check_~tmp~1#1; {78454#false} is VALID [2022-02-20 19:42:28,951 INFO L290 TraceCheckUtils]: 51: Hoare triple {78454#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {78454#false} is VALID [2022-02-20 19:42:28,951 INFO L290 TraceCheckUtils]: 52: Hoare triple {78454#false} assume 0 == assert_~arg#1 % 256; {78454#false} is VALID [2022-02-20 19:42:28,951 INFO L290 TraceCheckUtils]: 53: Hoare triple {78454#false} assume !false; {78454#false} is VALID [2022-02-20 19:42:28,952 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 19:42:28,952 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:28,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478746710] [2022-02-20 19:42:28,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478746710] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:28,952 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:28,952 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:42:28,952 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6575451] [2022-02-20 19:42:28,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:28,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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 19:42:28,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:28,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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 19:42:28,992 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 19:42:28,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:42:28,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:28,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:42:28,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:42:28,994 INFO L87 Difference]: Start difference. First operand 2938 states and 4522 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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 19:42:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:32,426 INFO L93 Difference]: Finished difference Result 4342 states and 6596 transitions. [2022-02-20 19:42:32,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:42:32,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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 19:42:32,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:32,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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 19:42:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1673 transitions. [2022-02-20 19:42:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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 19:42:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1673 transitions. [2022-02-20 19:42:32,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1673 transitions. [2022-02-20 19:42:33,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1673 edges. 1673 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:34,115 INFO L225 Difference]: With dead ends: 4342 [2022-02-20 19:42:34,116 INFO L226 Difference]: Without dead ends: 2940 [2022-02-20 19:42:34,117 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 19:42:34,119 INFO L933 BasicCegarLoop]: 1531 mSDtfsCounter, 1590 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 1793 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 19:42:34,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1590 Valid, 1793 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:34,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2022-02-20 19:42:35,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2938. [2022-02-20 19:42:35,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:35,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2940 states. Second operand has 2938 states, 2936 states have (on average 1.5320163487738419) internal successors, (4498), 2937 states have internal predecessors, (4498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:35,057 INFO L74 IsIncluded]: Start isIncluded. First operand 2940 states. Second operand has 2938 states, 2936 states have (on average 1.5320163487738419) internal successors, (4498), 2937 states have internal predecessors, (4498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:35,060 INFO L87 Difference]: Start difference. First operand 2940 states. Second operand has 2938 states, 2936 states have (on average 1.5320163487738419) internal successors, (4498), 2937 states have internal predecessors, (4498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:35,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:35,263 INFO L93 Difference]: Finished difference Result 2940 states and 4499 transitions. [2022-02-20 19:42:35,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2940 states and 4499 transitions. [2022-02-20 19:42:35,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:35,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:35,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 2938 states, 2936 states have (on average 1.5320163487738419) internal successors, (4498), 2937 states have internal predecessors, (4498), 0 states have call successors, (0), 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 2940 states. [2022-02-20 19:42:35,271 INFO L87 Difference]: Start difference. First operand has 2938 states, 2936 states have (on average 1.5320163487738419) internal successors, (4498), 2937 states have internal predecessors, (4498), 0 states have call successors, (0), 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 2940 states. [2022-02-20 19:42:35,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:35,480 INFO L93 Difference]: Finished difference Result 2940 states and 4499 transitions. [2022-02-20 19:42:35,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2940 states and 4499 transitions. [2022-02-20 19:42:35,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:35,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:35,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:35,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2938 states, 2936 states have (on average 1.5320163487738419) internal successors, (4498), 2937 states have internal predecessors, (4498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2938 states and 4498 transitions. [2022-02-20 19:42:35,742 INFO L78 Accepts]: Start accepts. Automaton has 2938 states and 4498 transitions. Word has length 54 [2022-02-20 19:42:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:35,742 INFO L470 AbstractCegarLoop]: Abstraction has 2938 states and 4498 transitions. [2022-02-20 19:42:35,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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 19:42:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2938 states and 4498 transitions. [2022-02-20 19:42:35,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 19:42:35,743 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:35,743 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:42:35,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:42:35,743 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:35,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:35,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1338283904, now seen corresponding path program 1 times [2022-02-20 19:42:35,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:35,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179906674] [2022-02-20 19:42:35,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:35,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:35,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {92633#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {92635#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:35,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {92635#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {92635#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:35,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {92635#(<= (+ ~nomsg~0 1) 0)} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {92635#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:35,803 INFO L290 TraceCheckUtils]: 3: Hoare triple {92635#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {92635#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:35,803 INFO L290 TraceCheckUtils]: 4: Hoare triple {92635#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {92635#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:35,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {92635#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {92635#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:35,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {92635#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {92635#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:35,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {92635#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {92635#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:35,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {92635#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {92635#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:35,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {92635#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {92635#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:35,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {92635#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {92635#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:35,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {92635#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {92635#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:35,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {92635#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {92635#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:35,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {92635#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {92635#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:35,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {92635#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {92635#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:35,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {92635#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {92635#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 19:42:35,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {92635#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {92636#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 19:42:35,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {92636#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {92636#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 19:42:35,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {92636#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {92637#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:35,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {92637#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {92637#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:35,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {92637#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {92637#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:35,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {92637#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {92637#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:35,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {92637#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {92637#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:35,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {92637#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {92637#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:35,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {92637#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {92637#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:35,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {92637#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {92637#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:35,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {92637#(<= (+ ~nomsg~0 1) ~send4~0)} init_#res#1 := init_~tmp~0#1; {92637#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:35,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {92637#(<= (+ ~nomsg~0 1) ~send4~0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {92637#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:35,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {92637#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(0 == main1_~i2~0#1); {92637#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 19:42:35,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {92637#(<= (+ ~nomsg~0 1) ~send4~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;main1_~i2~0#1 := 0; {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:35,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !!(main1_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:35,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(0 != ~mode1~0 % 256); {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:35,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:35,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:35,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:35,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(0 != ~mode2~0 % 256); {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:35,814 INFO L290 TraceCheckUtils]: 36: Hoare triple {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:35,814 INFO L290 TraceCheckUtils]: 37: Hoare triple {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:35,814 INFO L290 TraceCheckUtils]: 38: Hoare triple {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:35,815 INFO L290 TraceCheckUtils]: 39: Hoare triple {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(0 != ~mode3~0 % 256); {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:35,815 INFO L290 TraceCheckUtils]: 40: Hoare triple {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:35,816 INFO L290 TraceCheckUtils]: 41: Hoare triple {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:35,816 INFO L290 TraceCheckUtils]: 42: Hoare triple {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:35,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(0 != ~mode4~0 % 256); {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} is VALID [2022-02-20 19:42:35,817 INFO L290 TraceCheckUtils]: 44: Hoare triple {92638#(and (= (+ (* (- 1) ~p4_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send4~0))} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {92634#false} is VALID [2022-02-20 19:42:35,817 INFO L290 TraceCheckUtils]: 45: Hoare triple {92634#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {92634#false} is VALID [2022-02-20 19:42:35,817 INFO L290 TraceCheckUtils]: 46: Hoare triple {92634#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; {92634#false} is VALID [2022-02-20 19:42:35,817 INFO L290 TraceCheckUtils]: 47: Hoare triple {92634#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {92634#false} is VALID [2022-02-20 19:42:35,817 INFO L290 TraceCheckUtils]: 48: Hoare triple {92634#false} assume !(~r1~0 >= 4); {92634#false} is VALID [2022-02-20 19:42:35,817 INFO L290 TraceCheckUtils]: 49: Hoare triple {92634#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {92634#false} is VALID [2022-02-20 19:42:35,818 INFO L290 TraceCheckUtils]: 50: Hoare triple {92634#false} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {92634#false} is VALID [2022-02-20 19:42:35,818 INFO L290 TraceCheckUtils]: 51: Hoare triple {92634#false} check_#res#1 := check_~tmp~1#1; {92634#false} is VALID [2022-02-20 19:42:35,818 INFO L290 TraceCheckUtils]: 52: Hoare triple {92634#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {92634#false} is VALID [2022-02-20 19:42:35,818 INFO L290 TraceCheckUtils]: 53: Hoare triple {92634#false} assume 0 == assert_~arg#1 % 256; {92634#false} is VALID [2022-02-20 19:42:35,818 INFO L290 TraceCheckUtils]: 54: Hoare triple {92634#false} assume !false; {92634#false} is VALID [2022-02-20 19:42:35,818 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 19:42:35,819 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:35,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179906674] [2022-02-20 19:42:35,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179906674] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:35,819 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:35,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:42:35,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178859736] [2022-02-20 19:42:35,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:35,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 19:42:35,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:35,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:35,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:35,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:42:35,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:35,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:42:35,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:42:35,858 INFO L87 Difference]: Start difference. First operand 2938 states and 4498 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:40,830 INFO L93 Difference]: Finished difference Result 4340 states and 6547 transitions. [2022-02-20 19:42:40,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:42:40,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 19:42:40,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:40,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1607 transitions. [2022-02-20 19:42:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1607 transitions. [2022-02-20 19:42:40,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1607 transitions.