./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.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.3.ufo.UNBOUNDED.pals+Problem12_label08.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 5a9891cd4c5f04616b7fa480ff51a2b34c717470141ef1b888630cca6069f53e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:39:59,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:39:59,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:39:59,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:39:59,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:39:59,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:39:59,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:39:59,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:39:59,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:39:59,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:39:59,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:39:59,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:39:59,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:39:59,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:39:59,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:39:59,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:39:59,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:39:59,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:39:59,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:39:59,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:39:59,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:39:59,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:39:59,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:39:59,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:39:59,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:39:59,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:39:59,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:39:59,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:39:59,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:39:59,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:39:59,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:39:59,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:39:59,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:39:59,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:39:59,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:39:59,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:39:59,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:39:59,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:39:59,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:39:59,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:39:59,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:39:59,764 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:39:59,781 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:39:59,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:39:59,785 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:39:59,785 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:39:59,786 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:39:59,786 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:39:59,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:39:59,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:39:59,786 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:39:59,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:39:59,787 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:39:59,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:39:59,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:39:59,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:39:59,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:39:59,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:39:59,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:39:59,788 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:39:59,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:39:59,789 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:39:59,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:39:59,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:39:59,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:39:59,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:39:59,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:39:59,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:39:59,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:39:59,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:39:59,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:39:59,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:39:59,790 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:39:59,790 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:39:59,790 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:39:59,791 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 -> 5a9891cd4c5f04616b7fa480ff51a2b34c717470141ef1b888630cca6069f53e [2022-02-20 19:39:59,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:40:00,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:40:00,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:40:00,003 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:40:00,004 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:40:00,005 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.c [2022-02-20 19:40:00,044 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7908fe39/a6a44e92faa34bc1acee3b09ae53d71d/FLAG7d36bf954 [2022-02-20 19:40:00,666 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:40:00,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.c [2022-02-20 19:40:00,693 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7908fe39/a6a44e92faa34bc1acee3b09ae53d71d/FLAG7d36bf954 [2022-02-20 19:40:01,082 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7908fe39/a6a44e92faa34bc1acee3b09ae53d71d [2022-02-20 19:40:01,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:40:01,085 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:40:01,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:40:01,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:40:01,088 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:40:01,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:40:01" (1/1) ... [2022-02-20 19:40:01,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a67a30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:01, skipping insertion in model container [2022-02-20 19:40:01,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:40:01" (1/1) ... [2022-02-20 19:40:01,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:40:01,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:40:01,388 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.3.ufo.UNBOUNDED.pals+Problem12_label08.c[6450,6463] [2022-02-20 19:40:01,416 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.3.ufo.UNBOUNDED.pals+Problem12_label08.c[9957,9970] [2022-02-20 19:40:01,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:40:01,959 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:40:01,973 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.3.ufo.UNBOUNDED.pals+Problem12_label08.c[6450,6463] [2022-02-20 19:40:01,977 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.3.ufo.UNBOUNDED.pals+Problem12_label08.c[9957,9970] [2022-02-20 19:40:02,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:40:02,301 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:40:02,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:02 WrapperNode [2022-02-20 19:40:02,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:40:02,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:40:02,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:40:02,303 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:40:02,309 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:40:02" (1/1) ... [2022-02-20 19:40:02,355 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:40:02" (1/1) ... [2022-02-20 19:40:02,623 INFO L137 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4976 [2022-02-20 19:40:02,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:40:02,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:40:02,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:40:02,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:40:02,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:02" (1/1) ... [2022-02-20 19:40:02,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:02" (1/1) ... [2022-02-20 19:40:02,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:02" (1/1) ... [2022-02-20 19:40:02,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:02" (1/1) ... [2022-02-20 19:40:02,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:02" (1/1) ... [2022-02-20 19:40:02,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:02" (1/1) ... [2022-02-20 19:40:02,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:02" (1/1) ... [2022-02-20 19:40:02,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:40:03,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:40:03,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:40:03,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:40:03,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:02" (1/1) ... [2022-02-20 19:40:03,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:40:03,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:40:03,024 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:40:03,033 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:40:03,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:40:03,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:40:03,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:40:03,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:40:03,128 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:40:03,132 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:40:09,457 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:40:09,469 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:40:09,470 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:40:09,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:40:09 BoogieIcfgContainer [2022-02-20 19:40:09,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:40:09,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:40:09,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:40:09,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:40:09,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:40:01" (1/3) ... [2022-02-20 19:40:09,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63dc82a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:40:09, skipping insertion in model container [2022-02-20 19:40:09,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:02" (2/3) ... [2022-02-20 19:40:09,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63dc82a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:40:09, skipping insertion in model container [2022-02-20 19:40:09,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:40:09" (3/3) ... [2022-02-20 19:40:09,477 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.c [2022-02-20 19:40:09,480 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:40:09,481 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:40:09,511 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:40:09,515 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:40:09,516 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:40:09,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 880 states, 877 states have (on average 1.903078677309008) internal successors, (1669), 879 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have 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:40:09,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 19:40:09,548 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:09,548 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] [2022-02-20 19:40:09,549 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:09,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:09,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1601385972, now seen corresponding path program 1 times [2022-02-20 19:40:09,558 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:09,558 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73185508] [2022-02-20 19:40:09,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:09,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:09,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {883#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;~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; {883#true} is VALID [2022-02-20 19:40:09,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {883#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {883#true} is VALID [2022-02-20 19:40:09,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {883#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {883#true} is VALID [2022-02-20 19:40:09,679 INFO L290 TraceCheckUtils]: 3: Hoare triple {883#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {883#true} is VALID [2022-02-20 19:40:09,679 INFO L290 TraceCheckUtils]: 4: Hoare triple {883#true} init_#res#1 := init_~tmp~0#1; {883#true} is VALID [2022-02-20 19:40:09,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {883#true} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {883#true} is VALID [2022-02-20 19:40:09,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {883#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {884#false} is VALID [2022-02-20 19:40:09,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {884#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {884#false} is VALID [2022-02-20 19:40:09,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {884#false} assume !false;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; {884#false} is VALID [2022-02-20 19:40:09,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {884#false} assume !(0 != ~mode1~0 % 256); {884#false} is VALID [2022-02-20 19:40:09,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {884#false} is VALID [2022-02-20 19:40:09,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#false} ~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; {884#false} is VALID [2022-02-20 19:40:09,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {884#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; {884#false} is VALID [2022-02-20 19:40:09,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {884#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {884#false} is VALID [2022-02-20 19:40:09,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {884#false} assume !(node2_~m2~0#1 != ~nomsg~0); {884#false} is VALID [2022-02-20 19:40:09,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {884#false} ~mode2~0 := 0; {884#false} is VALID [2022-02-20 19:40:09,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {884#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; {884#false} is VALID [2022-02-20 19:40:09,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {884#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {884#false} is VALID [2022-02-20 19:40:09,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {884#false} assume !(node3_~m3~0#1 != ~nomsg~0); {884#false} is VALID [2022-02-20 19:40:09,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {884#false} ~mode3~0 := 0; {884#false} is VALID [2022-02-20 19:40:09,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {884#false} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {884#false} is VALID [2022-02-20 19:40:09,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {884#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {884#false} is VALID [2022-02-20 19:40:09,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {884#false} check_#res#1 := check_~tmp~1#1; {884#false} is VALID [2022-02-20 19:40:09,684 INFO L290 TraceCheckUtils]: 23: Hoare triple {884#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {884#false} is VALID [2022-02-20 19:40:09,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {884#false} assume 0 == assert_~arg#1 % 256; {884#false} is VALID [2022-02-20 19:40:09,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {884#false} assume !false; {884#false} is VALID [2022-02-20 19:40:09,685 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:40:09,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:09,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73185508] [2022-02-20 19:40:09,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73185508] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:09,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:09,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:40:09,687 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561297814] [2022-02-20 19:40:09,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:09,691 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-20 19:40:09,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:09,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:09,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:09,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:40:09,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:09,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:40:09,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:40:09,735 INFO L87 Difference]: Start difference. First operand has 880 states, 877 states have (on average 1.903078677309008) internal successors, (1669), 879 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:10,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:10,994 INFO L93 Difference]: Finished difference Result 1736 states and 3296 transitions. [2022-02-20 19:40:10,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:40:10,995 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-20 19:40:10,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3296 transitions. [2022-02-20 19:40:11,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3296 transitions. [2022-02-20 19:40:11,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3296 transitions. [2022-02-20 19:40:13,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3296 edges. 3296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:13,629 INFO L225 Difference]: With dead ends: 1736 [2022-02-20 19:40:13,629 INFO L226 Difference]: Without dead ends: 814 [2022-02-20 19:40:13,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:40:13,638 INFO L933 BasicCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:13,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:13,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2022-02-20 19:40:13,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 814. [2022-02-20 19:40:13,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:13,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 814 states. Second operand has 814 states, 812 states have (on average 1.8916256157635467) internal successors, (1536), 813 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have 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:40:13,697 INFO L74 IsIncluded]: Start isIncluded. First operand 814 states. Second operand has 814 states, 812 states have (on average 1.8916256157635467) internal successors, (1536), 813 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have 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:40:13,698 INFO L87 Difference]: Start difference. First operand 814 states. Second operand has 814 states, 812 states have (on average 1.8916256157635467) internal successors, (1536), 813 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have 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:40:13,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:13,726 INFO L93 Difference]: Finished difference Result 814 states and 1536 transitions. [2022-02-20 19:40:13,726 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1536 transitions. [2022-02-20 19:40:13,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:13,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:13,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 814 states, 812 states have (on average 1.8916256157635467) internal successors, (1536), 813 states have internal predecessors, (1536), 0 states have call successors, (0), 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 814 states. [2022-02-20 19:40:13,736 INFO L87 Difference]: Start difference. First operand has 814 states, 812 states have (on average 1.8916256157635467) internal successors, (1536), 813 states have internal predecessors, (1536), 0 states have call successors, (0), 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 814 states. [2022-02-20 19:40:13,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:13,763 INFO L93 Difference]: Finished difference Result 814 states and 1536 transitions. [2022-02-20 19:40:13,763 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1536 transitions. [2022-02-20 19:40:13,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:13,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:13,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:13,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 812 states have (on average 1.8916256157635467) internal successors, (1536), 813 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have 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:40:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1536 transitions. [2022-02-20 19:40:13,798 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1536 transitions. Word has length 26 [2022-02-20 19:40:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:13,799 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1536 transitions. [2022-02-20 19:40:13,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1536 transitions. [2022-02-20 19:40:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 19:40:13,804 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:13,804 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] [2022-02-20 19:40:13,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:40:13,805 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:13,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:13,807 INFO L85 PathProgramCache]: Analyzing trace with hash 783737522, now seen corresponding path program 1 times [2022-02-20 19:40:13,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:13,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885756986] [2022-02-20 19:40:13,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:13,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:13,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {5103#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;~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; {5103#true} is VALID [2022-02-20 19:40:13,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {5103#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {5103#true} is VALID [2022-02-20 19:40:13,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {5103#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5103#true} is VALID [2022-02-20 19:40:13,895 INFO L290 TraceCheckUtils]: 3: Hoare triple {5103#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5105#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:40:13,895 INFO L290 TraceCheckUtils]: 4: Hoare triple {5105#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5106#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:40:13,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {5106#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5107#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:40:13,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {5107#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5104#false} is VALID [2022-02-20 19:40:13,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {5104#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5104#false} is VALID [2022-02-20 19:40:13,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {5104#false} assume !false;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; {5104#false} is VALID [2022-02-20 19:40:13,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {5104#false} assume !(0 != ~mode1~0 % 256); {5104#false} is VALID [2022-02-20 19:40:13,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {5104#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {5104#false} is VALID [2022-02-20 19:40:13,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {5104#false} ~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; {5104#false} is VALID [2022-02-20 19:40:13,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {5104#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; {5104#false} is VALID [2022-02-20 19:40:13,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {5104#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5104#false} is VALID [2022-02-20 19:40:13,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {5104#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5104#false} is VALID [2022-02-20 19:40:13,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {5104#false} ~mode2~0 := 0; {5104#false} is VALID [2022-02-20 19:40:13,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {5104#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; {5104#false} is VALID [2022-02-20 19:40:13,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {5104#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5104#false} is VALID [2022-02-20 19:40:13,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {5104#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5104#false} is VALID [2022-02-20 19:40:13,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {5104#false} ~mode3~0 := 0; {5104#false} is VALID [2022-02-20 19:40:13,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {5104#false} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5104#false} is VALID [2022-02-20 19:40:13,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {5104#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {5104#false} is VALID [2022-02-20 19:40:13,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {5104#false} check_#res#1 := check_~tmp~1#1; {5104#false} is VALID [2022-02-20 19:40:13,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {5104#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {5104#false} is VALID [2022-02-20 19:40:13,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {5104#false} assume 0 == assert_~arg#1 % 256; {5104#false} is VALID [2022-02-20 19:40:13,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {5104#false} assume !false; {5104#false} is VALID [2022-02-20 19:40:13,900 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:40:13,900 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:13,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885756986] [2022-02-20 19:40:13,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885756986] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:13,901 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:13,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:13,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954704631] [2022-02-20 19:40:13,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:13,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-20 19:40:13,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:13,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:13,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:13,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:13,917 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:13,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:13,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:13,918 INFO L87 Difference]: Start difference. First operand 814 states and 1536 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:17,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:17,617 INFO L93 Difference]: Finished difference Result 856 states and 1599 transitions. [2022-02-20 19:40:17,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:40:17,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-20 19:40:17,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1599 transitions. [2022-02-20 19:40:17,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1599 transitions. [2022-02-20 19:40:17,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1599 transitions. [2022-02-20 19:40:18,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1599 edges. 1599 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:18,751 INFO L225 Difference]: With dead ends: 856 [2022-02-20 19:40:18,751 INFO L226 Difference]: Without dead ends: 814 [2022-02-20 19:40:18,752 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:40:18,752 INFO L933 BasicCegarLoop]: 1534 mSDtfsCounter, 3 mSDsluCounter, 4583 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6117 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:18,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6117 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:18,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2022-02-20 19:40:18,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 814. [2022-02-20 19:40:18,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:18,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 814 states. Second operand has 814 states, 812 states have (on average 1.8719211822660098) internal successors, (1520), 813 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have 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:40:18,775 INFO L74 IsIncluded]: Start isIncluded. First operand 814 states. Second operand has 814 states, 812 states have (on average 1.8719211822660098) internal successors, (1520), 813 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have 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:40:18,776 INFO L87 Difference]: Start difference. First operand 814 states. Second operand has 814 states, 812 states have (on average 1.8719211822660098) internal successors, (1520), 813 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have 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:40:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:18,801 INFO L93 Difference]: Finished difference Result 814 states and 1520 transitions. [2022-02-20 19:40:18,802 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1520 transitions. [2022-02-20 19:40:18,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:18,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:18,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 814 states, 812 states have (on average 1.8719211822660098) internal successors, (1520), 813 states have internal predecessors, (1520), 0 states have call successors, (0), 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 814 states. [2022-02-20 19:40:18,806 INFO L87 Difference]: Start difference. First operand has 814 states, 812 states have (on average 1.8719211822660098) internal successors, (1520), 813 states have internal predecessors, (1520), 0 states have call successors, (0), 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 814 states. [2022-02-20 19:40:18,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:18,832 INFO L93 Difference]: Finished difference Result 814 states and 1520 transitions. [2022-02-20 19:40:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1520 transitions. [2022-02-20 19:40:18,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:18,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:18,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:18,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 812 states have (on average 1.8719211822660098) internal successors, (1520), 813 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have 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:40:18,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1520 transitions. [2022-02-20 19:40:18,859 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1520 transitions. Word has length 26 [2022-02-20 19:40:18,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:18,859 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1520 transitions. [2022-02-20 19:40:18,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:18,859 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1520 transitions. [2022-02-20 19:40:18,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:40:18,860 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:18,860 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:40:18,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:40:18,861 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:18,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:18,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1008444205, now seen corresponding path program 1 times [2022-02-20 19:40:18,861 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:18,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986233436] [2022-02-20 19:40:18,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:18,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:18,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {8443#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;~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; {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {8445#(<= 15 ~a24~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {8445#(<= 15 ~a24~0)} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet35#1, main2_#t~ret36#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,947 INFO L290 TraceCheckUtils]: 3: Hoare triple {8445#(<= 15 ~a24~0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet35#1 && main2_#t~nondet35#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet35#1;havoc main2_#t~nondet35#1; {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,948 INFO L290 TraceCheckUtils]: 4: Hoare triple {8445#(<= 15 ~a24~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~ret32#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {8445#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8445#(<= 15 ~a24~0)} is VALID [2022-02-20 19:40:18,959 INFO L290 TraceCheckUtils]: 28: Hoare triple {8445#(<= 15 ~a24~0)} assume (((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {8444#false} is VALID [2022-02-20 19:40:18,960 INFO L290 TraceCheckUtils]: 29: Hoare triple {8444#false} assume !false; {8444#false} is VALID [2022-02-20 19:40:18,961 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:40:18,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:18,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986233436] [2022-02-20 19:40:18,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986233436] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:18,962 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:18,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:40:18,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821930256] [2022-02-20 19:40:18,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:18,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 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:40:18,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:18,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 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:40:18,980 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:40:18,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:18,981 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:18,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:18,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:18,982 INFO L87 Difference]: Start difference. First operand 814 states and 1520 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 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:40:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:23,762 INFO L93 Difference]: Finished difference Result 2318 states and 4393 transitions. [2022-02-20 19:40:23,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:23,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 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:40:23,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:23,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 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:40:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4393 transitions. [2022-02-20 19:40:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 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:40:23,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4393 transitions. [2022-02-20 19:40:23,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4393 transitions. [2022-02-20 19:40:26,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4393 edges. 4393 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:27,009 INFO L225 Difference]: With dead ends: 2318 [2022-02-20 19:40:27,010 INFO L226 Difference]: Without dead ends: 1565 [2022-02-20 19:40:27,010 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:40:27,011 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 869 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:27,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [869 Valid, 509 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-20 19:40:27,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2022-02-20 19:40:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565. [2022-02-20 19:40:27,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:27,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1565 states. Second operand has 1565 states, 1563 states have (on average 1.6295585412667946) internal successors, (2547), 1564 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have 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:40:27,042 INFO L74 IsIncluded]: Start isIncluded. First operand 1565 states. Second operand has 1565 states, 1563 states have (on average 1.6295585412667946) internal successors, (2547), 1564 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have 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:40:27,044 INFO L87 Difference]: Start difference. First operand 1565 states. Second operand has 1565 states, 1563 states have (on average 1.6295585412667946) internal successors, (2547), 1564 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have 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:40:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:27,118 INFO L93 Difference]: Finished difference Result 1565 states and 2547 transitions. [2022-02-20 19:40:27,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2547 transitions. [2022-02-20 19:40:27,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:27,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:27,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 1565 states, 1563 states have (on average 1.6295585412667946) internal successors, (2547), 1564 states have internal predecessors, (2547), 0 states have call successors, (0), 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 1565 states. [2022-02-20 19:40:27,154 INFO L87 Difference]: Start difference. First operand has 1565 states, 1563 states have (on average 1.6295585412667946) internal successors, (2547), 1564 states have internal predecessors, (2547), 0 states have call successors, (0), 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 1565 states. [2022-02-20 19:40:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:27,227 INFO L93 Difference]: Finished difference Result 1565 states and 2547 transitions. [2022-02-20 19:40:27,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2547 transitions. [2022-02-20 19:40:27,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:27,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:27,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:27,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1563 states have (on average 1.6295585412667946) internal successors, (2547), 1564 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have 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:40:27,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2547 transitions. [2022-02-20 19:40:27,308 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2547 transitions. Word has length 30 [2022-02-20 19:40:27,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:27,308 INFO L470 AbstractCegarLoop]: Abstraction has 1565 states and 2547 transitions. [2022-02-20 19:40:27,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 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:40:27,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2547 transitions. [2022-02-20 19:40:27,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:40:27,310 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:27,310 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:27,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:40:27,310 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:27,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:27,312 INFO L85 PathProgramCache]: Analyzing trace with hash -698732182, now seen corresponding path program 1 times [2022-02-20 19:40:27,312 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:27,312 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808878005] [2022-02-20 19:40:27,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:27,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:27,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {15500#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;~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; {15500#true} is VALID [2022-02-20 19:40:27,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {15500#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {15500#true} is VALID [2022-02-20 19:40:27,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {15500#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {15500#true} is VALID [2022-02-20 19:40:27,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {15500#true} assume 0 == ~r1~0 % 256; {15500#true} is VALID [2022-02-20 19:40:27,370 INFO L290 TraceCheckUtils]: 4: Hoare triple {15500#true} assume ~id1~0 >= 0; {15500#true} is VALID [2022-02-20 19:40:27,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {15500#true} assume 0 == ~st1~0; {15500#true} is VALID [2022-02-20 19:40:27,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {15500#true} assume ~send1~0 == ~id1~0; {15500#true} is VALID [2022-02-20 19:40:27,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {15500#true} assume 0 == ~mode1~0 % 256; {15500#true} is VALID [2022-02-20 19:40:27,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {15500#true} assume ~id2~0 >= 0; {15500#true} is VALID [2022-02-20 19:40:27,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {15500#true} assume 0 == ~st2~0; {15500#true} is VALID [2022-02-20 19:40:27,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {15500#true} assume ~send2~0 == ~id2~0; {15500#true} is VALID [2022-02-20 19:40:27,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {15500#true} assume 0 == ~mode2~0 % 256; {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:27,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:27,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:27,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:27,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:27,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:27,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:27,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:27,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:27,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:27,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:27,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:27,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;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; {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:27,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:27,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:27,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {15502#(= (+ (* (- 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; {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:27,381 INFO L290 TraceCheckUtils]: 27: Hoare triple {15502#(= (+ (* (- 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; {15502#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:27,382 INFO L290 TraceCheckUtils]: 28: Hoare triple {15502#(= (+ (* (- 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; {15501#false} is VALID [2022-02-20 19:40:27,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {15501#false} assume !(node2_~m2~0#1 != ~nomsg~0); {15501#false} is VALID [2022-02-20 19:40:27,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {15501#false} ~mode2~0 := 0; {15501#false} is VALID [2022-02-20 19:40:27,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {15501#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; {15501#false} is VALID [2022-02-20 19:40:27,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {15501#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {15501#false} is VALID [2022-02-20 19:40:27,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {15501#false} assume !(node3_~m3~0#1 != ~nomsg~0); {15501#false} is VALID [2022-02-20 19:40:27,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {15501#false} ~mode3~0 := 0; {15501#false} is VALID [2022-02-20 19:40:27,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {15501#false} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {15501#false} is VALID [2022-02-20 19:40:27,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {15501#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {15501#false} is VALID [2022-02-20 19:40:27,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {15501#false} check_#res#1 := check_~tmp~1#1; {15501#false} is VALID [2022-02-20 19:40:27,387 INFO L290 TraceCheckUtils]: 38: Hoare triple {15501#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {15501#false} is VALID [2022-02-20 19:40:27,387 INFO L290 TraceCheckUtils]: 39: Hoare triple {15501#false} assume 0 == assert_~arg#1 % 256; {15501#false} is VALID [2022-02-20 19:40:27,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {15501#false} assume !false; {15501#false} is VALID [2022-02-20 19:40:27,388 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:40:27,388 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:27,388 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808878005] [2022-02-20 19:40:27,388 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808878005] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:27,389 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:27,389 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:27,389 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16645996] [2022-02-20 19:40:27,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:27,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:40:27,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:27,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:27,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:27,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:27,415 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:27,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:27,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:27,416 INFO L87 Difference]: Start difference. First operand 1565 states and 2547 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:29,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:29,237 INFO L93 Difference]: Finished difference Result 1635 states and 2655 transitions. [2022-02-20 19:40:29,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:29,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:40:29,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2022-02-20 19:40:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2022-02-20 19:40:29,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1628 transitions. [2022-02-20 19:40:30,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1628 edges. 1628 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:30,616 INFO L225 Difference]: With dead ends: 1635 [2022-02-20 19:40:30,616 INFO L226 Difference]: Without dead ends: 1597 [2022-02-20 19:40:30,616 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:40:30,617 INFO L933 BasicCegarLoop]: 1549 mSDtfsCounter, 1484 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1610 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:40:30,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1484 Valid, 1610 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:30,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2022-02-20 19:40:30,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1595. [2022-02-20 19:40:30,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:30,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1597 states. Second operand has 1595 states, 1593 states have (on average 1.628374136848713) internal successors, (2594), 1594 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have 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:40:30,651 INFO L74 IsIncluded]: Start isIncluded. First operand 1597 states. Second operand has 1595 states, 1593 states have (on average 1.628374136848713) internal successors, (2594), 1594 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have 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:40:30,665 INFO L87 Difference]: Start difference. First operand 1597 states. Second operand has 1595 states, 1593 states have (on average 1.628374136848713) internal successors, (2594), 1594 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have 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:40:30,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:30,735 INFO L93 Difference]: Finished difference Result 1597 states and 2595 transitions. [2022-02-20 19:40:30,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2595 transitions. [2022-02-20 19:40:30,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:30,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:30,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 1595 states, 1593 states have (on average 1.628374136848713) internal successors, (2594), 1594 states have internal predecessors, (2594), 0 states have call successors, (0), 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 1597 states. [2022-02-20 19:40:30,741 INFO L87 Difference]: Start difference. First operand has 1595 states, 1593 states have (on average 1.628374136848713) internal successors, (2594), 1594 states have internal predecessors, (2594), 0 states have call successors, (0), 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 1597 states. [2022-02-20 19:40:30,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:30,817 INFO L93 Difference]: Finished difference Result 1597 states and 2595 transitions. [2022-02-20 19:40:30,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2595 transitions. [2022-02-20 19:40:30,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:30,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:30,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:30,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:30,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1593 states have (on average 1.628374136848713) internal successors, (2594), 1594 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have 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:40:30,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 2594 transitions. [2022-02-20 19:40:30,901 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 2594 transitions. Word has length 41 [2022-02-20 19:40:30,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:30,902 INFO L470 AbstractCegarLoop]: Abstraction has 1595 states and 2594 transitions. [2022-02-20 19:40:30,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:30,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2594 transitions. [2022-02-20 19:40:30,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:40:30,903 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:30,903 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:30,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:40:30,904 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:30,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:30,904 INFO L85 PathProgramCache]: Analyzing trace with hash -360939040, now seen corresponding path program 1 times [2022-02-20 19:40:30,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:30,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596448589] [2022-02-20 19:40:30,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:30,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:30,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {21981#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;~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; {21981#true} is VALID [2022-02-20 19:40:30,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {21981#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {21981#true} is VALID [2022-02-20 19:40:30,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {21981#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {21981#true} is VALID [2022-02-20 19:40:30,965 INFO L290 TraceCheckUtils]: 3: Hoare triple {21981#true} assume 0 == ~r1~0 % 256; {21981#true} is VALID [2022-02-20 19:40:30,965 INFO L290 TraceCheckUtils]: 4: Hoare triple {21981#true} assume ~id1~0 >= 0; {21981#true} is VALID [2022-02-20 19:40:30,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {21981#true} assume 0 == ~st1~0; {21981#true} is VALID [2022-02-20 19:40:30,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {21981#true} assume ~send1~0 == ~id1~0; {21981#true} is VALID [2022-02-20 19:40:30,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {21981#true} assume 0 == ~mode1~0 % 256; {21981#true} is VALID [2022-02-20 19:40:30,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {21981#true} assume ~id2~0 >= 0; {21981#true} is VALID [2022-02-20 19:40:30,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {21981#true} assume 0 == ~st2~0; {21981#true} is VALID [2022-02-20 19:40:30,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {21981#true} assume ~send2~0 == ~id2~0; {21981#true} is VALID [2022-02-20 19:40:30,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {21981#true} assume 0 == ~mode2~0 % 256; {21981#true} is VALID [2022-02-20 19:40:30,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {21981#true} assume ~id3~0 >= 0; {21981#true} is VALID [2022-02-20 19:40:30,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {21981#true} assume 0 == ~st3~0; {21981#true} is VALID [2022-02-20 19:40:30,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {21981#true} assume ~send3~0 == ~id3~0; {21981#true} is VALID [2022-02-20 19:40:30,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {21981#true} assume 0 == ~mode3~0 % 256; {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:30,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:30,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:30,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:30,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:30,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:30,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:30,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:30,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;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; {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:30,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:30,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:30,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {21983#(= (+ (* (- 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; {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:30,972 INFO L290 TraceCheckUtils]: 27: Hoare triple {21983#(= (+ (* (- 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; {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:30,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:30,973 INFO L290 TraceCheckUtils]: 29: Hoare triple {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:30,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {21983#(= (+ (* (- 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; {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:30,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {21983#(= (+ (* (- 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; {21983#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:30,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {21983#(= (+ (* (- 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; {21982#false} is VALID [2022-02-20 19:40:30,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {21982#false} assume !(node3_~m3~0#1 != ~nomsg~0); {21982#false} is VALID [2022-02-20 19:40:30,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {21982#false} ~mode3~0 := 0; {21982#false} is VALID [2022-02-20 19:40:30,974 INFO L290 TraceCheckUtils]: 35: Hoare triple {21982#false} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {21982#false} is VALID [2022-02-20 19:40:30,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {21982#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {21982#false} is VALID [2022-02-20 19:40:30,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {21982#false} check_#res#1 := check_~tmp~1#1; {21982#false} is VALID [2022-02-20 19:40:30,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {21982#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {21982#false} is VALID [2022-02-20 19:40:30,975 INFO L290 TraceCheckUtils]: 39: Hoare triple {21982#false} assume 0 == assert_~arg#1 % 256; {21982#false} is VALID [2022-02-20 19:40:30,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {21982#false} assume !false; {21982#false} is VALID [2022-02-20 19:40:30,975 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:40:30,976 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:30,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596448589] [2022-02-20 19:40:30,976 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596448589] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:30,976 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:30,976 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:30,976 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334652360] [2022-02-20 19:40:30,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:30,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:40:30,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:30,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:30,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:30,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:30,999 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:30,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:30,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:30,999 INFO L87 Difference]: Start difference. First operand 1595 states and 2594 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:32,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:32,627 INFO L93 Difference]: Finished difference Result 1719 states and 2786 transitions. [2022-02-20 19:40:32,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:32,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:40:32,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:32,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2022-02-20 19:40:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:32,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1628 transitions. [2022-02-20 19:40:32,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1628 transitions. [2022-02-20 19:40:33,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1628 edges. 1628 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:34,024 INFO L225 Difference]: With dead ends: 1719 [2022-02-20 19:40:34,025 INFO L226 Difference]: Without dead ends: 1651 [2022-02-20 19:40:34,025 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:40:34,026 INFO L933 BasicCegarLoop]: 1544 mSDtfsCounter, 1480 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1609 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:40:34,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1480 Valid, 1609 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:34,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2022-02-20 19:40:34,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1649. [2022-02-20 19:40:34,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:34,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1651 states. Second operand has 1649 states, 1647 states have (on average 1.6253794778384942) internal successors, (2677), 1648 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have 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:40:34,069 INFO L74 IsIncluded]: Start isIncluded. First operand 1651 states. Second operand has 1649 states, 1647 states have (on average 1.6253794778384942) internal successors, (2677), 1648 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have 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:40:34,070 INFO L87 Difference]: Start difference. First operand 1651 states. Second operand has 1649 states, 1647 states have (on average 1.6253794778384942) internal successors, (2677), 1648 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have 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:40:34,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:34,153 INFO L93 Difference]: Finished difference Result 1651 states and 2678 transitions. [2022-02-20 19:40:34,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2678 transitions. [2022-02-20 19:40:34,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:34,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:34,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 1649 states, 1647 states have (on average 1.6253794778384942) internal successors, (2677), 1648 states have internal predecessors, (2677), 0 states have call successors, (0), 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 1651 states. [2022-02-20 19:40:34,158 INFO L87 Difference]: Start difference. First operand has 1649 states, 1647 states have (on average 1.6253794778384942) internal successors, (2677), 1648 states have internal predecessors, (2677), 0 states have call successors, (0), 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 1651 states. [2022-02-20 19:40:34,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:34,243 INFO L93 Difference]: Finished difference Result 1651 states and 2678 transitions. [2022-02-20 19:40:34,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2678 transitions. [2022-02-20 19:40:34,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:34,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:34,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:34,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:34,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1647 states have (on average 1.6253794778384942) internal successors, (2677), 1648 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have 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:40:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2677 transitions. [2022-02-20 19:40:34,332 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2677 transitions. Word has length 41 [2022-02-20 19:40:34,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:34,332 INFO L470 AbstractCegarLoop]: Abstraction has 1649 states and 2677 transitions. [2022-02-20 19:40:34,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:34,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2677 transitions. [2022-02-20 19:40:34,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:40:34,333 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:34,333 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:34,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:40:34,333 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:34,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:34,334 INFO L85 PathProgramCache]: Analyzing trace with hash 857046358, now seen corresponding path program 1 times [2022-02-20 19:40:34,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:34,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007319531] [2022-02-20 19:40:34,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:34,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:34,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {28738#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;~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; {28738#true} is VALID [2022-02-20 19:40:34,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {28738#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {28738#true} is VALID [2022-02-20 19:40:34,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {28738#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {28738#true} is VALID [2022-02-20 19:40:34,398 INFO L290 TraceCheckUtils]: 3: Hoare triple {28738#true} assume 0 == ~r1~0 % 256; {28738#true} is VALID [2022-02-20 19:40:34,398 INFO L290 TraceCheckUtils]: 4: Hoare triple {28738#true} assume ~id1~0 >= 0; {28738#true} is VALID [2022-02-20 19:40:34,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {28738#true} assume 0 == ~st1~0; {28740#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:34,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {28740#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {28740#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:34,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {28740#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {28740#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:34,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {28740#(<= ~st1~0 0)} assume ~id2~0 >= 0; {28740#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:34,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {28740#(<= ~st1~0 0)} assume 0 == ~st2~0; {28741#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {28741#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {28741#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {28741#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {28741#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {28741#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {28741#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {28741#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;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; {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {28742#(<= (+ ~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; {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,405 INFO L290 TraceCheckUtils]: 27: Hoare triple {28742#(<= (+ ~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; {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,405 INFO L290 TraceCheckUtils]: 28: Hoare triple {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {28742#(<= (+ ~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; {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {28742#(<= (+ ~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; {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,406 INFO L290 TraceCheckUtils]: 32: Hoare triple {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,407 INFO L290 TraceCheckUtils]: 33: Hoare triple {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,407 INFO L290 TraceCheckUtils]: 34: Hoare triple {28742#(<= (+ ~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; {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,407 INFO L290 TraceCheckUtils]: 35: Hoare triple {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:34,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {28742#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {28739#false} is VALID [2022-02-20 19:40:34,408 INFO L290 TraceCheckUtils]: 37: Hoare triple {28739#false} check_#res#1 := check_~tmp~1#1; {28739#false} is VALID [2022-02-20 19:40:34,408 INFO L290 TraceCheckUtils]: 38: Hoare triple {28739#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {28739#false} is VALID [2022-02-20 19:40:34,408 INFO L290 TraceCheckUtils]: 39: Hoare triple {28739#false} assume 0 == assert_~arg#1 % 256; {28739#false} is VALID [2022-02-20 19:40:34,408 INFO L290 TraceCheckUtils]: 40: Hoare triple {28739#false} assume !false; {28739#false} is VALID [2022-02-20 19:40:34,409 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:40:34,409 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:34,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007319531] [2022-02-20 19:40:34,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007319531] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:34,409 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:34,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:34,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571881697] [2022-02-20 19:40:34,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:34,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:40:34,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:34,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:34,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:34,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:34,434 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:34,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:34,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:34,435 INFO L87 Difference]: Start difference. First operand 1649 states and 2677 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:36,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:36,843 INFO L93 Difference]: Finished difference Result 2381 states and 3811 transitions. [2022-02-20 19:40:36,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:40:36,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:40:36,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:36,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1874 transitions. [2022-02-20 19:40:36,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:36,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1874 transitions. [2022-02-20 19:40:36,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1874 transitions. [2022-02-20 19:40:38,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1874 edges. 1874 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:38,448 INFO L225 Difference]: With dead ends: 2381 [2022-02-20 19:40:38,448 INFO L226 Difference]: Without dead ends: 2259 [2022-02-20 19:40:38,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:40:38,450 INFO L933 BasicCegarLoop]: 1516 mSDtfsCounter, 4693 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4693 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:38,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4693 Valid, 1934 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:38,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2022-02-20 19:40:38,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1769. [2022-02-20 19:40:38,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:38,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2259 states. Second operand has 1769 states, 1767 states have (on average 1.6168647425014149) internal successors, (2857), 1768 states have internal predecessors, (2857), 0 states have call successors, (0), 0 states have 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:40:38,556 INFO L74 IsIncluded]: Start isIncluded. First operand 2259 states. Second operand has 1769 states, 1767 states have (on average 1.6168647425014149) internal successors, (2857), 1768 states have internal predecessors, (2857), 0 states have call successors, (0), 0 states have 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:40:38,557 INFO L87 Difference]: Start difference. First operand 2259 states. Second operand has 1769 states, 1767 states have (on average 1.6168647425014149) internal successors, (2857), 1768 states have internal predecessors, (2857), 0 states have call successors, (0), 0 states have 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:40:38,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:38,692 INFO L93 Difference]: Finished difference Result 2259 states and 3598 transitions. [2022-02-20 19:40:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 3598 transitions. [2022-02-20 19:40:38,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:38,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:38,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 1769 states, 1767 states have (on average 1.6168647425014149) internal successors, (2857), 1768 states have internal predecessors, (2857), 0 states have call successors, (0), 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 2259 states. [2022-02-20 19:40:38,698 INFO L87 Difference]: Start difference. First operand has 1769 states, 1767 states have (on average 1.6168647425014149) internal successors, (2857), 1768 states have internal predecessors, (2857), 0 states have call successors, (0), 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 2259 states. [2022-02-20 19:40:38,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:38,838 INFO L93 Difference]: Finished difference Result 2259 states and 3598 transitions. [2022-02-20 19:40:38,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 3598 transitions. [2022-02-20 19:40:38,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:38,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:38,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:38,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:38,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1767 states have (on average 1.6168647425014149) internal successors, (2857), 1768 states have internal predecessors, (2857), 0 states have call successors, (0), 0 states have 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:40:38,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2857 transitions. [2022-02-20 19:40:38,943 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2857 transitions. Word has length 41 [2022-02-20 19:40:38,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:38,944 INFO L470 AbstractCegarLoop]: Abstraction has 1769 states and 2857 transitions. [2022-02-20 19:40:38,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:38,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2857 transitions. [2022-02-20 19:40:38,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:40:38,945 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:38,945 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:38,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:40:38,945 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:38,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:38,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1867096070, now seen corresponding path program 1 times [2022-02-20 19:40:38,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:38,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364706727] [2022-02-20 19:40:38,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:38,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:39,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {37658#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;~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; {37658#true} is VALID [2022-02-20 19:40:39,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {37658#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {37658#true} is VALID [2022-02-20 19:40:39,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {37658#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {37658#true} is VALID [2022-02-20 19:40:39,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {37658#true} assume 0 == ~r1~0 % 256; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,010 INFO L290 TraceCheckUtils]: 4: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,015 INFO L290 TraceCheckUtils]: 21: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;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; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,017 INFO L290 TraceCheckUtils]: 28: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,019 INFO L290 TraceCheckUtils]: 35: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:39,020 INFO L290 TraceCheckUtils]: 37: Hoare triple {37660#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 3; {37659#false} is VALID [2022-02-20 19:40:39,020 INFO L290 TraceCheckUtils]: 38: Hoare triple {37659#false} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {37659#false} is VALID [2022-02-20 19:40:39,020 INFO L290 TraceCheckUtils]: 39: Hoare triple {37659#false} check_#res#1 := check_~tmp~1#1; {37659#false} is VALID [2022-02-20 19:40:39,020 INFO L290 TraceCheckUtils]: 40: Hoare triple {37659#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {37659#false} is VALID [2022-02-20 19:40:39,020 INFO L290 TraceCheckUtils]: 41: Hoare triple {37659#false} assume 0 == assert_~arg#1 % 256; {37659#false} is VALID [2022-02-20 19:40:39,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {37659#false} assume !false; {37659#false} is VALID [2022-02-20 19:40:39,020 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:40:39,021 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:39,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364706727] [2022-02-20 19:40:39,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364706727] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:39,021 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:39,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:39,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678890049] [2022-02-20 19:40:39,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:39,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:40:39,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:39,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:39,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:39,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:39,046 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:39,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:39,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:39,047 INFO L87 Difference]: Start difference. First operand 1769 states and 2857 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:40,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:40,622 INFO L93 Difference]: Finished difference Result 2209 states and 3519 transitions. [2022-02-20 19:40:40,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:40,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:40:40,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:40,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:40,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1629 transitions. [2022-02-20 19:40:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:40,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1629 transitions. [2022-02-20 19:40:40,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1629 transitions. [2022-02-20 19:40:41,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1629 edges. 1629 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:42,055 INFO L225 Difference]: With dead ends: 2209 [2022-02-20 19:40:42,055 INFO L226 Difference]: Without dead ends: 1967 [2022-02-20 19:40:42,056 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:40:42,057 INFO L933 BasicCegarLoop]: 1517 mSDtfsCounter, 1471 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:42,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1471 Valid, 1569 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2022-02-20 19:40:42,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1957. [2022-02-20 19:40:42,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:42,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1967 states. Second operand has 1957 states, 1955 states have (on average 1.5964194373401535) internal successors, (3121), 1956 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have 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:40:42,269 INFO L74 IsIncluded]: Start isIncluded. First operand 1967 states. Second operand has 1957 states, 1955 states have (on average 1.5964194373401535) internal successors, (3121), 1956 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have 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:40:42,271 INFO L87 Difference]: Start difference. First operand 1967 states. Second operand has 1957 states, 1955 states have (on average 1.5964194373401535) internal successors, (3121), 1956 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have 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:40:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:42,376 INFO L93 Difference]: Finished difference Result 1967 states and 3130 transitions. [2022-02-20 19:40:42,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3130 transitions. [2022-02-20 19:40:42,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:42,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:42,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 1957 states, 1955 states have (on average 1.5964194373401535) internal successors, (3121), 1956 states have internal predecessors, (3121), 0 states have call successors, (0), 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 1967 states. [2022-02-20 19:40:42,382 INFO L87 Difference]: Start difference. First operand has 1957 states, 1955 states have (on average 1.5964194373401535) internal successors, (3121), 1956 states have internal predecessors, (3121), 0 states have call successors, (0), 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 1967 states. [2022-02-20 19:40:42,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:42,495 INFO L93 Difference]: Finished difference Result 1967 states and 3130 transitions. [2022-02-20 19:40:42,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3130 transitions. [2022-02-20 19:40:42,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:42,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:42,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:42,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1957 states, 1955 states have (on average 1.5964194373401535) internal successors, (3121), 1956 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have 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:40:42,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3121 transitions. [2022-02-20 19:40:42,621 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3121 transitions. Word has length 43 [2022-02-20 19:40:42,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:42,621 INFO L470 AbstractCegarLoop]: Abstraction has 1957 states and 3121 transitions. [2022-02-20 19:40:42,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:42,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3121 transitions. [2022-02-20 19:40:42,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:40:42,623 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:42,623 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:42,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:40:42,624 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:42,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:42,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1933589582, now seen corresponding path program 1 times [2022-02-20 19:40:42,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:42,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025462703] [2022-02-20 19:40:42,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:42,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:42,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {46017#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;~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; {46017#true} is VALID [2022-02-20 19:40:42,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {46017#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {46017#true} is VALID [2022-02-20 19:40:42,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {46017#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {46017#true} is VALID [2022-02-20 19:40:42,757 INFO L290 TraceCheckUtils]: 3: Hoare triple {46017#true} assume 0 == ~r1~0 % 256; {46017#true} is VALID [2022-02-20 19:40:42,757 INFO L290 TraceCheckUtils]: 4: Hoare triple {46017#true} assume ~id1~0 >= 0; {46017#true} is VALID [2022-02-20 19:40:42,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {46017#true} assume 0 == ~st1~0; {46019#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:42,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {46019#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send1~0 == ~id1~0; {46019#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:42,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {46019#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode1~0 % 256; {46019#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:42,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {46019#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id2~0 >= 0; {46019#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:42,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {46019#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st2~0; {46020#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:42,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {46020#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {46020#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:42,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {46020#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {46020#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:42,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {46020#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {46020#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:42,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {46020#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 == ~id3~0; {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode3~0 % 256; {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} init_#res#1 := init_~tmp~0#1; {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == assume_abort_if_not_~cond#1); {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !false;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; {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode1~0 % 256); {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode2~0 % 256); {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,779 INFO L290 TraceCheckUtils]: 29: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,779 INFO L290 TraceCheckUtils]: 30: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode3~0 % 256); {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,781 INFO L290 TraceCheckUtils]: 34: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,781 INFO L290 TraceCheckUtils]: 35: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,781 INFO L290 TraceCheckUtils]: 36: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,782 INFO L290 TraceCheckUtils]: 37: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 % 256 >= 3); {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:42,782 INFO L290 TraceCheckUtils]: 38: Hoare triple {46021#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {46018#false} is VALID [2022-02-20 19:40:42,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {46018#false} check_#res#1 := check_~tmp~1#1; {46018#false} is VALID [2022-02-20 19:40:42,782 INFO L290 TraceCheckUtils]: 40: Hoare triple {46018#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {46018#false} is VALID [2022-02-20 19:40:42,783 INFO L290 TraceCheckUtils]: 41: Hoare triple {46018#false} assume 0 == assert_~arg#1 % 256; {46018#false} is VALID [2022-02-20 19:40:42,783 INFO L290 TraceCheckUtils]: 42: Hoare triple {46018#false} assume !false; {46018#false} is VALID [2022-02-20 19:40:42,783 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:40:42,783 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:42,783 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025462703] [2022-02-20 19:40:42,783 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025462703] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:42,783 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:42,783 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:42,783 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153116794] [2022-02-20 19:40:42,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:42,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:40:42,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:42,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:42,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:42,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:42,817 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:42,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:42,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:42,818 INFO L87 Difference]: Start difference. First operand 1957 states and 3121 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:45,482 INFO L93 Difference]: Finished difference Result 2389 states and 3755 transitions. [2022-02-20 19:40:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:40:45,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 19:40:45,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:45,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1636 transitions. [2022-02-20 19:40:45,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1636 transitions. [2022-02-20 19:40:45,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1636 transitions. [2022-02-20 19:40:46,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1636 edges. 1636 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:46,921 INFO L225 Difference]: With dead ends: 2389 [2022-02-20 19:40:46,921 INFO L226 Difference]: Without dead ends: 1959 [2022-02-20 19:40:46,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:40:46,923 INFO L933 BasicCegarLoop]: 1515 mSDtfsCounter, 3008 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3008 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:46,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3008 Valid, 1625 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:46,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2022-02-20 19:40:47,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1957. [2022-02-20 19:40:47,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:47,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1959 states. Second operand has 1957 states, 1955 states have (on average 1.5923273657289003) internal successors, (3113), 1956 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have 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:40:47,147 INFO L74 IsIncluded]: Start isIncluded. First operand 1959 states. Second operand has 1957 states, 1955 states have (on average 1.5923273657289003) internal successors, (3113), 1956 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have 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:40:47,149 INFO L87 Difference]: Start difference. First operand 1959 states. Second operand has 1957 states, 1955 states have (on average 1.5923273657289003) internal successors, (3113), 1956 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have 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:40:47,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:47,248 INFO L93 Difference]: Finished difference Result 1959 states and 3114 transitions. [2022-02-20 19:40:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 3114 transitions. [2022-02-20 19:40:47,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:47,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:47,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 1957 states, 1955 states have (on average 1.5923273657289003) internal successors, (3113), 1956 states have internal predecessors, (3113), 0 states have call successors, (0), 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 1959 states. [2022-02-20 19:40:47,281 INFO L87 Difference]: Start difference. First operand has 1957 states, 1955 states have (on average 1.5923273657289003) internal successors, (3113), 1956 states have internal predecessors, (3113), 0 states have call successors, (0), 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 1959 states. [2022-02-20 19:40:47,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:47,386 INFO L93 Difference]: Finished difference Result 1959 states and 3114 transitions. [2022-02-20 19:40:47,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 3114 transitions. [2022-02-20 19:40:47,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:47,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:47,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:47,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1957 states, 1955 states have (on average 1.5923273657289003) internal successors, (3113), 1956 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have 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:40:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3113 transitions. [2022-02-20 19:40:47,500 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3113 transitions. Word has length 43 [2022-02-20 19:40:47,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:47,501 INFO L470 AbstractCegarLoop]: Abstraction has 1957 states and 3113 transitions. [2022-02-20 19:40:47,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:47,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3113 transitions. [2022-02-20 19:40:47,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 19:40:47,501 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:47,501 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:47,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:40:47,502 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:47,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:47,503 INFO L85 PathProgramCache]: Analyzing trace with hash -602988295, now seen corresponding path program 1 times [2022-02-20 19:40:47,503 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:47,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747455632] [2022-02-20 19:40:47,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:47,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:47,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {54588#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;~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; {54588#true} is VALID [2022-02-20 19:40:47,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {54588#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {54588#true} is VALID [2022-02-20 19:40:47,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {54588#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {54588#true} is VALID [2022-02-20 19:40:47,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {54588#true} assume 0 == ~r1~0 % 256; {54588#true} is VALID [2022-02-20 19:40:47,576 INFO L290 TraceCheckUtils]: 4: Hoare triple {54588#true} assume ~id1~0 >= 0; {54588#true} is VALID [2022-02-20 19:40:47,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {54588#true} assume 0 == ~st1~0; {54588#true} is VALID [2022-02-20 19:40:47,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {54588#true} assume ~send1~0 == ~id1~0; {54588#true} is VALID [2022-02-20 19:40:47,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {54588#true} assume 0 == ~mode1~0 % 256; {54588#true} is VALID [2022-02-20 19:40:47,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {54588#true} assume ~id2~0 >= 0; {54588#true} is VALID [2022-02-20 19:40:47,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {54588#true} assume 0 == ~st2~0; {54588#true} is VALID [2022-02-20 19:40:47,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {54588#true} assume ~send2~0 == ~id2~0; {54588#true} is VALID [2022-02-20 19:40:47,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {54588#true} assume 0 == ~mode2~0 % 256; {54588#true} is VALID [2022-02-20 19:40:47,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {54588#true} assume ~id3~0 >= 0; {54588#true} is VALID [2022-02-20 19:40:47,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {54588#true} assume 0 == ~st3~0; {54588#true} is VALID [2022-02-20 19:40:47,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {54588#true} assume ~send3~0 == ~id3~0; {54588#true} is VALID [2022-02-20 19:40:47,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {54588#true} assume 0 == ~mode3~0 % 256; {54588#true} is VALID [2022-02-20 19:40:47,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {54588#true} assume ~id1~0 != ~id2~0; {54588#true} is VALID [2022-02-20 19:40:47,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {54588#true} assume ~id1~0 != ~id3~0; {54588#true} is VALID [2022-02-20 19:40:47,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {54588#true} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {54590#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 19:40:47,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {54590#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {54591#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 19:40:47,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {54591#(= |ULTIMATE.start_init_#res#1| 1)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {54592#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} is VALID [2022-02-20 19:40:47,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {54592#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} assume !(0 == assume_abort_if_not_~cond#1); {54588#true} is VALID [2022-02-20 19:40:47,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {54588#true} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {54588#true} is VALID [2022-02-20 19:40:47,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {54588#true} assume !false;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; {54588#true} is VALID [2022-02-20 19:40:47,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {54588#true} assume !(0 != ~mode1~0 % 256); {54588#true} is VALID [2022-02-20 19:40:47,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {54588#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {54588#true} is VALID [2022-02-20 19:40:47,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {54588#true} ~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; {54588#true} is VALID [2022-02-20 19:40:47,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {54588#true} 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; {54588#true} is VALID [2022-02-20 19:40:47,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {54588#true} assume !(0 != ~mode2~0 % 256); {54588#true} is VALID [2022-02-20 19:40:47,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {54588#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {54588#true} is VALID [2022-02-20 19:40:47,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {54588#true} ~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; {54588#true} is VALID [2022-02-20 19:40:47,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {54588#true} 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; {54588#true} is VALID [2022-02-20 19:40:47,579 INFO L290 TraceCheckUtils]: 32: Hoare triple {54588#true} assume !(0 != ~mode3~0 % 256); {54588#true} is VALID [2022-02-20 19:40:47,579 INFO L290 TraceCheckUtils]: 33: Hoare triple {54588#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {54588#true} is VALID [2022-02-20 19:40:47,579 INFO L290 TraceCheckUtils]: 34: Hoare triple {54588#true} ~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; {54588#true} is VALID [2022-02-20 19:40:47,580 INFO L290 TraceCheckUtils]: 35: Hoare triple {54588#true} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {54588#true} is VALID [2022-02-20 19:40:47,580 INFO L290 TraceCheckUtils]: 36: Hoare triple {54588#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {54588#true} is VALID [2022-02-20 19:40:47,580 INFO L290 TraceCheckUtils]: 37: Hoare triple {54588#true} assume !(~r1~0 % 256 >= 3); {54588#true} is VALID [2022-02-20 19:40:47,580 INFO L290 TraceCheckUtils]: 38: Hoare triple {54588#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {54588#true} is VALID [2022-02-20 19:40:47,580 INFO L290 TraceCheckUtils]: 39: Hoare triple {54588#true} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {54593#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 19:40:47,580 INFO L290 TraceCheckUtils]: 40: Hoare triple {54593#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {54594#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 19:40:47,581 INFO L290 TraceCheckUtils]: 41: Hoare triple {54594#(not (= 0 |ULTIMATE.start_check_#res#1|))} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {54595#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 19:40:47,581 INFO L290 TraceCheckUtils]: 42: Hoare triple {54595#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {54589#false} is VALID [2022-02-20 19:40:47,581 INFO L290 TraceCheckUtils]: 43: Hoare triple {54589#false} assume !false; {54589#false} is VALID [2022-02-20 19:40:47,581 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:40:47,582 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:47,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747455632] [2022-02-20 19:40:47,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747455632] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:47,582 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:47,582 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:40:47,582 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7642421] [2022-02-20 19:40:47,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:47,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-02-20 19:40:47,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:47,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:47,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:47,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:40:47,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:47,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:40:47,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:40:47,615 INFO L87 Difference]: Start difference. First operand 1957 states and 3113 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:54,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:54,542 INFO L93 Difference]: Finished difference Result 2291 states and 3585 transitions. [2022-02-20 19:40:54,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:40:54,543 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-02-20 19:40:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:54,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1583 transitions. [2022-02-20 19:40:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1583 transitions. [2022-02-20 19:40:54,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1583 transitions. [2022-02-20 19:40:55,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1583 edges. 1583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:55,820 INFO L225 Difference]: With dead ends: 2291 [2022-02-20 19:40:55,820 INFO L226 Difference]: Without dead ends: 2289 [2022-02-20 19:40:55,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:40:55,821 INFO L933 BasicCegarLoop]: 1552 mSDtfsCounter, 396 mSDsluCounter, 8921 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 10473 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:55,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 10473 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:55,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2022-02-20 19:40:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1981. [2022-02-20 19:40:56,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:56,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2289 states. Second operand has 1981 states, 1979 states have (on average 1.583122789287519) internal successors, (3133), 1980 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have 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:40:56,177 INFO L74 IsIncluded]: Start isIncluded. First operand 2289 states. Second operand has 1981 states, 1979 states have (on average 1.583122789287519) internal successors, (3133), 1980 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have 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:40:56,178 INFO L87 Difference]: Start difference. First operand 2289 states. Second operand has 1981 states, 1979 states have (on average 1.583122789287519) internal successors, (3133), 1980 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have 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:40:56,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:56,320 INFO L93 Difference]: Finished difference Result 2289 states and 3572 transitions. [2022-02-20 19:40:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states and 3572 transitions. [2022-02-20 19:40:56,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:56,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:56,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 1981 states, 1979 states have (on average 1.583122789287519) internal successors, (3133), 1980 states have internal predecessors, (3133), 0 states have call successors, (0), 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 2289 states. [2022-02-20 19:40:56,325 INFO L87 Difference]: Start difference. First operand has 1981 states, 1979 states have (on average 1.583122789287519) internal successors, (3133), 1980 states have internal predecessors, (3133), 0 states have call successors, (0), 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 2289 states. [2022-02-20 19:40:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:56,468 INFO L93 Difference]: Finished difference Result 2289 states and 3572 transitions. [2022-02-20 19:40:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states and 3572 transitions. [2022-02-20 19:40:56,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:56,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:56,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:56,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1981 states, 1979 states have (on average 1.583122789287519) internal successors, (3133), 1980 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have 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:40:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 3133 transitions. [2022-02-20 19:40:56,589 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 3133 transitions. Word has length 44 [2022-02-20 19:40:56,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:56,590 INFO L470 AbstractCegarLoop]: Abstraction has 1981 states and 3133 transitions. [2022-02-20 19:40:56,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:56,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 3133 transitions. [2022-02-20 19:40:56,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 19:40:56,590 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:56,590 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] [2022-02-20 19:40:56,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:40:56,590 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:56,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:56,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1900121563, now seen corresponding path program 1 times [2022-02-20 19:40:56,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:56,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024637667] [2022-02-20 19:40:56,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:56,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:56,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {63763#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;~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; {63763#true} is VALID [2022-02-20 19:40:56,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {63763#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {63763#true} is VALID [2022-02-20 19:40:56,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {63763#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, 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~ret21#1, main1_#t~ret22#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {63763#true} is VALID [2022-02-20 19:40:56,627 INFO L290 TraceCheckUtils]: 3: Hoare triple {63763#true} assume 0 == ~r1~0 % 256; {63763#true} is VALID [2022-02-20 19:40:56,627 INFO L290 TraceCheckUtils]: 4: Hoare triple {63763#true} assume ~id1~0 >= 0; {63763#true} is VALID [2022-02-20 19:40:56,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {63763#true} assume 0 == ~st1~0; {63763#true} is VALID [2022-02-20 19:40:56,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {63763#true} assume ~send1~0 == ~id1~0; {63763#true} is VALID [2022-02-20 19:40:56,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {63763#true} assume 0 == ~mode1~0 % 256; {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:56,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:56,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:56,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:56,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:56,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:56,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:56,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:56,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:56,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:56,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:56,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:56,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:56,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:56,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:56,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:56,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;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; {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:56,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {63765#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {63764#false} is VALID [2022-02-20 19:40:56,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {63764#false} assume !(255 == ~r1~0 % 256); {63764#false} is VALID [2022-02-20 19:40:56,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {63764#false} ~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {63764#false} is VALID [2022-02-20 19:40:56,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {63764#false} assume node1_~m1~0#1 != ~nomsg~0; {63764#false} is VALID [2022-02-20 19:40:56,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {63764#false} assume !(node1_~m1~0#1 > ~id1~0); {63764#false} is VALID [2022-02-20 19:40:56,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {63764#false} assume node1_~m1~0#1 == ~id1~0;~st1~0 := 1; {63764#false} is VALID [2022-02-20 19:40:56,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {63764#false} ~mode1~0 := 0; {63764#false} is VALID [2022-02-20 19:40:56,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {63764#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; {63764#false} is VALID [2022-02-20 19:40:56,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {63764#false} assume !(0 != ~mode2~0 % 256); {63764#false} is VALID [2022-02-20 19:40:56,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {63764#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {63764#false} is VALID [2022-02-20 19:40:56,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {63764#false} ~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; {63764#false} is VALID [2022-02-20 19:40:56,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {63764#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; {63764#false} is VALID [2022-02-20 19:40:56,643 INFO L290 TraceCheckUtils]: 36: Hoare triple {63764#false} assume !(0 != ~mode3~0 % 256); {63764#false} is VALID [2022-02-20 19:40:56,643 INFO L290 TraceCheckUtils]: 37: Hoare triple {63764#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {63764#false} is VALID [2022-02-20 19:40:56,643 INFO L290 TraceCheckUtils]: 38: Hoare triple {63764#false} ~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; {63764#false} is VALID [2022-02-20 19:40:56,643 INFO L290 TraceCheckUtils]: 39: Hoare triple {63764#false} assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {63764#false} is VALID [2022-02-20 19:40:56,643 INFO L290 TraceCheckUtils]: 40: Hoare triple {63764#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {63764#false} is VALID [2022-02-20 19:40:56,643 INFO L290 TraceCheckUtils]: 41: Hoare triple {63764#false} check_#res#1 := check_~tmp~1#1; {63764#false} is VALID [2022-02-20 19:40:56,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {63764#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {63764#false} is VALID [2022-02-20 19:40:56,644 INFO L290 TraceCheckUtils]: 43: Hoare triple {63764#false} assume 0 == assert_~arg#1 % 256; {63764#false} is VALID [2022-02-20 19:40:56,645 INFO L290 TraceCheckUtils]: 44: Hoare triple {63764#false} assume !false; {63764#false} is VALID [2022-02-20 19:40:56,645 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:40:56,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:56,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024637667] [2022-02-20 19:40:56,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024637667] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:56,645 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:56,645 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:56,646 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676724606] [2022-02-20 19:40:56,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:56,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-02-20 19:40:56,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:56,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:40:56,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:56,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:56,672 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:56,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:56,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:56,672 INFO L87 Difference]: Start difference. First operand 1981 states and 3133 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:40:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:58,781 INFO L93 Difference]: Finished difference Result 2452 states and 3811 transitions. [2022-02-20 19:40:58,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:58,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-02-20 19:40:58,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:58,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:40:58,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1625 transitions. [2022-02-20 19:40:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:40:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1625 transitions. [2022-02-20 19:40:58,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1625 transitions. [2022-02-20 19:41:00,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1625 edges. 1625 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:00,282 INFO L225 Difference]: With dead ends: 2452 [2022-02-20 19:41:00,282 INFO L226 Difference]: Without dead ends: 2185 [2022-02-20 19:41:00,283 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:41:00,283 INFO L933 BasicCegarLoop]: 1558 mSDtfsCounter, 1485 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1615 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:41:00,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1485 Valid, 1615 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:41:00,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-02-20 19:41:00,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2183. [2022-02-20 19:41:00,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:41:00,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2185 states. Second operand has 2183 states, 2181 states have (on average 1.5639614855570838) internal successors, (3411), 2182 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states have 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:00,841 INFO L74 IsIncluded]: Start isIncluded. First operand 2185 states. Second operand has 2183 states, 2181 states have (on average 1.5639614855570838) internal successors, (3411), 2182 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states have 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:00,842 INFO L87 Difference]: Start difference. First operand 2185 states. Second operand has 2183 states, 2181 states have (on average 1.5639614855570838) internal successors, (3411), 2182 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states have 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:00,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:00,967 INFO L93 Difference]: Finished difference Result 2185 states and 3412 transitions. [2022-02-20 19:41:00,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 3412 transitions. [2022-02-20 19:41:00,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:00,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:00,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 2183 states, 2181 states have (on average 1.5639614855570838) internal successors, (3411), 2182 states have internal predecessors, (3411), 0 states have call successors, (0), 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 2185 states. [2022-02-20 19:41:00,973 INFO L87 Difference]: Start difference. First operand has 2183 states, 2181 states have (on average 1.5639614855570838) internal successors, (3411), 2182 states have internal predecessors, (3411), 0 states have call successors, (0), 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 2185 states.