./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label01.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.5_overflow.ufo.UNBOUNDED.pals+Problem12_label01.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 24a2674686e3cd976907355f3a5c851b85884bd28355ffc3fa271cccc21387fd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:45:28,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:45:28,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:45:28,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:45:28,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:45:28,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:45:28,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:45:28,693 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:45:28,695 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:45:28,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:45:28,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:45:28,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:45:28,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:45:28,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:45:28,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:45:28,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:45:28,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:45:28,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:45:28,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:45:28,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:45:28,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:45:28,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:45:28,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:45:28,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:45:28,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:45:28,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:45:28,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:45:28,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:45:28,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:45:28,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:45:28,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:45:28,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:45:28,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:45:28,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:45:28,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:45:28,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:45:28,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:45:28,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:45:28,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:45:28,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:45:28,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:45:28,732 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:45:28,755 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:45:28,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:45:28,756 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:45:28,756 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:45:28,757 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:45:28,757 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:45:28,758 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:45:28,758 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:45:28,758 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:45:28,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:45:28,759 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:45:28,759 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:45:28,759 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:45:28,759 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:45:28,759 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:45:28,760 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:45:28,760 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:45:28,760 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:45:28,760 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:45:28,760 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:45:28,760 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:45:28,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:45:28,761 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:45:28,761 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:45:28,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:45:28,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:45:28,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:45:28,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:45:28,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:45:28,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:45:28,762 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:45:28,762 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:45:28,762 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:45:28,762 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 -> 24a2674686e3cd976907355f3a5c851b85884bd28355ffc3fa271cccc21387fd [2022-02-20 19:45:28,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:45:28,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:45:28,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:45:28,985 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:45:28,986 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:45:28,987 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:45:29,046 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abd66bf28/d1c6aefad74649888225312b872aa3e7/FLAG3130661c4 [2022-02-20 19:45:29,632 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:45:29,632 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:45:29,668 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abd66bf28/d1c6aefad74649888225312b872aa3e7/FLAG3130661c4 [2022-02-20 19:45:30,069 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abd66bf28/d1c6aefad74649888225312b872aa3e7 [2022-02-20 19:45:30,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:45:30,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:45:30,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:45:30,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:45:30,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:45:30,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:45:30" (1/1) ... [2022-02-20 19:45:30,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b66bbc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:30, skipping insertion in model container [2022-02-20 19:45:30,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:45:30" (1/1) ... [2022-02-20 19:45:30,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:45:30,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:45:30,444 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.5_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[11742,11755] [2022-02-20 19:45:30,509 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.5_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[17297,17310] [2022-02-20 19:45:31,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:45:31,036 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:45:31,089 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.5_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[11742,11755] [2022-02-20 19:45:31,095 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.5_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[17297,17310] [2022-02-20 19:45:31,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:45:31,370 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:45:31,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:31 WrapperNode [2022-02-20 19:45:31,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:45:31,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:45:31,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:45:31,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:45:31,377 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:45:31" (1/1) ... [2022-02-20 19:45:31,440 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:45:31" (1/1) ... [2022-02-20 19:45:31,757 INFO L137 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5086 [2022-02-20 19:45:31,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:45:31,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:45:31,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:45:31,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:45:31,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:31" (1/1) ... [2022-02-20 19:45:31,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:31" (1/1) ... [2022-02-20 19:45:31,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:31" (1/1) ... [2022-02-20 19:45:31,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:31" (1/1) ... [2022-02-20 19:45:31,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:31" (1/1) ... [2022-02-20 19:45:32,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:31" (1/1) ... [2022-02-20 19:45:32,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:31" (1/1) ... [2022-02-20 19:45:32,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:45:32,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:45:32,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:45:32,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:45:32,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:31" (1/1) ... [2022-02-20 19:45:32,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:45:32,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:45:32,185 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:45:32,191 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:45:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:45:32,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:45:32,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:45:32,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:45:32,325 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:45:32,327 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:45:38,574 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:45:38,584 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:45:38,584 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:45:38,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:45:38 BoogieIcfgContainer [2022-02-20 19:45:38,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:45:38,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:45:38,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:45:38,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:45:38,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:45:30" (1/3) ... [2022-02-20 19:45:38,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9062e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:45:38, skipping insertion in model container [2022-02-20 19:45:38,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:31" (2/3) ... [2022-02-20 19:45:38,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9062e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:45:38, skipping insertion in model container [2022-02-20 19:45:38,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:45:38" (3/3) ... [2022-02-20 19:45:38,592 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:45:38,596 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:45:38,596 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:45:38,629 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:45:38,633 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:45:38,633 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:45:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 909 states, 906 states have (on average 1.900662251655629) internal successors, (1722), 908 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have 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:45:38,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 19:45:38,666 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:38,666 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] [2022-02-20 19:45:38,667 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:38,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:38,670 INFO L85 PathProgramCache]: Analyzing trace with hash -441366565, now seen corresponding path program 1 times [2022-02-20 19:45:38,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:38,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864123248] [2022-02-20 19:45:38,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:38,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:38,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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; {912#true} is VALID [2022-02-20 19:45:38,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {912#true} is VALID [2022-02-20 19:45:38,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#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~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {912#true} is VALID [2022-02-20 19:45:38,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {912#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {912#true} is VALID [2022-02-20 19:45:38,820 INFO L290 TraceCheckUtils]: 4: Hoare triple {912#true} init_#res#1 := init_~tmp~0#1; {912#true} is VALID [2022-02-20 19:45:38,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#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; {912#true} is VALID [2022-02-20 19:45:38,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {912#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {913#false} is VALID [2022-02-20 19:45:38,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {913#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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {913#false} is VALID [2022-02-20 19:45:38,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {913#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; {913#false} is VALID [2022-02-20 19:45:38,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {913#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:38,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {913#false} assume !(node1_~m1~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:45:38,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {913#false} ~mode1~0 := 0; {913#false} is VALID [2022-02-20 19:45:38,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {913#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; {913#false} is VALID [2022-02-20 19:45:38,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {913#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:38,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {913#false} assume !(node2_~m2~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:45:38,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {913#false} ~mode2~0 := 0; {913#false} is VALID [2022-02-20 19:45:38,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {913#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; {913#false} is VALID [2022-02-20 19:45:38,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {913#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:38,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {913#false} assume !(node3_~m3~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:45:38,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {913#false} ~mode3~0 := 0; {913#false} is VALID [2022-02-20 19:45:38,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {913#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:38,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {913#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:38,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !(node4_~m4~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:45:38,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {913#false} ~mode4~0 := 0; {913#false} is VALID [2022-02-20 19:45:38,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {913#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:38,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {913#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:38,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {913#false} assume !(node5_~m5~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:45:38,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {913#false} ~mode5~0 := 0; {913#false} is VALID [2022-02-20 19:45:38,825 INFO L290 TraceCheckUtils]: 28: Hoare triple {913#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {913#false} is VALID [2022-02-20 19:45:38,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {913#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {913#false} is VALID [2022-02-20 19:45:38,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {913#false} check_#res#1 := check_~tmp~1#1; {913#false} is VALID [2022-02-20 19:45:38,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {913#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#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; {913#false} is VALID [2022-02-20 19:45:38,826 INFO L290 TraceCheckUtils]: 32: Hoare triple {913#false} assume 0 == assert_~arg#1 % 256; {913#false} is VALID [2022-02-20 19:45:38,826 INFO L290 TraceCheckUtils]: 33: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-02-20 19:45:38,827 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:45:38,827 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:38,828 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864123248] [2022-02-20 19:45:38,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864123248] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:38,828 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:38,828 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:45:38,830 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960958631] [2022-02-20 19:45:38,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:38,834 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-02-20 19:45:38,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:38,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have 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:45:38,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:38,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:45:38,879 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:38,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:45:38,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:45:38,901 INFO L87 Difference]: Start difference. First operand has 909 states, 906 states have (on average 1.900662251655629) internal successors, (1722), 908 states have internal predecessors, (1722), 0 states have call successors, (0), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have 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:45:40,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:40,143 INFO L93 Difference]: Finished difference Result 1779 states and 3372 transitions. [2022-02-20 19:45:40,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:45:40,144 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-02-20 19:45:40,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:40,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have 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:45:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3372 transitions. [2022-02-20 19:45:40,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have 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:45:40,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3372 transitions. [2022-02-20 19:45:40,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3372 transitions. [2022-02-20 19:45:42,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3372 edges. 3372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:42,635 INFO L225 Difference]: With dead ends: 1779 [2022-02-20 19:45:42,636 INFO L226 Difference]: Without dead ends: 843 [2022-02-20 19:45:42,640 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:45:42,642 INFO L933 BasicCegarLoop]: 1653 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, 1653 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:45:42,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:45:42,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-02-20 19:45:42,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2022-02-20 19:45:42,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:42,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have 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:45:42,712 INFO L74 IsIncluded]: Start isIncluded. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have 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:45:42,714 INFO L87 Difference]: Start difference. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have 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:45:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:42,739 INFO L93 Difference]: Finished difference Result 843 states and 1589 transitions. [2022-02-20 19:45:42,739 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1589 transitions. [2022-02-20 19:45:42,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:42,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:42,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 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 843 states. [2022-02-20 19:45:42,752 INFO L87 Difference]: Start difference. First operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 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 843 states. [2022-02-20 19:45:42,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:42,777 INFO L93 Difference]: Finished difference Result 843 states and 1589 transitions. [2022-02-20 19:45:42,777 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1589 transitions. [2022-02-20 19:45:42,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:42,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:42,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:42,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have 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:45:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1589 transitions. [2022-02-20 19:45:42,812 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1589 transitions. Word has length 34 [2022-02-20 19:45:42,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:42,812 INFO L470 AbstractCegarLoop]: Abstraction has 843 states and 1589 transitions. [2022-02-20 19:45:42,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have 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:45:42,813 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1589 transitions. [2022-02-20 19:45:42,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 19:45:42,813 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:42,814 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] [2022-02-20 19:45:42,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:45:42,814 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:42,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:42,817 INFO L85 PathProgramCache]: Analyzing trace with hash -950839655, now seen corresponding path program 1 times [2022-02-20 19:45:42,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:42,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169430662] [2022-02-20 19:45:42,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:42,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:42,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {5268#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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; {5268#true} is VALID [2022-02-20 19:45:42,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {5268#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {5268#true} is VALID [2022-02-20 19:45:42,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {5268#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#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~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5268#true} is VALID [2022-02-20 19:45:42,888 INFO L290 TraceCheckUtils]: 3: Hoare triple {5268#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5270#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:45:42,888 INFO L290 TraceCheckUtils]: 4: Hoare triple {5270#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5271#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:45:42,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {5271#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#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; {5272#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:45:42,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {5272#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5269#false} is VALID [2022-02-20 19:45:42,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {5269#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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5269#false} is VALID [2022-02-20 19:45:42,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {5269#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; {5269#false} is VALID [2022-02-20 19:45:42,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {5269#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:45:42,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {5269#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5269#false} is VALID [2022-02-20 19:45:42,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {5269#false} ~mode1~0 := 0; {5269#false} is VALID [2022-02-20 19:45:42,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {5269#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; {5269#false} is VALID [2022-02-20 19:45:42,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {5269#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:45:42,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {5269#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5269#false} is VALID [2022-02-20 19:45:42,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {5269#false} ~mode2~0 := 0; {5269#false} is VALID [2022-02-20 19:45:42,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {5269#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; {5269#false} is VALID [2022-02-20 19:45:42,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {5269#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:45:42,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {5269#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5269#false} is VALID [2022-02-20 19:45:42,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {5269#false} ~mode3~0 := 0; {5269#false} is VALID [2022-02-20 19:45:42,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {5269#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:45:42,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {5269#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:45:42,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {5269#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5269#false} is VALID [2022-02-20 19:45:42,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {5269#false} ~mode4~0 := 0; {5269#false} is VALID [2022-02-20 19:45:42,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {5269#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:45:42,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {5269#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:45:42,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {5269#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5269#false} is VALID [2022-02-20 19:45:42,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {5269#false} ~mode5~0 := 0; {5269#false} is VALID [2022-02-20 19:45:42,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {5269#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5269#false} is VALID [2022-02-20 19:45:42,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {5269#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {5269#false} is VALID [2022-02-20 19:45:42,893 INFO L290 TraceCheckUtils]: 30: Hoare triple {5269#false} check_#res#1 := check_~tmp~1#1; {5269#false} is VALID [2022-02-20 19:45:42,893 INFO L290 TraceCheckUtils]: 31: Hoare triple {5269#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#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; {5269#false} is VALID [2022-02-20 19:45:42,893 INFO L290 TraceCheckUtils]: 32: Hoare triple {5269#false} assume 0 == assert_~arg#1 % 256; {5269#false} is VALID [2022-02-20 19:45:42,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {5269#false} assume !false; {5269#false} is VALID [2022-02-20 19:45:42,894 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:45:42,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:42,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169430662] [2022-02-20 19:45:42,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169430662] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:42,894 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:42,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:45:42,894 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892768561] [2022-02-20 19:45:42,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:42,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-02-20 19:45:42,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:42,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have 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:45:42,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:42,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:45:42,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:42,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:45:42,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:45:42,917 INFO L87 Difference]: Start difference. First operand 843 states and 1589 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have 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:45:46,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:46,734 INFO L93 Difference]: Finished difference Result 899 states and 1675 transitions. [2022-02-20 19:45:46,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:45:46,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-02-20 19:45:46,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:46,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have 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:45:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1675 transitions. [2022-02-20 19:45:46,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have 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:45:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1675 transitions. [2022-02-20 19:45:46,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1675 transitions. [2022-02-20 19:45:47,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1675 edges. 1675 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:47,956 INFO L225 Difference]: With dead ends: 899 [2022-02-20 19:45:47,956 INFO L226 Difference]: Without dead ends: 843 [2022-02-20 19:45:47,959 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:45:47,962 INFO L933 BasicCegarLoop]: 1587 mSDtfsCounter, 3 mSDsluCounter, 4727 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6314 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:45:47,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6314 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:45:47,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-02-20 19:45:47,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2022-02-20 19:45:47,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:47,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have 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:45:47,980 INFO L74 IsIncluded]: Start isIncluded. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have 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:45:47,983 INFO L87 Difference]: Start difference. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have 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:45:48,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:48,005 INFO L93 Difference]: Finished difference Result 843 states and 1558 transitions. [2022-02-20 19:45:48,006 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1558 transitions. [2022-02-20 19:45:48,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:48,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:48,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 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 843 states. [2022-02-20 19:45:48,010 INFO L87 Difference]: Start difference. First operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 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 843 states. [2022-02-20 19:45:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:48,035 INFO L93 Difference]: Finished difference Result 843 states and 1558 transitions. [2022-02-20 19:45:48,035 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1558 transitions. [2022-02-20 19:45:48,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:48,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:48,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:48,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have 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:45:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1558 transitions. [2022-02-20 19:45:48,107 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1558 transitions. Word has length 34 [2022-02-20 19:45:48,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:48,107 INFO L470 AbstractCegarLoop]: Abstraction has 843 states and 1558 transitions. [2022-02-20 19:45:48,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have 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:45:48,107 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1558 transitions. [2022-02-20 19:45:48,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 19:45:48,110 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:48,110 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:45:48,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:45:48,111 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:48,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:48,114 INFO L85 PathProgramCache]: Analyzing trace with hash 694349877, now seen corresponding path program 1 times [2022-02-20 19:45:48,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:48,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238615499] [2022-02-20 19:45:48,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:48,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:48,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {8744#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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; {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {8746#(<= ~a7~0 13)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {8746#(<= ~a7~0 13)} assume !(0 != main_#t~nondet47#1);havoc main_#t~nondet47#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet45#1, main2_#t~ret46#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,244 INFO L290 TraceCheckUtils]: 3: Hoare triple {8746#(<= ~a7~0 13)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet45#1 && main2_#t~nondet45#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet45#1;havoc main2_#t~nondet45#1; {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,244 INFO L290 TraceCheckUtils]: 4: Hoare triple {8746#(<= ~a7~0 13)} 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~ret42#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {8746#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {8746#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {8746#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {8746#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {8746#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {8746#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {8746#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {8746#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {8746#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {8746#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {8746#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {8746#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {8746#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {8746#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {8746#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {8746#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {8746#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {8746#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {8746#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {8746#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {8746#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {8746#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {8746#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {8746#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {8746#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {8746#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {8746#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {8746#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {8746#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {8746#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {8746#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,258 INFO L290 TraceCheckUtils]: 36: Hoare triple {8746#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,259 INFO L290 TraceCheckUtils]: 37: Hoare triple {8746#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,259 INFO L290 TraceCheckUtils]: 38: Hoare triple {8746#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,260 INFO L290 TraceCheckUtils]: 39: Hoare triple {8746#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,261 INFO L290 TraceCheckUtils]: 40: Hoare triple {8746#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,262 INFO L290 TraceCheckUtils]: 41: Hoare triple {8746#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,262 INFO L290 TraceCheckUtils]: 42: Hoare triple {8746#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,263 INFO L290 TraceCheckUtils]: 43: Hoare triple {8746#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,264 INFO L290 TraceCheckUtils]: 44: Hoare triple {8746#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {8746#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8746#(<= ~a7~0 13)} is VALID [2022-02-20 19:45:48,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {8746#(<= ~a7~0 13)} assume (((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0; {8745#false} is VALID [2022-02-20 19:45:48,273 INFO L290 TraceCheckUtils]: 47: Hoare triple {8745#false} assume !false; {8745#false} is VALID [2022-02-20 19:45:48,273 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:45:48,274 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:48,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238615499] [2022-02-20 19:45:48,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238615499] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:48,274 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:48,275 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:45:48,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690795599] [2022-02-20 19:45:48,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:48,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 19:45:48,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:48,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:45:48,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:48,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:45:48,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:48,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:45:48,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:48,305 INFO L87 Difference]: Start difference. First operand 843 states and 1558 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:45:53,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:53,266 INFO L93 Difference]: Finished difference Result 2347 states and 4431 transitions. [2022-02-20 19:45:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:45:53,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 19:45:53,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:45:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4431 transitions. [2022-02-20 19:45:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:45:53,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4431 transitions. [2022-02-20 19:45:53,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4431 transitions. [2022-02-20 19:45:56,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4431 edges. 4431 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:56,472 INFO L225 Difference]: With dead ends: 2347 [2022-02-20 19:45:56,473 INFO L226 Difference]: Without dead ends: 1594 [2022-02-20 19:45:56,473 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:45:56,474 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 886 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:45:56,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [886 Valid, 196 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-02-20 19:45:56,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2022-02-20 19:45:56,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1594. [2022-02-20 19:45:56,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:56,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1594 states. Second operand has 1594 states, 1592 states have (on average 1.8423366834170853) internal successors, (2933), 1593 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have 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:45:56,506 INFO L74 IsIncluded]: Start isIncluded. First operand 1594 states. Second operand has 1594 states, 1592 states have (on average 1.8423366834170853) internal successors, (2933), 1593 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have 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:45:56,508 INFO L87 Difference]: Start difference. First operand 1594 states. Second operand has 1594 states, 1592 states have (on average 1.8423366834170853) internal successors, (2933), 1593 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have 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:45:56,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:56,581 INFO L93 Difference]: Finished difference Result 1594 states and 2933 transitions. [2022-02-20 19:45:56,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2933 transitions. [2022-02-20 19:45:56,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:56,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:56,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 1594 states, 1592 states have (on average 1.8423366834170853) internal successors, (2933), 1593 states have internal predecessors, (2933), 0 states have call successors, (0), 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 1594 states. [2022-02-20 19:45:56,588 INFO L87 Difference]: Start difference. First operand has 1594 states, 1592 states have (on average 1.8423366834170853) internal successors, (2933), 1593 states have internal predecessors, (2933), 0 states have call successors, (0), 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 1594 states. [2022-02-20 19:45:56,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:56,660 INFO L93 Difference]: Finished difference Result 1594 states and 2933 transitions. [2022-02-20 19:45:56,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2933 transitions. [2022-02-20 19:45:56,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:56,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:56,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:56,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1592 states have (on average 1.8423366834170853) internal successors, (2933), 1593 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have 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:45:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2933 transitions. [2022-02-20 19:45:56,736 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2933 transitions. Word has length 48 [2022-02-20 19:45:56,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:56,738 INFO L470 AbstractCegarLoop]: Abstraction has 1594 states and 2933 transitions. [2022-02-20 19:45:56,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:45:56,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2933 transitions. [2022-02-20 19:45:56,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:45:56,739 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:56,739 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:45:56,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:45:56,740 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:56,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:56,740 INFO L85 PathProgramCache]: Analyzing trace with hash -695028240, now seen corresponding path program 1 times [2022-02-20 19:45:56,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:56,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091623351] [2022-02-20 19:45:56,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:56,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:56,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {15921#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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; {15921#true} is VALID [2022-02-20 19:45:56,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {15921#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {15921#true} is VALID [2022-02-20 19:45:56,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {15921#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#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~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {15921#true} is VALID [2022-02-20 19:45:56,842 INFO L290 TraceCheckUtils]: 3: Hoare triple {15921#true} assume 0 == ~r1~0 % 256; {15921#true} is VALID [2022-02-20 19:45:56,842 INFO L290 TraceCheckUtils]: 4: Hoare triple {15921#true} assume ~id1~0 >= 0; {15921#true} is VALID [2022-02-20 19:45:56,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {15921#true} assume 0 == ~st1~0; {15921#true} is VALID [2022-02-20 19:45:56,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {15921#true} assume ~send1~0 == ~id1~0; {15921#true} is VALID [2022-02-20 19:45:56,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {15921#true} assume 0 == ~mode1~0 % 256; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#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; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {15923#(= (+ (* (- 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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,860 INFO L290 TraceCheckUtils]: 38: Hoare triple {15923#(= (+ (* (- 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; {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:56,861 INFO L290 TraceCheckUtils]: 39: Hoare triple {15923#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {15922#false} is VALID [2022-02-20 19:45:56,861 INFO L290 TraceCheckUtils]: 40: Hoare triple {15922#false} assume !(node1_~m1~0#1 != ~nomsg~0); {15922#false} is VALID [2022-02-20 19:45:56,861 INFO L290 TraceCheckUtils]: 41: Hoare triple {15922#false} ~mode1~0 := 0; {15922#false} is VALID [2022-02-20 19:45:56,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {15922#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; {15922#false} is VALID [2022-02-20 19:45:56,861 INFO L290 TraceCheckUtils]: 43: Hoare triple {15922#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {15922#false} is VALID [2022-02-20 19:45:56,861 INFO L290 TraceCheckUtils]: 44: Hoare triple {15922#false} assume !(node2_~m2~0#1 != ~nomsg~0); {15922#false} is VALID [2022-02-20 19:45:56,861 INFO L290 TraceCheckUtils]: 45: Hoare triple {15922#false} ~mode2~0 := 0; {15922#false} is VALID [2022-02-20 19:45:56,862 INFO L290 TraceCheckUtils]: 46: Hoare triple {15922#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; {15922#false} is VALID [2022-02-20 19:45:56,862 INFO L290 TraceCheckUtils]: 47: Hoare triple {15922#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {15922#false} is VALID [2022-02-20 19:45:56,862 INFO L290 TraceCheckUtils]: 48: Hoare triple {15922#false} assume !(node3_~m3~0#1 != ~nomsg~0); {15922#false} is VALID [2022-02-20 19:45:56,862 INFO L290 TraceCheckUtils]: 49: Hoare triple {15922#false} ~mode3~0 := 0; {15922#false} is VALID [2022-02-20 19:45:56,862 INFO L290 TraceCheckUtils]: 50: Hoare triple {15922#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {15922#false} is VALID [2022-02-20 19:45:56,862 INFO L290 TraceCheckUtils]: 51: Hoare triple {15922#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {15922#false} is VALID [2022-02-20 19:45:56,862 INFO L290 TraceCheckUtils]: 52: Hoare triple {15922#false} assume !(node4_~m4~0#1 != ~nomsg~0); {15922#false} is VALID [2022-02-20 19:45:56,862 INFO L290 TraceCheckUtils]: 53: Hoare triple {15922#false} ~mode4~0 := 0; {15922#false} is VALID [2022-02-20 19:45:56,862 INFO L290 TraceCheckUtils]: 54: Hoare triple {15922#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {15922#false} is VALID [2022-02-20 19:45:56,862 INFO L290 TraceCheckUtils]: 55: Hoare triple {15922#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {15922#false} is VALID [2022-02-20 19:45:56,862 INFO L290 TraceCheckUtils]: 56: Hoare triple {15922#false} assume !(node5_~m5~0#1 != ~nomsg~0); {15922#false} is VALID [2022-02-20 19:45:56,863 INFO L290 TraceCheckUtils]: 57: Hoare triple {15922#false} ~mode5~0 := 0; {15922#false} is VALID [2022-02-20 19:45:56,863 INFO L290 TraceCheckUtils]: 58: Hoare triple {15922#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {15922#false} is VALID [2022-02-20 19:45:56,863 INFO L290 TraceCheckUtils]: 59: Hoare triple {15922#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {15922#false} is VALID [2022-02-20 19:45:56,863 INFO L290 TraceCheckUtils]: 60: Hoare triple {15922#false} check_#res#1 := check_~tmp~1#1; {15922#false} is VALID [2022-02-20 19:45:56,863 INFO L290 TraceCheckUtils]: 61: Hoare triple {15922#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#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; {15922#false} is VALID [2022-02-20 19:45:56,863 INFO L290 TraceCheckUtils]: 62: Hoare triple {15922#false} assume 0 == assert_~arg#1 % 256; {15922#false} is VALID [2022-02-20 19:45:56,863 INFO L290 TraceCheckUtils]: 63: Hoare triple {15922#false} assume !false; {15922#false} is VALID [2022-02-20 19:45:56,863 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:45:56,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:56,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091623351] [2022-02-20 19:45:56,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091623351] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:56,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:56,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:45:56,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410681773] [2022-02-20 19:45:56,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:56,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:45:56,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:56,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:45:56,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:56,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:45:56,902 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:56,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:45:56,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:56,902 INFO L87 Difference]: Start difference. First operand 1594 states and 2933 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:45:58,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:58,631 INFO L93 Difference]: Finished difference Result 1692 states and 3087 transitions. [2022-02-20 19:45:58,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:45:58,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:45:58,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:45:58,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:45:58,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:45:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:45:58,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:45:59,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:00,039 INFO L225 Difference]: With dead ends: 1692 [2022-02-20 19:46:00,039 INFO L226 Difference]: Without dead ends: 1640 [2022-02-20 19:46:00,039 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:46:00,040 INFO L933 BasicCegarLoop]: 1626 mSDtfsCounter, 1511 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1706 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:46:00,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1511 Valid, 1706 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:46:00,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2022-02-20 19:46:00,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1638. [2022-02-20 19:46:00,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:00,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1640 states. Second operand has 1638 states, 1636 states have (on average 1.8355745721271393) internal successors, (3003), 1637 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have 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:46:00,072 INFO L74 IsIncluded]: Start isIncluded. First operand 1640 states. Second operand has 1638 states, 1636 states have (on average 1.8355745721271393) internal successors, (3003), 1637 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have 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:46:00,074 INFO L87 Difference]: Start difference. First operand 1640 states. Second operand has 1638 states, 1636 states have (on average 1.8355745721271393) internal successors, (3003), 1637 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have 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:46:00,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:00,152 INFO L93 Difference]: Finished difference Result 1640 states and 3004 transitions. [2022-02-20 19:46:00,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 3004 transitions. [2022-02-20 19:46:00,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:00,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:00,168 INFO L74 IsIncluded]: Start isIncluded. First operand has 1638 states, 1636 states have (on average 1.8355745721271393) internal successors, (3003), 1637 states have internal predecessors, (3003), 0 states have call successors, (0), 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 1640 states. [2022-02-20 19:46:00,170 INFO L87 Difference]: Start difference. First operand has 1638 states, 1636 states have (on average 1.8355745721271393) internal successors, (3003), 1637 states have internal predecessors, (3003), 0 states have call successors, (0), 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 1640 states. [2022-02-20 19:46:00,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:00,248 INFO L93 Difference]: Finished difference Result 1640 states and 3004 transitions. [2022-02-20 19:46:00,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 3004 transitions. [2022-02-20 19:46:00,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:00,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:00,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:00,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:00,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1636 states have (on average 1.8355745721271393) internal successors, (3003), 1637 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have 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:46:00,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 3003 transitions. [2022-02-20 19:46:00,334 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 3003 transitions. Word has length 64 [2022-02-20 19:46:00,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:00,335 INFO L470 AbstractCegarLoop]: Abstraction has 1638 states and 3003 transitions. [2022-02-20 19:46:00,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 3003 transitions. [2022-02-20 19:46:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:46:00,336 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:00,336 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:46:00,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:46:00,336 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:00,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:00,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1440610970, now seen corresponding path program 1 times [2022-02-20 19:46:00,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:00,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333090966] [2022-02-20 19:46:00,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:00,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:00,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {22598#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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; {22598#true} is VALID [2022-02-20 19:46:00,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {22598#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {22598#true} is VALID [2022-02-20 19:46:00,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {22598#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#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~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {22598#true} is VALID [2022-02-20 19:46:00,378 INFO L290 TraceCheckUtils]: 3: Hoare triple {22598#true} assume 0 == ~r1~0 % 256; {22598#true} is VALID [2022-02-20 19:46:00,378 INFO L290 TraceCheckUtils]: 4: Hoare triple {22598#true} assume ~id1~0 >= 0; {22598#true} is VALID [2022-02-20 19:46:00,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {22598#true} assume 0 == ~st1~0; {22598#true} is VALID [2022-02-20 19:46:00,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {22598#true} assume ~send1~0 == ~id1~0; {22598#true} is VALID [2022-02-20 19:46:00,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {22598#true} assume 0 == ~mode1~0 % 256; {22598#true} is VALID [2022-02-20 19:46:00,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {22598#true} assume ~id2~0 >= 0; {22598#true} is VALID [2022-02-20 19:46:00,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {22598#true} assume 0 == ~st2~0; {22598#true} is VALID [2022-02-20 19:46:00,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {22598#true} assume ~send2~0 == ~id2~0; {22598#true} is VALID [2022-02-20 19:46:00,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {22598#true} assume 0 == ~mode2~0 % 256; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,390 INFO L290 TraceCheckUtils]: 33: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,390 INFO L290 TraceCheckUtils]: 34: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,390 INFO L290 TraceCheckUtils]: 35: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#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; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,391 INFO L290 TraceCheckUtils]: 36: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {22600#(= (+ (* (- 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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {22600#(= (+ (* (- 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; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,392 INFO L290 TraceCheckUtils]: 40: Hoare triple {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,393 INFO L290 TraceCheckUtils]: 41: Hoare triple {22600#(= (+ (* (- 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; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,393 INFO L290 TraceCheckUtils]: 42: Hoare triple {22600#(= (+ (* (- 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; {22600#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:00,394 INFO L290 TraceCheckUtils]: 43: Hoare triple {22600#(= (+ (* (- 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; {22599#false} is VALID [2022-02-20 19:46:00,394 INFO L290 TraceCheckUtils]: 44: Hoare triple {22599#false} assume !(node2_~m2~0#1 != ~nomsg~0); {22599#false} is VALID [2022-02-20 19:46:00,394 INFO L290 TraceCheckUtils]: 45: Hoare triple {22599#false} ~mode2~0 := 0; {22599#false} is VALID [2022-02-20 19:46:00,394 INFO L290 TraceCheckUtils]: 46: Hoare triple {22599#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; {22599#false} is VALID [2022-02-20 19:46:00,394 INFO L290 TraceCheckUtils]: 47: Hoare triple {22599#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {22599#false} is VALID [2022-02-20 19:46:00,394 INFO L290 TraceCheckUtils]: 48: Hoare triple {22599#false} assume !(node3_~m3~0#1 != ~nomsg~0); {22599#false} is VALID [2022-02-20 19:46:00,394 INFO L290 TraceCheckUtils]: 49: Hoare triple {22599#false} ~mode3~0 := 0; {22599#false} is VALID [2022-02-20 19:46:00,395 INFO L290 TraceCheckUtils]: 50: Hoare triple {22599#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {22599#false} is VALID [2022-02-20 19:46:00,395 INFO L290 TraceCheckUtils]: 51: Hoare triple {22599#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {22599#false} is VALID [2022-02-20 19:46:00,395 INFO L290 TraceCheckUtils]: 52: Hoare triple {22599#false} assume !(node4_~m4~0#1 != ~nomsg~0); {22599#false} is VALID [2022-02-20 19:46:00,395 INFO L290 TraceCheckUtils]: 53: Hoare triple {22599#false} ~mode4~0 := 0; {22599#false} is VALID [2022-02-20 19:46:00,395 INFO L290 TraceCheckUtils]: 54: Hoare triple {22599#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {22599#false} is VALID [2022-02-20 19:46:00,395 INFO L290 TraceCheckUtils]: 55: Hoare triple {22599#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {22599#false} is VALID [2022-02-20 19:46:00,395 INFO L290 TraceCheckUtils]: 56: Hoare triple {22599#false} assume !(node5_~m5~0#1 != ~nomsg~0); {22599#false} is VALID [2022-02-20 19:46:00,396 INFO L290 TraceCheckUtils]: 57: Hoare triple {22599#false} ~mode5~0 := 0; {22599#false} is VALID [2022-02-20 19:46:00,396 INFO L290 TraceCheckUtils]: 58: Hoare triple {22599#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {22599#false} is VALID [2022-02-20 19:46:00,396 INFO L290 TraceCheckUtils]: 59: Hoare triple {22599#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {22599#false} is VALID [2022-02-20 19:46:00,396 INFO L290 TraceCheckUtils]: 60: Hoare triple {22599#false} check_#res#1 := check_~tmp~1#1; {22599#false} is VALID [2022-02-20 19:46:00,396 INFO L290 TraceCheckUtils]: 61: Hoare triple {22599#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#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; {22599#false} is VALID [2022-02-20 19:46:00,396 INFO L290 TraceCheckUtils]: 62: Hoare triple {22599#false} assume 0 == assert_~arg#1 % 256; {22599#false} is VALID [2022-02-20 19:46:00,396 INFO L290 TraceCheckUtils]: 63: Hoare triple {22599#false} assume !false; {22599#false} is VALID [2022-02-20 19:46:00,397 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:46:00,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:00,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333090966] [2022-02-20 19:46:00,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333090966] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:00,397 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:00,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:46:00,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373845884] [2022-02-20 19:46:00,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:00,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:00,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:00,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:00,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:00,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:46:00,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:00,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:46:00,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:46:00,436 INFO L87 Difference]: Start difference. First operand 1638 states and 3003 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:02,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:02,083 INFO L93 Difference]: Finished difference Result 1818 states and 3287 transitions. [2022-02-20 19:46:02,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:46:02,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:02,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:46:02,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:02,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:02,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:02,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:46:03,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:03,540 INFO L225 Difference]: With dead ends: 1818 [2022-02-20 19:46:03,540 INFO L226 Difference]: Without dead ends: 1722 [2022-02-20 19:46:03,541 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:46:03,542 INFO L933 BasicCegarLoop]: 1621 mSDtfsCounter, 1507 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1705 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:46:03,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1507 Valid, 1705 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:46:03,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2022-02-20 19:46:03,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1720. [2022-02-20 19:46:03,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:03,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1722 states. Second operand has 1720 states, 1718 states have (on average 1.8230500582072178) internal successors, (3132), 1719 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have 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:46:03,581 INFO L74 IsIncluded]: Start isIncluded. First operand 1722 states. Second operand has 1720 states, 1718 states have (on average 1.8230500582072178) internal successors, (3132), 1719 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have 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:46:03,583 INFO L87 Difference]: Start difference. First operand 1722 states. Second operand has 1720 states, 1718 states have (on average 1.8230500582072178) internal successors, (3132), 1719 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have 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:46:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:03,670 INFO L93 Difference]: Finished difference Result 1722 states and 3133 transitions. [2022-02-20 19:46:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 3133 transitions. [2022-02-20 19:46:03,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:03,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:03,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 1720 states, 1718 states have (on average 1.8230500582072178) internal successors, (3132), 1719 states have internal predecessors, (3132), 0 states have call successors, (0), 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 1722 states. [2022-02-20 19:46:03,676 INFO L87 Difference]: Start difference. First operand has 1720 states, 1718 states have (on average 1.8230500582072178) internal successors, (3132), 1719 states have internal predecessors, (3132), 0 states have call successors, (0), 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 1722 states. [2022-02-20 19:46:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:03,766 INFO L93 Difference]: Finished difference Result 1722 states and 3133 transitions. [2022-02-20 19:46:03,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 3133 transitions. [2022-02-20 19:46:03,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:03,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:03,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:03,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1718 states have (on average 1.8230500582072178) internal successors, (3132), 1719 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have 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:46:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 3132 transitions. [2022-02-20 19:46:03,862 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 3132 transitions. Word has length 64 [2022-02-20 19:46:03,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:03,862 INFO L470 AbstractCegarLoop]: Abstraction has 1720 states and 3132 transitions. [2022-02-20 19:46:03,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:03,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 3132 transitions. [2022-02-20 19:46:03,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:46:03,864 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:03,864 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:46:03,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:46:03,865 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:03,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:03,865 INFO L85 PathProgramCache]: Analyzing trace with hash 914325468, now seen corresponding path program 1 times [2022-02-20 19:46:03,865 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:03,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060994483] [2022-02-20 19:46:03,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:03,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:03,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {29687#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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; {29687#true} is VALID [2022-02-20 19:46:03,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {29687#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {29687#true} is VALID [2022-02-20 19:46:03,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {29687#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#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~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29687#true} is VALID [2022-02-20 19:46:03,929 INFO L290 TraceCheckUtils]: 3: Hoare triple {29687#true} assume 0 == ~r1~0 % 256; {29687#true} is VALID [2022-02-20 19:46:03,929 INFO L290 TraceCheckUtils]: 4: Hoare triple {29687#true} assume ~id1~0 >= 0; {29687#true} is VALID [2022-02-20 19:46:03,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {29687#true} assume 0 == ~st1~0; {29687#true} is VALID [2022-02-20 19:46:03,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {29687#true} assume ~send1~0 == ~id1~0; {29687#true} is VALID [2022-02-20 19:46:03,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {29687#true} assume 0 == ~mode1~0 % 256; {29687#true} is VALID [2022-02-20 19:46:03,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {29687#true} assume ~id2~0 >= 0; {29687#true} is VALID [2022-02-20 19:46:03,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {29687#true} assume 0 == ~st2~0; {29687#true} is VALID [2022-02-20 19:46:03,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {29687#true} assume ~send2~0 == ~id2~0; {29687#true} is VALID [2022-02-20 19:46:03,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {29687#true} assume 0 == ~mode2~0 % 256; {29687#true} is VALID [2022-02-20 19:46:03,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {29687#true} assume ~id3~0 >= 0; {29687#true} is VALID [2022-02-20 19:46:03,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {29687#true} assume 0 == ~st3~0; {29687#true} is VALID [2022-02-20 19:46:03,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {29687#true} assume ~send3~0 == ~id3~0; {29687#true} is VALID [2022-02-20 19:46:03,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {29687#true} assume 0 == ~mode3~0 % 256; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,937 INFO L290 TraceCheckUtils]: 26: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,937 INFO L290 TraceCheckUtils]: 27: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,938 INFO L290 TraceCheckUtils]: 30: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,938 INFO L290 TraceCheckUtils]: 31: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,939 INFO L290 TraceCheckUtils]: 32: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,939 INFO L290 TraceCheckUtils]: 33: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,939 INFO L290 TraceCheckUtils]: 34: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,940 INFO L290 TraceCheckUtils]: 35: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#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; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,940 INFO L290 TraceCheckUtils]: 36: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,940 INFO L290 TraceCheckUtils]: 37: Hoare triple {29689#(= (+ (* (- 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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,941 INFO L290 TraceCheckUtils]: 38: Hoare triple {29689#(= (+ (* (- 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; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,942 INFO L290 TraceCheckUtils]: 39: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,942 INFO L290 TraceCheckUtils]: 40: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,942 INFO L290 TraceCheckUtils]: 41: Hoare triple {29689#(= (+ (* (- 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; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,943 INFO L290 TraceCheckUtils]: 42: Hoare triple {29689#(= (+ (* (- 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; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,943 INFO L290 TraceCheckUtils]: 43: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,943 INFO L290 TraceCheckUtils]: 44: Hoare triple {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,944 INFO L290 TraceCheckUtils]: 45: Hoare triple {29689#(= (+ (* (- 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; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,944 INFO L290 TraceCheckUtils]: 46: Hoare triple {29689#(= (+ (* (- 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; {29689#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:03,945 INFO L290 TraceCheckUtils]: 47: Hoare triple {29689#(= (+ (* (- 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; {29688#false} is VALID [2022-02-20 19:46:03,945 INFO L290 TraceCheckUtils]: 48: Hoare triple {29688#false} assume !(node3_~m3~0#1 != ~nomsg~0); {29688#false} is VALID [2022-02-20 19:46:03,945 INFO L290 TraceCheckUtils]: 49: Hoare triple {29688#false} ~mode3~0 := 0; {29688#false} is VALID [2022-02-20 19:46:03,945 INFO L290 TraceCheckUtils]: 50: Hoare triple {29688#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {29688#false} is VALID [2022-02-20 19:46:03,945 INFO L290 TraceCheckUtils]: 51: Hoare triple {29688#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {29688#false} is VALID [2022-02-20 19:46:03,945 INFO L290 TraceCheckUtils]: 52: Hoare triple {29688#false} assume !(node4_~m4~0#1 != ~nomsg~0); {29688#false} is VALID [2022-02-20 19:46:03,945 INFO L290 TraceCheckUtils]: 53: Hoare triple {29688#false} ~mode4~0 := 0; {29688#false} is VALID [2022-02-20 19:46:03,946 INFO L290 TraceCheckUtils]: 54: Hoare triple {29688#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {29688#false} is VALID [2022-02-20 19:46:03,946 INFO L290 TraceCheckUtils]: 55: Hoare triple {29688#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {29688#false} is VALID [2022-02-20 19:46:03,946 INFO L290 TraceCheckUtils]: 56: Hoare triple {29688#false} assume !(node5_~m5~0#1 != ~nomsg~0); {29688#false} is VALID [2022-02-20 19:46:03,946 INFO L290 TraceCheckUtils]: 57: Hoare triple {29688#false} ~mode5~0 := 0; {29688#false} is VALID [2022-02-20 19:46:03,946 INFO L290 TraceCheckUtils]: 58: Hoare triple {29688#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {29688#false} is VALID [2022-02-20 19:46:03,946 INFO L290 TraceCheckUtils]: 59: Hoare triple {29688#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {29688#false} is VALID [2022-02-20 19:46:03,946 INFO L290 TraceCheckUtils]: 60: Hoare triple {29688#false} check_#res#1 := check_~tmp~1#1; {29688#false} is VALID [2022-02-20 19:46:03,946 INFO L290 TraceCheckUtils]: 61: Hoare triple {29688#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#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; {29688#false} is VALID [2022-02-20 19:46:03,947 INFO L290 TraceCheckUtils]: 62: Hoare triple {29688#false} assume 0 == assert_~arg#1 % 256; {29688#false} is VALID [2022-02-20 19:46:03,947 INFO L290 TraceCheckUtils]: 63: Hoare triple {29688#false} assume !false; {29688#false} is VALID [2022-02-20 19:46:03,949 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:46:03,950 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:03,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060994483] [2022-02-20 19:46:03,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060994483] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:03,950 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:03,950 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:46:03,950 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679337058] [2022-02-20 19:46:03,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:03,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:03,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:03,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:03,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:03,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:46:03,986 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:03,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:46:03,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:46:03,987 INFO L87 Difference]: Start difference. First operand 1720 states and 3132 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:05,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:05,647 INFO L93 Difference]: Finished difference Result 2052 states and 3654 transitions. [2022-02-20 19:46:05,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:46:05,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:46:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:05,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:05,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:05,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:05,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:46:06,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:07,082 INFO L225 Difference]: With dead ends: 2052 [2022-02-20 19:46:07,083 INFO L226 Difference]: Without dead ends: 1874 [2022-02-20 19:46:07,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:46:07,084 INFO L933 BasicCegarLoop]: 1616 mSDtfsCounter, 1503 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1704 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:46:07,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1503 Valid, 1704 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:46:07,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2022-02-20 19:46:07,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1872. [2022-02-20 19:46:07,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:07,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1874 states. Second operand has 1872 states, 1870 states have (on average 1.8010695187165775) internal successors, (3368), 1871 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have 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:46:07,136 INFO L74 IsIncluded]: Start isIncluded. First operand 1874 states. Second operand has 1872 states, 1870 states have (on average 1.8010695187165775) internal successors, (3368), 1871 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have 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:46:07,138 INFO L87 Difference]: Start difference. First operand 1874 states. Second operand has 1872 states, 1870 states have (on average 1.8010695187165775) internal successors, (3368), 1871 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have 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:46:07,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:07,226 INFO L93 Difference]: Finished difference Result 1874 states and 3369 transitions. [2022-02-20 19:46:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 3369 transitions. [2022-02-20 19:46:07,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:07,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:07,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 1872 states, 1870 states have (on average 1.8010695187165775) internal successors, (3368), 1871 states have internal predecessors, (3368), 0 states have call successors, (0), 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 1874 states. [2022-02-20 19:46:07,232 INFO L87 Difference]: Start difference. First operand has 1872 states, 1870 states have (on average 1.8010695187165775) internal successors, (3368), 1871 states have internal predecessors, (3368), 0 states have call successors, (0), 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 1874 states. [2022-02-20 19:46:07,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:07,322 INFO L93 Difference]: Finished difference Result 1874 states and 3369 transitions. [2022-02-20 19:46:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 3369 transitions. [2022-02-20 19:46:07,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:07,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:07,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:07,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1870 states have (on average 1.8010695187165775) internal successors, (3368), 1871 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have 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:46:07,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 3368 transitions. [2022-02-20 19:46:07,421 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 3368 transitions. Word has length 64 [2022-02-20 19:46:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:07,422 INFO L470 AbstractCegarLoop]: Abstraction has 1872 states and 3368 transitions. [2022-02-20 19:46:07,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:07,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 3368 transitions. [2022-02-20 19:46:07,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:46:07,422 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:07,422 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:46:07,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:46:07,423 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:07,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:07,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1701027568, now seen corresponding path program 1 times [2022-02-20 19:46:07,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:07,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164683586] [2022-02-20 19:46:07,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:07,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:07,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {37546#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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; {37546#true} is VALID [2022-02-20 19:46:07,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {37546#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {37546#true} is VALID [2022-02-20 19:46:07,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {37546#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#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~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {37546#true} is VALID [2022-02-20 19:46:07,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {37546#true} assume 0 == ~r1~0 % 256; {37546#true} is VALID [2022-02-20 19:46:07,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {37546#true} assume ~id1~0 >= 0; {37546#true} is VALID [2022-02-20 19:46:07,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {37546#true} assume 0 == ~st1~0; {37546#true} is VALID [2022-02-20 19:46:07,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {37546#true} assume ~send1~0 == ~id1~0; {37546#true} is VALID [2022-02-20 19:46:07,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {37546#true} assume 0 == ~mode1~0 % 256; {37546#true} is VALID [2022-02-20 19:46:07,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {37546#true} assume ~id2~0 >= 0; {37546#true} is VALID [2022-02-20 19:46:07,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {37546#true} assume 0 == ~st2~0; {37546#true} is VALID [2022-02-20 19:46:07,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {37546#true} assume ~send2~0 == ~id2~0; {37546#true} is VALID [2022-02-20 19:46:07,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {37546#true} assume 0 == ~mode2~0 % 256; {37546#true} is VALID [2022-02-20 19:46:07,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {37546#true} assume ~id3~0 >= 0; {37546#true} is VALID [2022-02-20 19:46:07,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {37546#true} assume 0 == ~st3~0; {37546#true} is VALID [2022-02-20 19:46:07,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {37546#true} assume ~send3~0 == ~id3~0; {37546#true} is VALID [2022-02-20 19:46:07,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {37546#true} assume 0 == ~mode3~0 % 256; {37546#true} is VALID [2022-02-20 19:46:07,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {37546#true} assume ~id4~0 >= 0; {37546#true} is VALID [2022-02-20 19:46:07,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {37546#true} assume 0 == ~st4~0; {37546#true} is VALID [2022-02-20 19:46:07,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {37546#true} assume ~send4~0 == ~id4~0; {37546#true} is VALID [2022-02-20 19:46:07,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {37546#true} assume 0 == ~mode4~0 % 256; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,483 INFO L290 TraceCheckUtils]: 28: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,484 INFO L290 TraceCheckUtils]: 29: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,484 INFO L290 TraceCheckUtils]: 30: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,484 INFO L290 TraceCheckUtils]: 31: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,485 INFO L290 TraceCheckUtils]: 33: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,485 INFO L290 TraceCheckUtils]: 34: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#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; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,486 INFO L290 TraceCheckUtils]: 36: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,487 INFO L290 TraceCheckUtils]: 37: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,487 INFO L290 TraceCheckUtils]: 38: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~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; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,487 INFO L290 TraceCheckUtils]: 39: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,488 INFO L290 TraceCheckUtils]: 40: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,488 INFO L290 TraceCheckUtils]: 41: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,488 INFO L290 TraceCheckUtils]: 42: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,489 INFO L290 TraceCheckUtils]: 43: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,489 INFO L290 TraceCheckUtils]: 44: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,489 INFO L290 TraceCheckUtils]: 45: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,490 INFO L290 TraceCheckUtils]: 46: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,490 INFO L290 TraceCheckUtils]: 47: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,491 INFO L290 TraceCheckUtils]: 48: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,491 INFO L290 TraceCheckUtils]: 49: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,491 INFO L290 TraceCheckUtils]: 50: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:07,492 INFO L290 TraceCheckUtils]: 51: Hoare triple {37548#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {37547#false} is VALID [2022-02-20 19:46:07,492 INFO L290 TraceCheckUtils]: 52: Hoare triple {37547#false} assume !(node4_~m4~0#1 != ~nomsg~0); {37547#false} is VALID [2022-02-20 19:46:07,492 INFO L290 TraceCheckUtils]: 53: Hoare triple {37547#false} ~mode4~0 := 0; {37547#false} is VALID [2022-02-20 19:46:07,492 INFO L290 TraceCheckUtils]: 54: Hoare triple {37547#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {37547#false} is VALID [2022-02-20 19:46:07,492 INFO L290 TraceCheckUtils]: 55: Hoare triple {37547#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {37547#false} is VALID [2022-02-20 19:46:07,493 INFO L290 TraceCheckUtils]: 56: Hoare triple {37547#false} assume !(node5_~m5~0#1 != ~nomsg~0); {37547#false} is VALID [2022-02-20 19:46:07,493 INFO L290 TraceCheckUtils]: 57: Hoare triple {37547#false} ~mode5~0 := 0; {37547#false} is VALID [2022-02-20 19:46:07,493 INFO L290 TraceCheckUtils]: 58: Hoare triple {37547#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {37547#false} is VALID [2022-02-20 19:46:07,493 INFO L290 TraceCheckUtils]: 59: Hoare triple {37547#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {37547#false} is VALID [2022-02-20 19:46:07,493 INFO L290 TraceCheckUtils]: 60: Hoare triple {37547#false} check_#res#1 := check_~tmp~1#1; {37547#false} is VALID [2022-02-20 19:46:07,493 INFO L290 TraceCheckUtils]: 61: Hoare triple {37547#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#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; {37547#false} is VALID [2022-02-20 19:46:07,493 INFO L290 TraceCheckUtils]: 62: Hoare triple {37547#false} assume 0 == assert_~arg#1 % 256; {37547#false} is VALID [2022-02-20 19:46:07,493 INFO L290 TraceCheckUtils]: 63: Hoare triple {37547#false} assume !false; {37547#false} is VALID [2022-02-20 19:46:07,494 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:46:07,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:07,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164683586] [2022-02-20 19:46:07,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164683586] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:07,494 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:07,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:46:07,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585356126] [2022-02-20 19:46:07,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:07,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:07,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:07,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:07,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:07,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:46:07,532 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:07,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:46:07,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:46:07,533 INFO L87 Difference]: Start difference. First operand 1872 states and 3368 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:09,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:09,289 INFO L93 Difference]: Finished difference Result 2484 states and 4322 transitions. [2022-02-20 19:46:09,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:46:09,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:09,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:46:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:09,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:46:10,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:10,780 INFO L225 Difference]: With dead ends: 2484 [2022-02-20 19:46:10,781 INFO L226 Difference]: Without dead ends: 2154 [2022-02-20 19:46:10,795 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:46:10,796 INFO L933 BasicCegarLoop]: 1611 mSDtfsCounter, 1499 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1703 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:46:10,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1499 Valid, 1703 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:46:10,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2022-02-20 19:46:10,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2152. [2022-02-20 19:46:10,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:10,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2154 states. Second operand has 2152 states, 2150 states have (on average 1.7655813953488373) internal successors, (3796), 2151 states have internal predecessors, (3796), 0 states have call successors, (0), 0 states have 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:46:10,916 INFO L74 IsIncluded]: Start isIncluded. First operand 2154 states. Second operand has 2152 states, 2150 states have (on average 1.7655813953488373) internal successors, (3796), 2151 states have internal predecessors, (3796), 0 states have call successors, (0), 0 states have 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:46:10,918 INFO L87 Difference]: Start difference. First operand 2154 states. Second operand has 2152 states, 2150 states have (on average 1.7655813953488373) internal successors, (3796), 2151 states have internal predecessors, (3796), 0 states have call successors, (0), 0 states have 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:46:11,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:11,033 INFO L93 Difference]: Finished difference Result 2154 states and 3797 transitions. [2022-02-20 19:46:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 3797 transitions. [2022-02-20 19:46:11,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:11,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:11,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 2152 states, 2150 states have (on average 1.7655813953488373) internal successors, (3796), 2151 states have internal predecessors, (3796), 0 states have call successors, (0), 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 2154 states. [2022-02-20 19:46:11,040 INFO L87 Difference]: Start difference. First operand has 2152 states, 2150 states have (on average 1.7655813953488373) internal successors, (3796), 2151 states have internal predecessors, (3796), 0 states have call successors, (0), 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 2154 states. [2022-02-20 19:46:11,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:11,155 INFO L93 Difference]: Finished difference Result 2154 states and 3797 transitions. [2022-02-20 19:46:11,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 3797 transitions. [2022-02-20 19:46:11,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:11,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:11,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:11,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:11,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2152 states, 2150 states have (on average 1.7655813953488373) internal successors, (3796), 2151 states have internal predecessors, (3796), 0 states have call successors, (0), 0 states have 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:46:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 3796 transitions. [2022-02-20 19:46:11,282 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 3796 transitions. Word has length 64 [2022-02-20 19:46:11,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:11,282 INFO L470 AbstractCegarLoop]: Abstraction has 2152 states and 3796 transitions. [2022-02-20 19:46:11,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:11,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 3796 transitions. [2022-02-20 19:46:11,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:46:11,283 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:11,283 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:46:11,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:46:11,283 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:11,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:11,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1105068988, now seen corresponding path program 1 times [2022-02-20 19:46:11,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:11,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637923601] [2022-02-20 19:46:11,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:11,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:11,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {46837#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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; {46837#true} is VALID [2022-02-20 19:46:11,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {46837#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {46837#true} is VALID [2022-02-20 19:46:11,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {46837#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#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~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {46837#true} is VALID [2022-02-20 19:46:11,326 INFO L290 TraceCheckUtils]: 3: Hoare triple {46837#true} assume 0 == ~r1~0 % 256; {46837#true} is VALID [2022-02-20 19:46:11,326 INFO L290 TraceCheckUtils]: 4: Hoare triple {46837#true} assume ~id1~0 >= 0; {46837#true} is VALID [2022-02-20 19:46:11,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {46837#true} assume 0 == ~st1~0; {46837#true} is VALID [2022-02-20 19:46:11,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {46837#true} assume ~send1~0 == ~id1~0; {46837#true} is VALID [2022-02-20 19:46:11,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {46837#true} assume 0 == ~mode1~0 % 256; {46837#true} is VALID [2022-02-20 19:46:11,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {46837#true} assume ~id2~0 >= 0; {46837#true} is VALID [2022-02-20 19:46:11,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {46837#true} assume 0 == ~st2~0; {46837#true} is VALID [2022-02-20 19:46:11,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {46837#true} assume ~send2~0 == ~id2~0; {46837#true} is VALID [2022-02-20 19:46:11,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {46837#true} assume 0 == ~mode2~0 % 256; {46837#true} is VALID [2022-02-20 19:46:11,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {46837#true} assume ~id3~0 >= 0; {46837#true} is VALID [2022-02-20 19:46:11,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {46837#true} assume 0 == ~st3~0; {46837#true} is VALID [2022-02-20 19:46:11,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {46837#true} assume ~send3~0 == ~id3~0; {46837#true} is VALID [2022-02-20 19:46:11,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {46837#true} assume 0 == ~mode3~0 % 256; {46837#true} is VALID [2022-02-20 19:46:11,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {46837#true} assume ~id4~0 >= 0; {46837#true} is VALID [2022-02-20 19:46:11,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {46837#true} assume 0 == ~st4~0; {46837#true} is VALID [2022-02-20 19:46:11,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {46837#true} assume ~send4~0 == ~id4~0; {46837#true} is VALID [2022-02-20 19:46:11,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {46837#true} assume 0 == ~mode4~0 % 256; {46837#true} is VALID [2022-02-20 19:46:11,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {46837#true} assume ~id5~0 >= 0; {46837#true} is VALID [2022-02-20 19:46:11,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {46837#true} assume 0 == ~st5~0; {46837#true} is VALID [2022-02-20 19:46:11,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {46837#true} assume ~send5~0 == ~id5~0; {46837#true} is VALID [2022-02-20 19:46:11,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {46837#true} assume 0 == ~mode5~0 % 256; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#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; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,335 INFO L290 TraceCheckUtils]: 40: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,335 INFO L290 TraceCheckUtils]: 41: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,335 INFO L290 TraceCheckUtils]: 42: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,336 INFO L290 TraceCheckUtils]: 43: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,336 INFO L290 TraceCheckUtils]: 44: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,336 INFO L290 TraceCheckUtils]: 45: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,337 INFO L290 TraceCheckUtils]: 46: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,337 INFO L290 TraceCheckUtils]: 47: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,337 INFO L290 TraceCheckUtils]: 48: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,338 INFO L290 TraceCheckUtils]: 49: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,338 INFO L290 TraceCheckUtils]: 50: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,339 INFO L290 TraceCheckUtils]: 51: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,339 INFO L290 TraceCheckUtils]: 52: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,339 INFO L290 TraceCheckUtils]: 53: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,340 INFO L290 TraceCheckUtils]: 54: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:11,340 INFO L290 TraceCheckUtils]: 55: Hoare triple {46839#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {46838#false} is VALID [2022-02-20 19:46:11,340 INFO L290 TraceCheckUtils]: 56: Hoare triple {46838#false} assume !(node5_~m5~0#1 != ~nomsg~0); {46838#false} is VALID [2022-02-20 19:46:11,340 INFO L290 TraceCheckUtils]: 57: Hoare triple {46838#false} ~mode5~0 := 0; {46838#false} is VALID [2022-02-20 19:46:11,341 INFO L290 TraceCheckUtils]: 58: Hoare triple {46838#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {46838#false} is VALID [2022-02-20 19:46:11,341 INFO L290 TraceCheckUtils]: 59: Hoare triple {46838#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {46838#false} is VALID [2022-02-20 19:46:11,341 INFO L290 TraceCheckUtils]: 60: Hoare triple {46838#false} check_#res#1 := check_~tmp~1#1; {46838#false} is VALID [2022-02-20 19:46:11,341 INFO L290 TraceCheckUtils]: 61: Hoare triple {46838#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#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; {46838#false} is VALID [2022-02-20 19:46:11,341 INFO L290 TraceCheckUtils]: 62: Hoare triple {46838#false} assume 0 == assert_~arg#1 % 256; {46838#false} is VALID [2022-02-20 19:46:11,341 INFO L290 TraceCheckUtils]: 63: Hoare triple {46838#false} assume !false; {46838#false} is VALID [2022-02-20 19:46:11,341 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:46:11,342 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:11,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637923601] [2022-02-20 19:46:11,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637923601] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:11,342 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:11,342 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:46:11,342 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677889496] [2022-02-20 19:46:11,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:11,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:11,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:11,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:11,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:11,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:46:11,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:11,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:46:11,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:46:11,381 INFO L87 Difference]: Start difference. First operand 2152 states and 3796 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:13,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:13,323 INFO L93 Difference]: Finished difference Result 3276 states and 5526 transitions. [2022-02-20 19:46:13,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:46:13,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:13,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:46:13,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:13,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:13,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:46:14,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:14,858 INFO L225 Difference]: With dead ends: 3276 [2022-02-20 19:46:14,858 INFO L226 Difference]: Without dead ends: 2666 [2022-02-20 19:46:14,859 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:46:14,860 INFO L933 BasicCegarLoop]: 1606 mSDtfsCounter, 1495 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1702 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:46:14,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1495 Valid, 1702 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:46:14,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2022-02-20 19:46:14,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2022-02-20 19:46:15,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:15,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2666 states. Second operand has 2664 states, 2662 states have (on average 1.7145003756574004) internal successors, (4564), 2663 states have internal predecessors, (4564), 0 states have call successors, (0), 0 states have 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:46:15,006 INFO L74 IsIncluded]: Start isIncluded. First operand 2666 states. Second operand has 2664 states, 2662 states have (on average 1.7145003756574004) internal successors, (4564), 2663 states have internal predecessors, (4564), 0 states have call successors, (0), 0 states have 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:46:15,018 INFO L87 Difference]: Start difference. First operand 2666 states. Second operand has 2664 states, 2662 states have (on average 1.7145003756574004) internal successors, (4564), 2663 states have internal predecessors, (4564), 0 states have call successors, (0), 0 states have 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:46:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:15,188 INFO L93 Difference]: Finished difference Result 2666 states and 4565 transitions. [2022-02-20 19:46:15,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4565 transitions. [2022-02-20 19:46:15,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:15,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:15,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 2664 states, 2662 states have (on average 1.7145003756574004) internal successors, (4564), 2663 states have internal predecessors, (4564), 0 states have call successors, (0), 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 2666 states. [2022-02-20 19:46:15,195 INFO L87 Difference]: Start difference. First operand has 2664 states, 2662 states have (on average 1.7145003756574004) internal successors, (4564), 2663 states have internal predecessors, (4564), 0 states have call successors, (0), 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 2666 states. [2022-02-20 19:46:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:15,365 INFO L93 Difference]: Finished difference Result 2666 states and 4565 transitions. [2022-02-20 19:46:15,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4565 transitions. [2022-02-20 19:46:15,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:15,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:15,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:15,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:15,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2664 states, 2662 states have (on average 1.7145003756574004) internal successors, (4564), 2663 states have internal predecessors, (4564), 0 states have call successors, (0), 0 states have 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:46:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4564 transitions. [2022-02-20 19:46:15,567 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4564 transitions. Word has length 64 [2022-02-20 19:46:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:15,567 INFO L470 AbstractCegarLoop]: Abstraction has 2664 states and 4564 transitions. [2022-02-20 19:46:15,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:15,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4564 transitions. [2022-02-20 19:46:15,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:46:15,568 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:15,568 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:46:15,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:46:15,568 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:15,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:15,569 INFO L85 PathProgramCache]: Analyzing trace with hash 112916410, now seen corresponding path program 1 times [2022-02-20 19:46:15,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:15,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923300771] [2022-02-20 19:46:15,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:15,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:15,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {58776#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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; {58776#true} is VALID [2022-02-20 19:46:15,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {58776#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {58776#true} is VALID [2022-02-20 19:46:15,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {58776#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#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~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {58776#true} is VALID [2022-02-20 19:46:15,636 INFO L290 TraceCheckUtils]: 3: Hoare triple {58776#true} assume 0 == ~r1~0 % 256; {58776#true} is VALID [2022-02-20 19:46:15,636 INFO L290 TraceCheckUtils]: 4: Hoare triple {58776#true} assume ~id1~0 >= 0; {58776#true} is VALID [2022-02-20 19:46:15,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {58776#true} assume 0 == ~st1~0; {58778#(<= ~st1~0 0)} is VALID [2022-02-20 19:46:15,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {58778#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {58778#(<= ~st1~0 0)} is VALID [2022-02-20 19:46:15,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {58778#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {58778#(<= ~st1~0 0)} is VALID [2022-02-20 19:46:15,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {58778#(<= ~st1~0 0)} assume ~id2~0 >= 0; {58778#(<= ~st1~0 0)} is VALID [2022-02-20 19:46:15,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {58778#(<= ~st1~0 0)} assume 0 == ~st2~0; {58779#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {58779#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {58779#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {58779#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {58779#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {58779#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {58779#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {58779#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {58780#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {58780#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {58780#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {58780#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {58780#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {58780#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {58780#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {58780#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {58781#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {58781#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {58781#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {58781#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {58781#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {58781#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {58781#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {58781#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,643 INFO L290 TraceCheckUtils]: 27: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#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; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,646 INFO L290 TraceCheckUtils]: 36: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,647 INFO L290 TraceCheckUtils]: 38: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~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; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,648 INFO L290 TraceCheckUtils]: 41: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,649 INFO L290 TraceCheckUtils]: 44: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,649 INFO L290 TraceCheckUtils]: 45: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,650 INFO L290 TraceCheckUtils]: 46: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,651 INFO L290 TraceCheckUtils]: 47: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,651 INFO L290 TraceCheckUtils]: 48: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,651 INFO L290 TraceCheckUtils]: 49: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,652 INFO L290 TraceCheckUtils]: 50: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,652 INFO L290 TraceCheckUtils]: 51: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,652 INFO L290 TraceCheckUtils]: 52: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,653 INFO L290 TraceCheckUtils]: 53: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,653 INFO L290 TraceCheckUtils]: 54: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,653 INFO L290 TraceCheckUtils]: 55: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode5~0 % 256); {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,654 INFO L290 TraceCheckUtils]: 56: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,654 INFO L290 TraceCheckUtils]: 57: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,654 INFO L290 TraceCheckUtils]: 58: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:15,655 INFO L290 TraceCheckUtils]: 59: Hoare triple {58782#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {58777#false} is VALID [2022-02-20 19:46:15,655 INFO L290 TraceCheckUtils]: 60: Hoare triple {58777#false} check_#res#1 := check_~tmp~1#1; {58777#false} is VALID [2022-02-20 19:46:15,655 INFO L290 TraceCheckUtils]: 61: Hoare triple {58777#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#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; {58777#false} is VALID [2022-02-20 19:46:15,655 INFO L290 TraceCheckUtils]: 62: Hoare triple {58777#false} assume 0 == assert_~arg#1 % 256; {58777#false} is VALID [2022-02-20 19:46:15,655 INFO L290 TraceCheckUtils]: 63: Hoare triple {58777#false} assume !false; {58777#false} is VALID [2022-02-20 19:46:15,656 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:46:15,656 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:15,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923300771] [2022-02-20 19:46:15,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923300771] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:15,656 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:15,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:46:15,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392699141] [2022-02-20 19:46:15,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:15,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:15,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:15,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:15,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:15,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:46:15,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:15,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:46:15,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:46:15,695 INFO L87 Difference]: Start difference. First operand 2664 states and 4564 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:29,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:29,115 INFO L93 Difference]: Finished difference Result 13884 states and 21694 transitions. [2022-02-20 19:46:29,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:46:29,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:29,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:46:29,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2378 transitions. [2022-02-20 19:46:29,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:46:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2378 transitions. [2022-02-20 19:46:29,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 2378 transitions.