./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.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 6fd1b86eb4bd4da10127873e4ddea09cb0ce3be9adebe9545b8e8b0c5a6a02d7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:58:22,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:58:22,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:58:22,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:58:22,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:58:22,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:58:22,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:58:22,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:58:22,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:58:22,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:58:22,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:58:22,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:58:22,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:58:22,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:58:22,691 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:58:22,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:58:22,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:58:22,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:58:22,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:58:22,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:58:22,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:58:22,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:58:22,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:58:22,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:58:22,711 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:58:22,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:58:22,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:58:22,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:58:22,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:58:22,713 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:58:22,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:58:22,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:58:22,716 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:58:22,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:58:22,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:58:22,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:58:22,718 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:58:22,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:58:22,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:58:22,719 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:58:22,720 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:58:22,721 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:58:22,745 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:58:22,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:58:22,748 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:58:22,749 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:58:22,749 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:58:22,750 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:58:22,750 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:58:22,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:58:22,750 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:58:22,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:58:22,751 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:58:22,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:58:22,752 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:58:22,752 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:58:22,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:58:22,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:58:22,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:58:22,752 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:58:22,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:58:22,753 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:58:22,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:58:22,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:58:22,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:58:22,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:58:22,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:58:22,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:58:22,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:58:22,754 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:58:22,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:58:22,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:58:22,754 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:58:22,754 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:58:22,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:58:22,755 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 -> 6fd1b86eb4bd4da10127873e4ddea09cb0ce3be9adebe9545b8e8b0c5a6a02d7 [2022-02-20 18:58:22,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:58:22,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:58:22,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:58:22,940 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:58:22,940 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:58:22,941 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:58:22,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6d6183f2/1fec0145e7f242c28a9853b55df089a3/FLAG1cfceca46 [2022-02-20 18:58:23,384 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:58:23,399 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:58:23,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6d6183f2/1fec0145e7f242c28a9853b55df089a3/FLAG1cfceca46 [2022-02-20 18:58:23,415 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6d6183f2/1fec0145e7f242c28a9853b55df089a3 [2022-02-20 18:58:23,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:58:23,417 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:58:23,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:58:23,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:58:23,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:58:23,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:58:23" (1/1) ... [2022-02-20 18:58:23,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e44c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:23, skipping insertion in model container [2022-02-20 18:58:23,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:58:23" (1/1) ... [2022-02-20 18:58:23,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:58:23,459 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:58:23,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7806,7819] [2022-02-20 18:58:23,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:58:23,665 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:58:23,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7806,7819] [2022-02-20 18:58:23,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:58:23,723 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:58:23,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:23 WrapperNode [2022-02-20 18:58:23,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:58:23,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:58:23,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:58:23,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:58:23,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:23" (1/1) ... [2022-02-20 18:58:23,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:23" (1/1) ... [2022-02-20 18:58:23,764 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 633 [2022-02-20 18:58:23,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:58:23,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:58:23,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:58:23,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:58:23,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:23" (1/1) ... [2022-02-20 18:58:23,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:23" (1/1) ... [2022-02-20 18:58:23,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:23" (1/1) ... [2022-02-20 18:58:23,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:23" (1/1) ... [2022-02-20 18:58:23,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:23" (1/1) ... [2022-02-20 18:58:23,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:23" (1/1) ... [2022-02-20 18:58:23,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:23" (1/1) ... [2022-02-20 18:58:23,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:58:23,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:58:23,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:58:23,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:58:23,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:23" (1/1) ... [2022-02-20 18:58:23,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:58:23,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:58:23,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:58:23,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:58:23,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:58:23,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:58:23,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:58:23,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:58:24,006 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:58:24,024 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:58:24,545 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:58:24,551 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:58:24,551 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:58:24,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:58:24 BoogieIcfgContainer [2022-02-20 18:58:24,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:58:24,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:58:24,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:58:24,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:58:24,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:58:23" (1/3) ... [2022-02-20 18:58:24,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9055fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:58:24, skipping insertion in model container [2022-02-20 18:58:24,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:23" (2/3) ... [2022-02-20 18:58:24,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9055fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:58:24, skipping insertion in model container [2022-02-20 18:58:24,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:58:24" (3/3) ... [2022-02-20 18:58:24,558 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:58:24,560 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:58:24,561 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:58:24,589 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:58:24,592 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:58:24,592 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:58:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 147 states have (on average 1.7619047619047619) internal successors, (259), 148 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:24,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:58:24,610 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:24,611 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] [2022-02-20 18:58:24,611 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:24,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:24,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1468963440, now seen corresponding path program 1 times [2022-02-20 18:58:24,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:24,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607573059] [2022-02-20 18:58:24,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:24,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:25,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {152#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(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1906~0 := 0;~__return_2055~0 := 0;~__return_2162~0 := 0; {152#true} is VALID [2022-02-20 18:58:25,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {152#true} is VALID [2022-02-20 18:58:25,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {152#true} is VALID [2022-02-20 18:58:25,091 INFO L290 TraceCheckUtils]: 3: Hoare triple {152#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:58:25,091 INFO L290 TraceCheckUtils]: 4: Hoare triple {152#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {152#true} is VALID [2022-02-20 18:58:25,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:58:25,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {152#true} is VALID [2022-02-20 18:58:25,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:58:25,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {152#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {152#true} is VALID [2022-02-20 18:58:25,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {152#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:58:25,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {152#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {152#true} is VALID [2022-02-20 18:58:25,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {152#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:58:25,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {152#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {152#true} is VALID [2022-02-20 18:58:25,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {152#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:58:25,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {152#true} assume ~id1~0 != ~id2~0; {152#true} is VALID [2022-02-20 18:58:25,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {152#true} assume ~id1~0 != ~id3~0; {152#true} is VALID [2022-02-20 18:58:25,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {152#true} assume ~id2~0 != ~id3~0; {152#true} is VALID [2022-02-20 18:58:25,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {152#true} assume ~id1~0 >= 0; {152#true} is VALID [2022-02-20 18:58:25,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {152#true} assume ~id2~0 >= 0; {152#true} is VALID [2022-02-20 18:58:25,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {152#true} assume ~id3~0 >= 0; {152#true} is VALID [2022-02-20 18:58:25,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {152#true} assume 0 == ~r1~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~r2~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~r3~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {154#(<= ~r1~0 0)} assume !(0 == main_~init__r122~0#1 % 256); {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {154#(<= ~r1~0 0)} assume !(0 == main_~init__r132~0#1 % 256); {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {154#(<= ~r1~0 0)} assume !(0 == main_~init__r212~0#1 % 256); {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {154#(<= ~r1~0 0)} assume !(0 == main_~init__r232~0#1 % 256); {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {154#(<= ~r1~0 0)} assume !(0 == main_~init__r312~0#1 % 256); {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {154#(<= ~r1~0 0)} assume !(0 == main_~init__r322~0#1 % 256); {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {154#(<= ~r1~0 0)} assume ~max1~0 == ~id1~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {154#(<= ~r1~0 0)} assume ~max2~0 == ~id2~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,108 INFO L290 TraceCheckUtils]: 31: Hoare triple {154#(<= ~r1~0 0)} assume ~max3~0 == ~id3~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~st1~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~st2~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~st3~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~nl1~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,111 INFO L290 TraceCheckUtils]: 36: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~nl2~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~nl3~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,112 INFO L290 TraceCheckUtils]: 39: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,112 INFO L290 TraceCheckUtils]: 40: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,113 INFO L290 TraceCheckUtils]: 41: Hoare triple {154#(<= ~r1~0 0)} assume !(0 == ~newmax1~0 % 256); {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,113 INFO L290 TraceCheckUtils]: 42: Hoare triple {154#(<= ~r1~0 0)} assume !(0 == ~newmax2~0 % 256); {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,114 INFO L290 TraceCheckUtils]: 43: Hoare triple {154#(<= ~r1~0 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1906~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1906~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,114 INFO L290 TraceCheckUtils]: 44: Hoare triple {154#(<= ~r1~0 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,115 INFO L290 TraceCheckUtils]: 45: Hoare triple {154#(<= ~r1~0 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,115 INFO L290 TraceCheckUtils]: 46: Hoare triple {154#(<= ~r1~0 0)} assume !!(0 == ~mode1~0 % 256); {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:25,116 INFO L290 TraceCheckUtils]: 47: Hoare triple {154#(<= ~r1~0 0)} assume !(~r1~0 < 1); {153#false} is VALID [2022-02-20 18:58:25,116 INFO L290 TraceCheckUtils]: 48: Hoare triple {153#false} ~mode1~0 := 1; {153#false} is VALID [2022-02-20 18:58:25,119 INFO L290 TraceCheckUtils]: 49: Hoare triple {153#false} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {153#false} is VALID [2022-02-20 18:58:25,120 INFO L290 TraceCheckUtils]: 50: Hoare triple {153#false} assume !!(0 == ~mode2~0 % 256); {153#false} is VALID [2022-02-20 18:58:25,120 INFO L290 TraceCheckUtils]: 51: Hoare triple {153#false} assume !(~r2~0 < 2); {153#false} is VALID [2022-02-20 18:58:25,122 INFO L290 TraceCheckUtils]: 52: Hoare triple {153#false} ~mode2~0 := 1; {153#false} is VALID [2022-02-20 18:58:25,122 INFO L290 TraceCheckUtils]: 53: Hoare triple {153#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {153#false} is VALID [2022-02-20 18:58:25,123 INFO L290 TraceCheckUtils]: 54: Hoare triple {153#false} assume !!(0 == ~mode3~0 % 256); {153#false} is VALID [2022-02-20 18:58:25,123 INFO L290 TraceCheckUtils]: 55: Hoare triple {153#false} assume !(~r3~0 < 2); {153#false} is VALID [2022-02-20 18:58:25,124 INFO L290 TraceCheckUtils]: 56: Hoare triple {153#false} ~mode3~0 := 1; {153#false} is VALID [2022-02-20 18:58:25,124 INFO L290 TraceCheckUtils]: 57: Hoare triple {153#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {153#false} is VALID [2022-02-20 18:58:25,125 INFO L290 TraceCheckUtils]: 58: Hoare triple {153#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {153#false} is VALID [2022-02-20 18:58:25,125 INFO L290 TraceCheckUtils]: 59: Hoare triple {153#false} ~__return_2055~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2055~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {153#false} is VALID [2022-02-20 18:58:25,125 INFO L290 TraceCheckUtils]: 60: Hoare triple {153#false} assume 0 == main_~assert__arg~0#1 % 256; {153#false} is VALID [2022-02-20 18:58:25,125 INFO L290 TraceCheckUtils]: 61: Hoare triple {153#false} assume !false; {153#false} is VALID [2022-02-20 18:58:25,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:25,127 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:25,128 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607573059] [2022-02-20 18:58:25,128 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607573059] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:25,129 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:25,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:25,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116834384] [2022-02-20 18:58:25,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:25,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:58:25,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:25,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:25,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:25,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:25,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:25,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:25,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:25,226 INFO L87 Difference]: Start difference. First operand has 149 states, 147 states have (on average 1.7619047619047619) internal successors, (259), 148 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:25,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:25,524 INFO L93 Difference]: Finished difference Result 311 states and 527 transitions. [2022-02-20 18:58:25,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:25,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:58:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:25,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2022-02-20 18:58:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:25,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2022-02-20 18:58:25,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 527 transitions. [2022-02-20 18:58:25,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 527 edges. 527 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:25,934 INFO L225 Difference]: With dead ends: 311 [2022-02-20 18:58:25,935 INFO L226 Difference]: Without dead ends: 213 [2022-02-20 18:58:25,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:25,941 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 150 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:25,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 432 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:25,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-02-20 18:58:25,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2022-02-20 18:58:25,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:25,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand has 211 states, 210 states have (on average 1.5666666666666667) internal successors, (329), 210 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:25,993 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand has 211 states, 210 states have (on average 1.5666666666666667) internal successors, (329), 210 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:25,993 INFO L87 Difference]: Start difference. First operand 213 states. Second operand has 211 states, 210 states have (on average 1.5666666666666667) internal successors, (329), 210 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:26,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:26,001 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2022-02-20 18:58:26,001 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 330 transitions. [2022-02-20 18:58:26,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:26,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:26,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 210 states have (on average 1.5666666666666667) internal successors, (329), 210 states have internal predecessors, (329), 0 states have call successors, (0), 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 213 states. [2022-02-20 18:58:26,003 INFO L87 Difference]: Start difference. First operand has 211 states, 210 states have (on average 1.5666666666666667) internal successors, (329), 210 states have internal predecessors, (329), 0 states have call successors, (0), 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 213 states. [2022-02-20 18:58:26,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:26,009 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2022-02-20 18:58:26,009 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 330 transitions. [2022-02-20 18:58:26,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:26,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:26,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:26,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:26,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.5666666666666667) internal successors, (329), 210 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:26,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 329 transitions. [2022-02-20 18:58:26,017 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 329 transitions. Word has length 62 [2022-02-20 18:58:26,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:26,017 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 329 transitions. [2022-02-20 18:58:26,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:26,018 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 329 transitions. [2022-02-20 18:58:26,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:58:26,019 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:26,019 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 18:58:26,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:58:26,019 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:26,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:26,020 INFO L85 PathProgramCache]: Analyzing trace with hash -240910223, now seen corresponding path program 1 times [2022-02-20 18:58:26,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:26,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236580238] [2022-02-20 18:58:26,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:26,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:26,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {1279#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(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1906~0 := 0;~__return_2055~0 := 0;~__return_2162~0 := 0; {1279#true} is VALID [2022-02-20 18:58:26,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {1279#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {1279#true} is VALID [2022-02-20 18:58:26,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {1279#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {1279#true} is VALID [2022-02-20 18:58:26,091 INFO L290 TraceCheckUtils]: 3: Hoare triple {1279#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {1279#true} is VALID [2022-02-20 18:58:26,091 INFO L290 TraceCheckUtils]: 4: Hoare triple {1279#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {1279#true} is VALID [2022-02-20 18:58:26,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {1279#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {1279#true} is VALID [2022-02-20 18:58:26,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {1279#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {1279#true} is VALID [2022-02-20 18:58:26,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {1279#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {1279#true} is VALID [2022-02-20 18:58:26,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {1279#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {1279#true} is VALID [2022-02-20 18:58:26,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {1279#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {1279#true} is VALID [2022-02-20 18:58:26,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {1279#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {1279#true} is VALID [2022-02-20 18:58:26,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {1279#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {1279#true} is VALID [2022-02-20 18:58:26,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {1279#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {1279#true} is VALID [2022-02-20 18:58:26,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {1279#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {1279#true} is VALID [2022-02-20 18:58:26,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {1279#true} assume ~id1~0 != ~id2~0; {1279#true} is VALID [2022-02-20 18:58:26,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {1279#true} assume ~id1~0 != ~id3~0; {1279#true} is VALID [2022-02-20 18:58:26,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {1279#true} assume ~id2~0 != ~id3~0; {1279#true} is VALID [2022-02-20 18:58:26,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {1279#true} assume ~id1~0 >= 0; {1279#true} is VALID [2022-02-20 18:58:26,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {1279#true} assume ~id2~0 >= 0; {1279#true} is VALID [2022-02-20 18:58:26,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {1279#true} assume ~id3~0 >= 0; {1279#true} is VALID [2022-02-20 18:58:26,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {1279#true} assume 0 == ~r1~0; {1279#true} is VALID [2022-02-20 18:58:26,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {1279#true} assume 0 == ~r2~0; {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {1281#(<= ~r2~0 0)} assume 0 == ~r3~0; {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {1281#(<= ~r2~0 0)} assume !(0 == main_~init__r122~0#1 % 256); {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {1281#(<= ~r2~0 0)} assume !(0 == main_~init__r132~0#1 % 256); {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {1281#(<= ~r2~0 0)} assume !(0 == main_~init__r212~0#1 % 256); {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {1281#(<= ~r2~0 0)} assume !(0 == main_~init__r232~0#1 % 256); {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {1281#(<= ~r2~0 0)} assume !(0 == main_~init__r312~0#1 % 256); {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,097 INFO L290 TraceCheckUtils]: 28: Hoare triple {1281#(<= ~r2~0 0)} assume !(0 == main_~init__r322~0#1 % 256); {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,097 INFO L290 TraceCheckUtils]: 29: Hoare triple {1281#(<= ~r2~0 0)} assume ~max1~0 == ~id1~0; {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {1281#(<= ~r2~0 0)} assume ~max2~0 == ~id2~0; {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {1281#(<= ~r2~0 0)} assume ~max3~0 == ~id3~0; {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {1281#(<= ~r2~0 0)} assume 0 == ~st1~0; {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,099 INFO L290 TraceCheckUtils]: 33: Hoare triple {1281#(<= ~r2~0 0)} assume 0 == ~st2~0; {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {1281#(<= ~r2~0 0)} assume 0 == ~st3~0; {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {1281#(<= ~r2~0 0)} assume 0 == ~nl1~0; {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,100 INFO L290 TraceCheckUtils]: 36: Hoare triple {1281#(<= ~r2~0 0)} assume 0 == ~nl2~0; {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,100 INFO L290 TraceCheckUtils]: 37: Hoare triple {1281#(<= ~r2~0 0)} assume 0 == ~nl3~0; {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {1281#(<= ~r2~0 0)} assume 0 == ~mode1~0 % 256; {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,101 INFO L290 TraceCheckUtils]: 39: Hoare triple {1281#(<= ~r2~0 0)} assume 0 == ~mode2~0 % 256; {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,101 INFO L290 TraceCheckUtils]: 40: Hoare triple {1281#(<= ~r2~0 0)} assume 0 == ~mode3~0 % 256; {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,101 INFO L290 TraceCheckUtils]: 41: Hoare triple {1281#(<= ~r2~0 0)} assume !(0 == ~newmax1~0 % 256); {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,102 INFO L290 TraceCheckUtils]: 42: Hoare triple {1281#(<= ~r2~0 0)} assume !(0 == ~newmax2~0 % 256); {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,102 INFO L290 TraceCheckUtils]: 43: Hoare triple {1281#(<= ~r2~0 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1906~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1906~0; {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {1281#(<= ~r2~0 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,103 INFO L290 TraceCheckUtils]: 45: Hoare triple {1281#(<= ~r2~0 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,103 INFO L290 TraceCheckUtils]: 46: Hoare triple {1281#(<= ~r2~0 0)} assume !!(0 == ~mode1~0 % 256); {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,103 INFO L290 TraceCheckUtils]: 47: Hoare triple {1281#(<= ~r2~0 0)} assume ~r1~0 < 1; {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,104 INFO L290 TraceCheckUtils]: 48: Hoare triple {1281#(<= ~r2~0 0)} assume !!(0 == ~ep12~0 % 256); {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,104 INFO L290 TraceCheckUtils]: 49: Hoare triple {1281#(<= ~r2~0 0)} assume !!(0 == ~ep13~0 % 256); {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,104 INFO L290 TraceCheckUtils]: 50: Hoare triple {1281#(<= ~r2~0 0)} ~mode1~0 := 1; {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {1281#(<= ~r2~0 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,105 INFO L290 TraceCheckUtils]: 52: Hoare triple {1281#(<= ~r2~0 0)} assume !!(0 == ~mode2~0 % 256); {1281#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:26,106 INFO L290 TraceCheckUtils]: 53: Hoare triple {1281#(<= ~r2~0 0)} assume !(~r2~0 < 2); {1280#false} is VALID [2022-02-20 18:58:26,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {1280#false} ~mode2~0 := 1; {1280#false} is VALID [2022-02-20 18:58:26,106 INFO L290 TraceCheckUtils]: 55: Hoare triple {1280#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {1280#false} is VALID [2022-02-20 18:58:26,106 INFO L290 TraceCheckUtils]: 56: Hoare triple {1280#false} assume !!(0 == ~mode3~0 % 256); {1280#false} is VALID [2022-02-20 18:58:26,106 INFO L290 TraceCheckUtils]: 57: Hoare triple {1280#false} assume !(~r3~0 < 2); {1280#false} is VALID [2022-02-20 18:58:26,106 INFO L290 TraceCheckUtils]: 58: Hoare triple {1280#false} ~mode3~0 := 1; {1280#false} is VALID [2022-02-20 18:58:26,106 INFO L290 TraceCheckUtils]: 59: Hoare triple {1280#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1280#false} is VALID [2022-02-20 18:58:26,107 INFO L290 TraceCheckUtils]: 60: Hoare triple {1280#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {1280#false} is VALID [2022-02-20 18:58:26,107 INFO L290 TraceCheckUtils]: 61: Hoare triple {1280#false} ~__return_2055~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2055~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {1280#false} is VALID [2022-02-20 18:58:26,107 INFO L290 TraceCheckUtils]: 62: Hoare triple {1280#false} assume 0 == main_~assert__arg~0#1 % 256; {1280#false} is VALID [2022-02-20 18:58:26,107 INFO L290 TraceCheckUtils]: 63: Hoare triple {1280#false} assume !false; {1280#false} is VALID [2022-02-20 18:58:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:26,108 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:26,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236580238] [2022-02-20 18:58:26,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236580238] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:26,108 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:26,108 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:26,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860282989] [2022-02-20 18:58:26,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:26,110 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 18:58:26,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:26,110 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 18:58:26,151 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 18:58:26,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:26,151 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:26,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:26,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:26,152 INFO L87 Difference]: Start difference. First operand 211 states and 329 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 18:58:26,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:26,421 INFO L93 Difference]: Finished difference Result 503 states and 809 transitions. [2022-02-20 18:58:26,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:26,421 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 18:58:26,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:26,422 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 18:58:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2022-02-20 18:58:26,425 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 18:58:26,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2022-02-20 18:58:26,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 508 transitions. [2022-02-20 18:58:26,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:26,703 INFO L225 Difference]: With dead ends: 503 [2022-02-20 18:58:26,704 INFO L226 Difference]: Without dead ends: 349 [2022-02-20 18:58:26,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:26,705 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 125 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:26,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 415 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:26,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-02-20 18:58:26,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2022-02-20 18:58:26,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:26,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 349 states. Second operand has 347 states, 346 states have (on average 1.5953757225433527) internal successors, (552), 346 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:26,769 INFO L74 IsIncluded]: Start isIncluded. First operand 349 states. Second operand has 347 states, 346 states have (on average 1.5953757225433527) internal successors, (552), 346 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:26,770 INFO L87 Difference]: Start difference. First operand 349 states. Second operand has 347 states, 346 states have (on average 1.5953757225433527) internal successors, (552), 346 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:26,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:26,778 INFO L93 Difference]: Finished difference Result 349 states and 553 transitions. [2022-02-20 18:58:26,778 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 553 transitions. [2022-02-20 18:58:26,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:26,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:26,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 347 states, 346 states have (on average 1.5953757225433527) internal successors, (552), 346 states have internal predecessors, (552), 0 states have call successors, (0), 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 349 states. [2022-02-20 18:58:26,780 INFO L87 Difference]: Start difference. First operand has 347 states, 346 states have (on average 1.5953757225433527) internal successors, (552), 346 states have internal predecessors, (552), 0 states have call successors, (0), 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 349 states. [2022-02-20 18:58:26,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:26,788 INFO L93 Difference]: Finished difference Result 349 states and 553 transitions. [2022-02-20 18:58:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 553 transitions. [2022-02-20 18:58:26,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:26,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:26,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:26,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:26,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.5953757225433527) internal successors, (552), 346 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 552 transitions. [2022-02-20 18:58:26,798 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 552 transitions. Word has length 64 [2022-02-20 18:58:26,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:26,799 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 552 transitions. [2022-02-20 18:58:26,799 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 18:58:26,799 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 552 transitions. [2022-02-20 18:58:26,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:58:26,800 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:26,800 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, 1, 1] [2022-02-20 18:58:26,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:58:26,801 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:26,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:26,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1851209774, now seen corresponding path program 1 times [2022-02-20 18:58:26,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:26,802 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959343594] [2022-02-20 18:58:26,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:26,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:26,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {3142#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(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1906~0 := 0;~__return_2055~0 := 0;~__return_2162~0 := 0; {3142#true} is VALID [2022-02-20 18:58:26,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {3142#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {3142#true} is VALID [2022-02-20 18:58:26,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {3142#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {3142#true} is VALID [2022-02-20 18:58:26,862 INFO L290 TraceCheckUtils]: 3: Hoare triple {3142#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {3142#true} is VALID [2022-02-20 18:58:26,862 INFO L290 TraceCheckUtils]: 4: Hoare triple {3142#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {3142#true} is VALID [2022-02-20 18:58:26,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {3142#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {3142#true} is VALID [2022-02-20 18:58:26,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {3142#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {3142#true} is VALID [2022-02-20 18:58:26,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {3142#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {3142#true} is VALID [2022-02-20 18:58:26,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {3142#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {3142#true} is VALID [2022-02-20 18:58:26,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {3142#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {3142#true} is VALID [2022-02-20 18:58:26,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {3142#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {3142#true} is VALID [2022-02-20 18:58:26,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {3142#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {3142#true} is VALID [2022-02-20 18:58:26,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {3142#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {3142#true} is VALID [2022-02-20 18:58:26,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {3142#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {3142#true} is VALID [2022-02-20 18:58:26,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {3142#true} assume ~id1~0 != ~id2~0; {3142#true} is VALID [2022-02-20 18:58:26,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {3142#true} assume ~id1~0 != ~id3~0; {3142#true} is VALID [2022-02-20 18:58:26,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {3142#true} assume ~id2~0 != ~id3~0; {3142#true} is VALID [2022-02-20 18:58:26,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {3142#true} assume ~id1~0 >= 0; {3142#true} is VALID [2022-02-20 18:58:26,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {3142#true} assume ~id2~0 >= 0; {3142#true} is VALID [2022-02-20 18:58:26,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {3142#true} assume ~id3~0 >= 0; {3142#true} is VALID [2022-02-20 18:58:26,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {3142#true} assume 0 == ~r1~0; {3142#true} is VALID [2022-02-20 18:58:26,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {3142#true} assume 0 == ~r2~0; {3142#true} is VALID [2022-02-20 18:58:26,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {3142#true} assume 0 == ~r3~0; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {3144#(<= ~r3~0 0)} assume !(0 == main_~init__r122~0#1 % 256); {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {3144#(<= ~r3~0 0)} assume !(0 == main_~init__r132~0#1 % 256); {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {3144#(<= ~r3~0 0)} assume !(0 == main_~init__r212~0#1 % 256); {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {3144#(<= ~r3~0 0)} assume !(0 == main_~init__r232~0#1 % 256); {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {3144#(<= ~r3~0 0)} assume !(0 == main_~init__r312~0#1 % 256); {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {3144#(<= ~r3~0 0)} assume !(0 == main_~init__r322~0#1 % 256); {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,867 INFO L290 TraceCheckUtils]: 29: Hoare triple {3144#(<= ~r3~0 0)} assume ~max1~0 == ~id1~0; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,867 INFO L290 TraceCheckUtils]: 30: Hoare triple {3144#(<= ~r3~0 0)} assume ~max2~0 == ~id2~0; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,867 INFO L290 TraceCheckUtils]: 31: Hoare triple {3144#(<= ~r3~0 0)} assume ~max3~0 == ~id3~0; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,868 INFO L290 TraceCheckUtils]: 32: Hoare triple {3144#(<= ~r3~0 0)} assume 0 == ~st1~0; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,868 INFO L290 TraceCheckUtils]: 33: Hoare triple {3144#(<= ~r3~0 0)} assume 0 == ~st2~0; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,868 INFO L290 TraceCheckUtils]: 34: Hoare triple {3144#(<= ~r3~0 0)} assume 0 == ~st3~0; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {3144#(<= ~r3~0 0)} assume 0 == ~nl1~0; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,869 INFO L290 TraceCheckUtils]: 36: Hoare triple {3144#(<= ~r3~0 0)} assume 0 == ~nl2~0; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,869 INFO L290 TraceCheckUtils]: 37: Hoare triple {3144#(<= ~r3~0 0)} assume 0 == ~nl3~0; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {3144#(<= ~r3~0 0)} assume 0 == ~mode1~0 % 256; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,870 INFO L290 TraceCheckUtils]: 39: Hoare triple {3144#(<= ~r3~0 0)} assume 0 == ~mode2~0 % 256; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {3144#(<= ~r3~0 0)} assume 0 == ~mode3~0 % 256; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {3144#(<= ~r3~0 0)} assume !(0 == ~newmax1~0 % 256); {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {3144#(<= ~r3~0 0)} assume !(0 == ~newmax2~0 % 256); {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {3144#(<= ~r3~0 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1906~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1906~0; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {3144#(<= ~r3~0 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {3144#(<= ~r3~0 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,872 INFO L290 TraceCheckUtils]: 46: Hoare triple {3144#(<= ~r3~0 0)} assume !!(0 == ~mode1~0 % 256); {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,873 INFO L290 TraceCheckUtils]: 47: Hoare triple {3144#(<= ~r3~0 0)} assume ~r1~0 < 1; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {3144#(<= ~r3~0 0)} assume !!(0 == ~ep12~0 % 256); {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {3144#(<= ~r3~0 0)} assume !!(0 == ~ep13~0 % 256); {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,873 INFO L290 TraceCheckUtils]: 50: Hoare triple {3144#(<= ~r3~0 0)} ~mode1~0 := 1; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,874 INFO L290 TraceCheckUtils]: 51: Hoare triple {3144#(<= ~r3~0 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,874 INFO L290 TraceCheckUtils]: 52: Hoare triple {3144#(<= ~r3~0 0)} assume !!(0 == ~mode2~0 % 256); {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,874 INFO L290 TraceCheckUtils]: 53: Hoare triple {3144#(<= ~r3~0 0)} assume ~r2~0 < 2; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,875 INFO L290 TraceCheckUtils]: 54: Hoare triple {3144#(<= ~r3~0 0)} assume !!(0 == ~ep21~0 % 256); {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,875 INFO L290 TraceCheckUtils]: 55: Hoare triple {3144#(<= ~r3~0 0)} assume !!(0 == ~ep23~0 % 256); {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,875 INFO L290 TraceCheckUtils]: 56: Hoare triple {3144#(<= ~r3~0 0)} ~mode2~0 := 1; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,876 INFO L290 TraceCheckUtils]: 57: Hoare triple {3144#(<= ~r3~0 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,876 INFO L290 TraceCheckUtils]: 58: Hoare triple {3144#(<= ~r3~0 0)} assume !!(0 == ~mode3~0 % 256); {3144#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:26,876 INFO L290 TraceCheckUtils]: 59: Hoare triple {3144#(<= ~r3~0 0)} assume !(~r3~0 < 2); {3143#false} is VALID [2022-02-20 18:58:26,877 INFO L290 TraceCheckUtils]: 60: Hoare triple {3143#false} ~mode3~0 := 1; {3143#false} is VALID [2022-02-20 18:58:26,877 INFO L290 TraceCheckUtils]: 61: Hoare triple {3143#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {3143#false} is VALID [2022-02-20 18:58:26,877 INFO L290 TraceCheckUtils]: 62: Hoare triple {3143#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {3143#false} is VALID [2022-02-20 18:58:26,877 INFO L290 TraceCheckUtils]: 63: Hoare triple {3143#false} ~__return_2055~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2055~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {3143#false} is VALID [2022-02-20 18:58:26,877 INFO L290 TraceCheckUtils]: 64: Hoare triple {3143#false} assume 0 == main_~assert__arg~0#1 % 256; {3143#false} is VALID [2022-02-20 18:58:26,877 INFO L290 TraceCheckUtils]: 65: Hoare triple {3143#false} assume !false; {3143#false} is VALID [2022-02-20 18:58:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:26,878 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:26,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959343594] [2022-02-20 18:58:26,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959343594] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:26,878 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:26,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:26,879 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477714177] [2022-02-20 18:58:26,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:26,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 18:58:26,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:26,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:26,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:26,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:26,932 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:26,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:26,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:26,933 INFO L87 Difference]: Start difference. First operand 347 states and 552 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:27,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:27,313 INFO L93 Difference]: Finished difference Result 895 states and 1450 transitions. [2022-02-20 18:58:27,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:27,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 18:58:27,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:27,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:27,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2022-02-20 18:58:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2022-02-20 18:58:27,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 508 transitions. [2022-02-20 18:58:27,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:27,653 INFO L225 Difference]: With dead ends: 895 [2022-02-20 18:58:27,653 INFO L226 Difference]: Without dead ends: 605 [2022-02-20 18:58:27,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:27,655 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 119 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:27,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 416 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:27,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-02-20 18:58:27,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603. [2022-02-20 18:58:27,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:27,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 605 states. Second operand has 603 states, 602 states have (on average 1.6079734219269104) internal successors, (968), 602 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:27,805 INFO L74 IsIncluded]: Start isIncluded. First operand 605 states. Second operand has 603 states, 602 states have (on average 1.6079734219269104) internal successors, (968), 602 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:27,806 INFO L87 Difference]: Start difference. First operand 605 states. Second operand has 603 states, 602 states have (on average 1.6079734219269104) internal successors, (968), 602 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:27,823 INFO L93 Difference]: Finished difference Result 605 states and 969 transitions. [2022-02-20 18:58:27,823 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 969 transitions. [2022-02-20 18:58:27,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:27,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:27,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 603 states, 602 states have (on average 1.6079734219269104) internal successors, (968), 602 states have internal predecessors, (968), 0 states have call successors, (0), 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 605 states. [2022-02-20 18:58:27,826 INFO L87 Difference]: Start difference. First operand has 603 states, 602 states have (on average 1.6079734219269104) internal successors, (968), 602 states have internal predecessors, (968), 0 states have call successors, (0), 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 605 states. [2022-02-20 18:58:27,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:27,843 INFO L93 Difference]: Finished difference Result 605 states and 969 transitions. [2022-02-20 18:58:27,843 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 969 transitions. [2022-02-20 18:58:27,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:27,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:27,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:27,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 602 states have (on average 1.6079734219269104) internal successors, (968), 602 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 968 transitions. [2022-02-20 18:58:27,870 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 968 transitions. Word has length 66 [2022-02-20 18:58:27,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:27,870 INFO L470 AbstractCegarLoop]: Abstraction has 603 states and 968 transitions. [2022-02-20 18:58:27,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:27,871 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 968 transitions. [2022-02-20 18:58:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 18:58:27,871 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:27,872 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, 1, 1, 1, 1] [2022-02-20 18:58:27,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:58:27,872 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:27,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:27,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1666116403, now seen corresponding path program 1 times [2022-02-20 18:58:27,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:27,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563492911] [2022-02-20 18:58:27,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:27,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:27,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {6433#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(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1906~0 := 0;~__return_2055~0 := 0;~__return_2162~0 := 0; {6433#true} is VALID [2022-02-20 18:58:27,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {6433#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {6433#true} is VALID [2022-02-20 18:58:27,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {6433#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {6433#true} is VALID [2022-02-20 18:58:27,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {6433#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {6433#true} is VALID [2022-02-20 18:58:27,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {6433#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {6433#true} is VALID [2022-02-20 18:58:27,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {6433#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {6433#true} is VALID [2022-02-20 18:58:27,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {6433#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {6433#true} is VALID [2022-02-20 18:58:27,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {6433#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {6433#true} is VALID [2022-02-20 18:58:27,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {6433#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {6433#true} is VALID [2022-02-20 18:58:27,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {6433#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {6433#true} is VALID [2022-02-20 18:58:27,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {6433#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {6433#true} is VALID [2022-02-20 18:58:27,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {6433#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {6433#true} is VALID [2022-02-20 18:58:27,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {6433#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {6433#true} is VALID [2022-02-20 18:58:27,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {6433#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {6433#true} is VALID [2022-02-20 18:58:27,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {6433#true} assume ~id1~0 != ~id2~0; {6433#true} is VALID [2022-02-20 18:58:27,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {6433#true} assume ~id1~0 != ~id3~0; {6433#true} is VALID [2022-02-20 18:58:27,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {6433#true} assume ~id2~0 != ~id3~0; {6433#true} is VALID [2022-02-20 18:58:27,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {6433#true} assume ~id1~0 >= 0; {6433#true} is VALID [2022-02-20 18:58:27,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {6433#true} assume ~id2~0 >= 0; {6433#true} is VALID [2022-02-20 18:58:27,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {6433#true} assume ~id3~0 >= 0; {6433#true} is VALID [2022-02-20 18:58:27,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {6433#true} assume 0 == ~r1~0; {6433#true} is VALID [2022-02-20 18:58:27,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {6433#true} assume 0 == ~r2~0; {6433#true} is VALID [2022-02-20 18:58:27,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {6433#true} assume 0 == ~r3~0; {6433#true} is VALID [2022-02-20 18:58:27,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {6433#true} assume !(0 == main_~init__r122~0#1 % 256); {6433#true} is VALID [2022-02-20 18:58:27,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {6433#true} assume !(0 == main_~init__r132~0#1 % 256); {6433#true} is VALID [2022-02-20 18:58:27,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {6433#true} assume !(0 == main_~init__r212~0#1 % 256); {6433#true} is VALID [2022-02-20 18:58:27,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {6433#true} assume !(0 == main_~init__r232~0#1 % 256); {6433#true} is VALID [2022-02-20 18:58:27,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {6433#true} assume !(0 == main_~init__r312~0#1 % 256); {6433#true} is VALID [2022-02-20 18:58:27,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {6433#true} assume !(0 == main_~init__r322~0#1 % 256); {6433#true} is VALID [2022-02-20 18:58:27,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {6433#true} assume ~max1~0 == ~id1~0; {6433#true} is VALID [2022-02-20 18:58:27,944 INFO L290 TraceCheckUtils]: 30: Hoare triple {6433#true} assume ~max2~0 == ~id2~0; {6433#true} is VALID [2022-02-20 18:58:27,944 INFO L290 TraceCheckUtils]: 31: Hoare triple {6433#true} assume ~max3~0 == ~id3~0; {6433#true} is VALID [2022-02-20 18:58:27,944 INFO L290 TraceCheckUtils]: 32: Hoare triple {6433#true} assume 0 == ~st1~0; {6435#(<= ~st1~0 0)} is VALID [2022-02-20 18:58:27,945 INFO L290 TraceCheckUtils]: 33: Hoare triple {6435#(<= ~st1~0 0)} assume 0 == ~st2~0; {6436#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,945 INFO L290 TraceCheckUtils]: 34: Hoare triple {6436#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,945 INFO L290 TraceCheckUtils]: 35: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,946 INFO L290 TraceCheckUtils]: 36: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,946 INFO L290 TraceCheckUtils]: 37: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,946 INFO L290 TraceCheckUtils]: 38: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,946 INFO L290 TraceCheckUtils]: 39: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,947 INFO L290 TraceCheckUtils]: 40: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,947 INFO L290 TraceCheckUtils]: 41: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax1~0 % 256); {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,947 INFO L290 TraceCheckUtils]: 42: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax2~0 % 256); {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,948 INFO L290 TraceCheckUtils]: 43: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1906~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1906~0; {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,948 INFO L290 TraceCheckUtils]: 44: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,948 INFO L290 TraceCheckUtils]: 45: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,949 INFO L290 TraceCheckUtils]: 46: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,949 INFO L290 TraceCheckUtils]: 47: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 1; {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,949 INFO L290 TraceCheckUtils]: 48: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,949 INFO L290 TraceCheckUtils]: 49: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,950 INFO L290 TraceCheckUtils]: 50: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,950 INFO L290 TraceCheckUtils]: 51: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,950 INFO L290 TraceCheckUtils]: 52: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,951 INFO L290 TraceCheckUtils]: 53: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 < 2; {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,951 INFO L290 TraceCheckUtils]: 54: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,951 INFO L290 TraceCheckUtils]: 55: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,951 INFO L290 TraceCheckUtils]: 56: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,952 INFO L290 TraceCheckUtils]: 57: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,952 INFO L290 TraceCheckUtils]: 58: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,952 INFO L290 TraceCheckUtils]: 59: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 < 2; {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,953 INFO L290 TraceCheckUtils]: 60: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,953 INFO L290 TraceCheckUtils]: 61: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,953 INFO L290 TraceCheckUtils]: 62: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,954 INFO L290 TraceCheckUtils]: 63: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:27,954 INFO L290 TraceCheckUtils]: 64: Hoare triple {6437#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {6434#false} is VALID [2022-02-20 18:58:27,954 INFO L290 TraceCheckUtils]: 65: Hoare triple {6434#false} ~__return_2055~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2055~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {6434#false} is VALID [2022-02-20 18:58:27,954 INFO L290 TraceCheckUtils]: 66: Hoare triple {6434#false} assume 0 == main_~assert__arg~0#1 % 256; {6434#false} is VALID [2022-02-20 18:58:27,955 INFO L290 TraceCheckUtils]: 67: Hoare triple {6434#false} assume !false; {6434#false} is VALID [2022-02-20 18:58:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:27,955 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:27,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563492911] [2022-02-20 18:58:27,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563492911] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:27,956 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:27,956 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:58:27,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599413322] [2022-02-20 18:58:27,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:27,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2022-02-20 18:58:27,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:27,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:27,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:27,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:58:27,999 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:27,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:58:27,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:58:27,999 INFO L87 Difference]: Start difference. First operand 603 states and 968 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:30,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:30,625 INFO L93 Difference]: Finished difference Result 3079 states and 5038 transitions. [2022-02-20 18:58:30,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:58:30,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2022-02-20 18:58:30,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:30,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1118 transitions. [2022-02-20 18:58:30,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1118 transitions. [2022-02-20 18:58:30,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1118 transitions. [2022-02-20 18:58:31,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1118 edges. 1118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:31,672 INFO L225 Difference]: With dead ends: 3079 [2022-02-20 18:58:31,673 INFO L226 Difference]: Without dead ends: 2533 [2022-02-20 18:58:31,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:58:31,681 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 857 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:31,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [857 Valid, 1617 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:58:31,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2533 states. [2022-02-20 18:58:32,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2533 to 1131. [2022-02-20 18:58:32,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:32,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2533 states. Second operand has 1131 states, 1130 states have (on average 1.6176991150442477) internal successors, (1828), 1130 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:32,502 INFO L74 IsIncluded]: Start isIncluded. First operand 2533 states. Second operand has 1131 states, 1130 states have (on average 1.6176991150442477) internal successors, (1828), 1130 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:32,504 INFO L87 Difference]: Start difference. First operand 2533 states. Second operand has 1131 states, 1130 states have (on average 1.6176991150442477) internal successors, (1828), 1130 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:32,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:32,685 INFO L93 Difference]: Finished difference Result 2533 states and 4115 transitions. [2022-02-20 18:58:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 4115 transitions. [2022-02-20 18:58:32,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:32,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:32,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 1131 states, 1130 states have (on average 1.6176991150442477) internal successors, (1828), 1130 states have internal predecessors, (1828), 0 states have call successors, (0), 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 2533 states. [2022-02-20 18:58:32,692 INFO L87 Difference]: Start difference. First operand has 1131 states, 1130 states have (on average 1.6176991150442477) internal successors, (1828), 1130 states have internal predecessors, (1828), 0 states have call successors, (0), 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 2533 states. [2022-02-20 18:58:32,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:32,862 INFO L93 Difference]: Finished difference Result 2533 states and 4115 transitions. [2022-02-20 18:58:32,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 4115 transitions. [2022-02-20 18:58:32,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:32,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:32,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:32,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:32,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1130 states have (on average 1.6176991150442477) internal successors, (1828), 1130 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1828 transitions. [2022-02-20 18:58:32,917 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1828 transitions. Word has length 68 [2022-02-20 18:58:32,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:32,917 INFO L470 AbstractCegarLoop]: Abstraction has 1131 states and 1828 transitions. [2022-02-20 18:58:32,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1828 transitions. [2022-02-20 18:58:32,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:58:32,919 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:32,919 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, 1, 1, 1, 1, 1] [2022-02-20 18:58:32,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:58:32,921 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:32,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:32,921 INFO L85 PathProgramCache]: Analyzing trace with hash 47496755, now seen corresponding path program 1 times [2022-02-20 18:58:32,922 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:32,922 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700136091] [2022-02-20 18:58:32,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:32,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:33,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {17397#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(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1906~0 := 0;~__return_2055~0 := 0;~__return_2162~0 := 0; {17397#true} is VALID [2022-02-20 18:58:33,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {17397#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {17397#true} is VALID [2022-02-20 18:58:33,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {17397#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {17397#true} is VALID [2022-02-20 18:58:33,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {17397#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {17397#true} is VALID [2022-02-20 18:58:33,015 INFO L290 TraceCheckUtils]: 4: Hoare triple {17397#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {17397#true} is VALID [2022-02-20 18:58:33,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {17397#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {17397#true} is VALID [2022-02-20 18:58:33,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {17397#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {17397#true} is VALID [2022-02-20 18:58:33,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {17397#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {17397#true} is VALID [2022-02-20 18:58:33,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {17397#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {17397#true} is VALID [2022-02-20 18:58:33,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {17397#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {17397#true} is VALID [2022-02-20 18:58:33,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {17397#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {17397#true} is VALID [2022-02-20 18:58:33,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {17397#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {17397#true} is VALID [2022-02-20 18:58:33,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {17397#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {17397#true} is VALID [2022-02-20 18:58:33,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {17397#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {17397#true} is VALID [2022-02-20 18:58:33,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {17397#true} assume ~id1~0 != ~id2~0; {17397#true} is VALID [2022-02-20 18:58:33,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {17397#true} assume ~id1~0 != ~id3~0; {17397#true} is VALID [2022-02-20 18:58:33,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {17397#true} assume ~id2~0 != ~id3~0; {17397#true} is VALID [2022-02-20 18:58:33,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {17397#true} assume ~id1~0 >= 0; {17397#true} is VALID [2022-02-20 18:58:33,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {17397#true} assume ~id2~0 >= 0; {17397#true} is VALID [2022-02-20 18:58:33,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {17397#true} assume ~id3~0 >= 0; {17397#true} is VALID [2022-02-20 18:58:33,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {17397#true} assume 0 == ~r1~0; {17397#true} is VALID [2022-02-20 18:58:33,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {17397#true} assume 0 == ~r2~0; {17397#true} is VALID [2022-02-20 18:58:33,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {17397#true} assume 0 == ~r3~0; {17397#true} is VALID [2022-02-20 18:58:33,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {17397#true} assume !(0 == main_~init__r122~0#1 % 256); {17397#true} is VALID [2022-02-20 18:58:33,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {17397#true} assume !(0 == main_~init__r132~0#1 % 256); {17397#true} is VALID [2022-02-20 18:58:33,018 INFO L290 TraceCheckUtils]: 25: Hoare triple {17397#true} assume !(0 == main_~init__r212~0#1 % 256); {17397#true} is VALID [2022-02-20 18:58:33,018 INFO L290 TraceCheckUtils]: 26: Hoare triple {17397#true} assume !(0 == main_~init__r232~0#1 % 256); {17397#true} is VALID [2022-02-20 18:58:33,018 INFO L290 TraceCheckUtils]: 27: Hoare triple {17397#true} assume !(0 == main_~init__r312~0#1 % 256); {17397#true} is VALID [2022-02-20 18:58:33,018 INFO L290 TraceCheckUtils]: 28: Hoare triple {17397#true} assume !(0 == main_~init__r322~0#1 % 256); {17397#true} is VALID [2022-02-20 18:58:33,018 INFO L290 TraceCheckUtils]: 29: Hoare triple {17397#true} assume ~max1~0 == ~id1~0; {17397#true} is VALID [2022-02-20 18:58:33,018 INFO L290 TraceCheckUtils]: 30: Hoare triple {17397#true} assume ~max2~0 == ~id2~0; {17397#true} is VALID [2022-02-20 18:58:33,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {17397#true} assume ~max3~0 == ~id3~0; {17397#true} is VALID [2022-02-20 18:58:33,019 INFO L290 TraceCheckUtils]: 32: Hoare triple {17397#true} assume 0 == ~st1~0; {17399#(<= ~st1~0 0)} is VALID [2022-02-20 18:58:33,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {17399#(<= ~st1~0 0)} assume 0 == ~st2~0; {17399#(<= ~st1~0 0)} is VALID [2022-02-20 18:58:33,019 INFO L290 TraceCheckUtils]: 34: Hoare triple {17399#(<= ~st1~0 0)} assume 0 == ~st3~0; {17399#(<= ~st1~0 0)} is VALID [2022-02-20 18:58:33,020 INFO L290 TraceCheckUtils]: 35: Hoare triple {17399#(<= ~st1~0 0)} assume 0 == ~nl1~0; {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,020 INFO L290 TraceCheckUtils]: 36: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,020 INFO L290 TraceCheckUtils]: 37: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,021 INFO L290 TraceCheckUtils]: 38: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,021 INFO L290 TraceCheckUtils]: 39: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,021 INFO L290 TraceCheckUtils]: 40: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,021 INFO L290 TraceCheckUtils]: 41: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax1~0 % 256); {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,022 INFO L290 TraceCheckUtils]: 42: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax2~0 % 256); {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,023 INFO L290 TraceCheckUtils]: 43: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1906~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1906~0; {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,024 INFO L290 TraceCheckUtils]: 44: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,024 INFO L290 TraceCheckUtils]: 45: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,025 INFO L290 TraceCheckUtils]: 46: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,025 INFO L290 TraceCheckUtils]: 47: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 < 1; {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,025 INFO L290 TraceCheckUtils]: 48: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,026 INFO L290 TraceCheckUtils]: 49: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,026 INFO L290 TraceCheckUtils]: 50: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,026 INFO L290 TraceCheckUtils]: 51: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,026 INFO L290 TraceCheckUtils]: 52: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,027 INFO L290 TraceCheckUtils]: 53: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 < 2; {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,027 INFO L290 TraceCheckUtils]: 54: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,027 INFO L290 TraceCheckUtils]: 55: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,028 INFO L290 TraceCheckUtils]: 56: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,028 INFO L290 TraceCheckUtils]: 57: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,028 INFO L290 TraceCheckUtils]: 58: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,028 INFO L290 TraceCheckUtils]: 59: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 < 2; {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,029 INFO L290 TraceCheckUtils]: 60: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,029 INFO L290 TraceCheckUtils]: 61: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,029 INFO L290 TraceCheckUtils]: 62: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,030 INFO L290 TraceCheckUtils]: 63: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,030 INFO L290 TraceCheckUtils]: 64: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {17400#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:33,030 INFO L290 TraceCheckUtils]: 65: Hoare triple {17400#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);main_~check__tmp~0#1 := 0; {17398#false} is VALID [2022-02-20 18:58:33,030 INFO L290 TraceCheckUtils]: 66: Hoare triple {17398#false} ~__return_2055~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2055~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {17398#false} is VALID [2022-02-20 18:58:33,030 INFO L290 TraceCheckUtils]: 67: Hoare triple {17398#false} assume 0 == main_~assert__arg~0#1 % 256; {17398#false} is VALID [2022-02-20 18:58:33,031 INFO L290 TraceCheckUtils]: 68: Hoare triple {17398#false} assume !false; {17398#false} is VALID [2022-02-20 18:58:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:33,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:33,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700136091] [2022-02-20 18:58:33,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700136091] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:33,032 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:33,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:58:33,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311863256] [2022-02-20 18:58:33,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:33,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-02-20 18:58:33,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:33,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:33,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:33,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:58:33,078 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:33,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:58:33,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:58:33,078 INFO L87 Difference]: Start difference. First operand 1131 states and 1828 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:36,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:36,229 INFO L93 Difference]: Finished difference Result 4121 states and 6711 transitions. [2022-02-20 18:58:36,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:58:36,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-02-20 18:58:36,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:36,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 671 transitions. [2022-02-20 18:58:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 671 transitions. [2022-02-20 18:58:36,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 671 transitions. [2022-02-20 18:58:36,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 671 edges. 671 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:36,929 INFO L225 Difference]: With dead ends: 4121 [2022-02-20 18:58:36,930 INFO L226 Difference]: Without dead ends: 3047 [2022-02-20 18:58:36,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:58:36,932 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 430 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:36,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 755 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:36,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3047 states. [2022-02-20 18:58:38,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3047 to 2080. [2022-02-20 18:58:38,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:38,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3047 states. Second operand has 2080 states, 2079 states have (on average 1.618085618085618) internal successors, (3364), 2079 states have internal predecessors, (3364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:38,219 INFO L74 IsIncluded]: Start isIncluded. First operand 3047 states. Second operand has 2080 states, 2079 states have (on average 1.618085618085618) internal successors, (3364), 2079 states have internal predecessors, (3364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:38,222 INFO L87 Difference]: Start difference. First operand 3047 states. Second operand has 2080 states, 2079 states have (on average 1.618085618085618) internal successors, (3364), 2079 states have internal predecessors, (3364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:38,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:38,463 INFO L93 Difference]: Finished difference Result 3047 states and 4944 transitions. [2022-02-20 18:58:38,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3047 states and 4944 transitions. [2022-02-20 18:58:38,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:38,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:38,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 2080 states, 2079 states have (on average 1.618085618085618) internal successors, (3364), 2079 states have internal predecessors, (3364), 0 states have call successors, (0), 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 3047 states. [2022-02-20 18:58:38,475 INFO L87 Difference]: Start difference. First operand has 2080 states, 2079 states have (on average 1.618085618085618) internal successors, (3364), 2079 states have internal predecessors, (3364), 0 states have call successors, (0), 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 3047 states. [2022-02-20 18:58:38,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:38,706 INFO L93 Difference]: Finished difference Result 3047 states and 4944 transitions. [2022-02-20 18:58:38,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3047 states and 4944 transitions. [2022-02-20 18:58:38,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:38,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:38,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:38,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2080 states, 2079 states have (on average 1.618085618085618) internal successors, (3364), 2079 states have internal predecessors, (3364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 2080 states and 3364 transitions. [2022-02-20 18:58:38,884 INFO L78 Accepts]: Start accepts. Automaton has 2080 states and 3364 transitions. Word has length 69 [2022-02-20 18:58:38,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:38,885 INFO L470 AbstractCegarLoop]: Abstraction has 2080 states and 3364 transitions. [2022-02-20 18:58:38,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:38,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2080 states and 3364 transitions. [2022-02-20 18:58:38,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:58:38,887 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:38,887 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, 1, 1, 1, 1, 1, 1] [2022-02-20 18:58:38,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:58:38,887 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:38,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:38,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1156873170, now seen corresponding path program 1 times [2022-02-20 18:58:38,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:38,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234392402] [2022-02-20 18:58:38,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:38,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:38,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {32188#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(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1906~0 := 0;~__return_2055~0 := 0;~__return_2162~0 := 0; {32188#true} is VALID [2022-02-20 18:58:38,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {32188#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {32188#true} is VALID [2022-02-20 18:58:38,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {32188#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {32188#true} is VALID [2022-02-20 18:58:38,934 INFO L290 TraceCheckUtils]: 3: Hoare triple {32188#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {32188#true} is VALID [2022-02-20 18:58:38,934 INFO L290 TraceCheckUtils]: 4: Hoare triple {32188#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {32188#true} is VALID [2022-02-20 18:58:38,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {32188#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {32188#true} is VALID [2022-02-20 18:58:38,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {32188#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {32188#true} is VALID [2022-02-20 18:58:38,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {32188#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {32188#true} is VALID [2022-02-20 18:58:38,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {32188#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {32188#true} is VALID [2022-02-20 18:58:38,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {32188#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {32188#true} is VALID [2022-02-20 18:58:38,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {32188#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {32188#true} is VALID [2022-02-20 18:58:38,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {32188#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {32188#true} is VALID [2022-02-20 18:58:38,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {32188#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {32188#true} is VALID [2022-02-20 18:58:38,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {32188#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {32188#true} is VALID [2022-02-20 18:58:38,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {32188#true} assume ~id1~0 != ~id2~0; {32188#true} is VALID [2022-02-20 18:58:38,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {32188#true} assume ~id1~0 != ~id3~0; {32188#true} is VALID [2022-02-20 18:58:38,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {32188#true} assume ~id2~0 != ~id3~0; {32188#true} is VALID [2022-02-20 18:58:38,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {32188#true} assume ~id1~0 >= 0; {32188#true} is VALID [2022-02-20 18:58:38,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {32188#true} assume ~id2~0 >= 0; {32188#true} is VALID [2022-02-20 18:58:38,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {32188#true} assume ~id3~0 >= 0; {32188#true} is VALID [2022-02-20 18:58:38,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {32188#true} assume 0 == ~r1~0; {32188#true} is VALID [2022-02-20 18:58:38,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {32188#true} assume 0 == ~r2~0; {32188#true} is VALID [2022-02-20 18:58:38,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {32188#true} assume 0 == ~r3~0; {32188#true} is VALID [2022-02-20 18:58:38,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {32188#true} assume !(0 == main_~init__r122~0#1 % 256); {32188#true} is VALID [2022-02-20 18:58:38,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {32188#true} assume !(0 == main_~init__r132~0#1 % 256); {32188#true} is VALID [2022-02-20 18:58:38,937 INFO L290 TraceCheckUtils]: 25: Hoare triple {32188#true} assume !(0 == main_~init__r212~0#1 % 256); {32188#true} is VALID [2022-02-20 18:58:38,937 INFO L290 TraceCheckUtils]: 26: Hoare triple {32188#true} assume !(0 == main_~init__r232~0#1 % 256); {32188#true} is VALID [2022-02-20 18:58:38,937 INFO L290 TraceCheckUtils]: 27: Hoare triple {32188#true} assume !(0 == main_~init__r312~0#1 % 256); {32188#true} is VALID [2022-02-20 18:58:38,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {32188#true} assume !(0 == main_~init__r322~0#1 % 256); {32188#true} is VALID [2022-02-20 18:58:38,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {32188#true} assume ~max1~0 == ~id1~0; {32188#true} is VALID [2022-02-20 18:58:38,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {32188#true} assume ~max2~0 == ~id2~0; {32188#true} is VALID [2022-02-20 18:58:38,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {32188#true} assume ~max3~0 == ~id3~0; {32188#true} is VALID [2022-02-20 18:58:38,938 INFO L290 TraceCheckUtils]: 32: Hoare triple {32188#true} assume 0 == ~st1~0; {32188#true} is VALID [2022-02-20 18:58:38,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {32188#true} assume 0 == ~st2~0; {32188#true} is VALID [2022-02-20 18:58:38,938 INFO L290 TraceCheckUtils]: 34: Hoare triple {32188#true} assume 0 == ~st3~0; {32188#true} is VALID [2022-02-20 18:58:38,938 INFO L290 TraceCheckUtils]: 35: Hoare triple {32188#true} assume 0 == ~nl1~0; {32188#true} is VALID [2022-02-20 18:58:38,938 INFO L290 TraceCheckUtils]: 36: Hoare triple {32188#true} assume 0 == ~nl2~0; {32188#true} is VALID [2022-02-20 18:58:38,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {32188#true} assume 0 == ~nl3~0; {32188#true} is VALID [2022-02-20 18:58:38,939 INFO L290 TraceCheckUtils]: 38: Hoare triple {32188#true} assume 0 == ~mode1~0 % 256; {32190#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:38,939 INFO L290 TraceCheckUtils]: 39: Hoare triple {32190#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {32190#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:38,939 INFO L290 TraceCheckUtils]: 40: Hoare triple {32190#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {32190#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:38,940 INFO L290 TraceCheckUtils]: 41: Hoare triple {32190#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax1~0 % 256); {32190#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:38,940 INFO L290 TraceCheckUtils]: 42: Hoare triple {32190#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax2~0 % 256); {32190#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:38,940 INFO L290 TraceCheckUtils]: 43: Hoare triple {32190#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1906~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1906~0; {32190#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:38,941 INFO L290 TraceCheckUtils]: 44: Hoare triple {32190#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {32190#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:38,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {32190#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {32190#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:38,942 INFO L290 TraceCheckUtils]: 46: Hoare triple {32190#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {32189#false} is VALID [2022-02-20 18:58:38,942 INFO L290 TraceCheckUtils]: 47: Hoare triple {32189#false} assume !!(0 == ~ep21~0 % 256); {32189#false} is VALID [2022-02-20 18:58:38,942 INFO L290 TraceCheckUtils]: 48: Hoare triple {32189#false} assume !!(0 == ~ep31~0 % 256); {32189#false} is VALID [2022-02-20 18:58:38,942 INFO L290 TraceCheckUtils]: 49: Hoare triple {32189#false} ~newmax1~0 := main_~node1__newmax~0#1; {32189#false} is VALID [2022-02-20 18:58:38,942 INFO L290 TraceCheckUtils]: 50: Hoare triple {32189#false} assume 2 == ~r1~0; {32189#false} is VALID [2022-02-20 18:58:38,942 INFO L290 TraceCheckUtils]: 51: Hoare triple {32189#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {32189#false} is VALID [2022-02-20 18:58:38,942 INFO L290 TraceCheckUtils]: 52: Hoare triple {32189#false} ~mode1~0 := 0; {32189#false} is VALID [2022-02-20 18:58:38,943 INFO L290 TraceCheckUtils]: 53: Hoare triple {32189#false} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {32189#false} is VALID [2022-02-20 18:58:38,943 INFO L290 TraceCheckUtils]: 54: Hoare triple {32189#false} assume !!(0 == ~mode2~0 % 256); {32189#false} is VALID [2022-02-20 18:58:38,943 INFO L290 TraceCheckUtils]: 55: Hoare triple {32189#false} assume ~r2~0 < 2; {32189#false} is VALID [2022-02-20 18:58:38,943 INFO L290 TraceCheckUtils]: 56: Hoare triple {32189#false} assume !!(0 == ~ep21~0 % 256); {32189#false} is VALID [2022-02-20 18:58:38,943 INFO L290 TraceCheckUtils]: 57: Hoare triple {32189#false} assume !!(0 == ~ep23~0 % 256); {32189#false} is VALID [2022-02-20 18:58:38,943 INFO L290 TraceCheckUtils]: 58: Hoare triple {32189#false} ~mode2~0 := 1; {32189#false} is VALID [2022-02-20 18:58:38,943 INFO L290 TraceCheckUtils]: 59: Hoare triple {32189#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {32189#false} is VALID [2022-02-20 18:58:38,943 INFO L290 TraceCheckUtils]: 60: Hoare triple {32189#false} assume !!(0 == ~mode3~0 % 256); {32189#false} is VALID [2022-02-20 18:58:38,944 INFO L290 TraceCheckUtils]: 61: Hoare triple {32189#false} assume ~r3~0 < 2; {32189#false} is VALID [2022-02-20 18:58:38,944 INFO L290 TraceCheckUtils]: 62: Hoare triple {32189#false} assume !!(0 == ~ep31~0 % 256); {32189#false} is VALID [2022-02-20 18:58:38,944 INFO L290 TraceCheckUtils]: 63: Hoare triple {32189#false} assume !!(0 == ~ep32~0 % 256); {32189#false} is VALID [2022-02-20 18:58:38,944 INFO L290 TraceCheckUtils]: 64: Hoare triple {32189#false} ~mode3~0 := 1; {32189#false} is VALID [2022-02-20 18:58:38,944 INFO L290 TraceCheckUtils]: 65: Hoare triple {32189#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {32189#false} is VALID [2022-02-20 18:58:38,944 INFO L290 TraceCheckUtils]: 66: Hoare triple {32189#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {32189#false} is VALID [2022-02-20 18:58:38,944 INFO L290 TraceCheckUtils]: 67: Hoare triple {32189#false} ~__return_2055~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2055~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {32189#false} is VALID [2022-02-20 18:58:38,944 INFO L290 TraceCheckUtils]: 68: Hoare triple {32189#false} assume 0 == main_~assert__arg~0#1 % 256; {32189#false} is VALID [2022-02-20 18:58:38,944 INFO L290 TraceCheckUtils]: 69: Hoare triple {32189#false} assume !false; {32189#false} is VALID [2022-02-20 18:58:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:38,945 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:38,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234392402] [2022-02-20 18:58:38,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234392402] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:38,945 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:38,945 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:38,945 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910283408] [2022-02-20 18:58:38,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:38,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-02-20 18:58:38,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:38,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:38,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:38,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:38,984 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:38,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:38,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:38,985 INFO L87 Difference]: Start difference. First operand 2080 states and 3364 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:42,129 INFO L93 Difference]: Finished difference Result 4970 states and 8089 transitions. [2022-02-20 18:58:42,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:42,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-02-20 18:58:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-02-20 18:58:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-02-20 18:58:42,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 485 transitions. [2022-02-20 18:58:42,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 485 edges. 485 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:42,773 INFO L225 Difference]: With dead ends: 4970 [2022-02-20 18:58:42,773 INFO L226 Difference]: Without dead ends: 2947 [2022-02-20 18:58:42,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:42,776 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 132 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:42,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 512 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:42,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2022-02-20 18:58:44,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 2945. [2022-02-20 18:58:44,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:44,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2947 states. Second operand has 2945 states, 2944 states have (on average 1.6246603260869565) internal successors, (4783), 2944 states have internal predecessors, (4783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:44,318 INFO L74 IsIncluded]: Start isIncluded. First operand 2947 states. Second operand has 2945 states, 2944 states have (on average 1.6246603260869565) internal successors, (4783), 2944 states have internal predecessors, (4783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:44,320 INFO L87 Difference]: Start difference. First operand 2947 states. Second operand has 2945 states, 2944 states have (on average 1.6246603260869565) internal successors, (4783), 2944 states have internal predecessors, (4783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:44,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:44,536 INFO L93 Difference]: Finished difference Result 2947 states and 4784 transitions. [2022-02-20 18:58:44,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 4784 transitions. [2022-02-20 18:58:44,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:44,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:44,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 2945 states, 2944 states have (on average 1.6246603260869565) internal successors, (4783), 2944 states have internal predecessors, (4783), 0 states have call successors, (0), 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 2947 states. [2022-02-20 18:58:44,545 INFO L87 Difference]: Start difference. First operand has 2945 states, 2944 states have (on average 1.6246603260869565) internal successors, (4783), 2944 states have internal predecessors, (4783), 0 states have call successors, (0), 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 2947 states. [2022-02-20 18:58:44,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:44,763 INFO L93 Difference]: Finished difference Result 2947 states and 4784 transitions. [2022-02-20 18:58:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 4784 transitions. [2022-02-20 18:58:44,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:44,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:44,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:44,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:44,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2945 states, 2944 states have (on average 1.6246603260869565) internal successors, (4783), 2944 states have internal predecessors, (4783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:45,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 4783 transitions. [2022-02-20 18:58:45,104 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 4783 transitions. Word has length 70 [2022-02-20 18:58:45,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:45,104 INFO L470 AbstractCegarLoop]: Abstraction has 2945 states and 4783 transitions. [2022-02-20 18:58:45,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 4783 transitions. [2022-02-20 18:58:45,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:58:45,105 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:45,105 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, 1, 1, 1, 1, 1, 1] [2022-02-20 18:58:45,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:58:45,106 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:45,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:45,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1843763252, now seen corresponding path program 1 times [2022-02-20 18:58:45,106 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:45,106 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141445172] [2022-02-20 18:58:45,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:45,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:45,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {49187#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(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1906~0 := 0;~__return_2055~0 := 0;~__return_2162~0 := 0; {49187#true} is VALID [2022-02-20 18:58:45,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {49187#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {49187#true} is VALID [2022-02-20 18:58:45,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {49187#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {49187#true} is VALID [2022-02-20 18:58:45,148 INFO L290 TraceCheckUtils]: 3: Hoare triple {49187#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {49187#true} is VALID [2022-02-20 18:58:45,148 INFO L290 TraceCheckUtils]: 4: Hoare triple {49187#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {49187#true} is VALID [2022-02-20 18:58:45,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {49187#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {49187#true} is VALID [2022-02-20 18:58:45,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {49187#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {49187#true} is VALID [2022-02-20 18:58:45,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {49187#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {49187#true} is VALID [2022-02-20 18:58:45,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {49187#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {49187#true} is VALID [2022-02-20 18:58:45,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {49187#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {49187#true} is VALID [2022-02-20 18:58:45,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {49187#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {49187#true} is VALID [2022-02-20 18:58:45,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {49187#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {49187#true} is VALID [2022-02-20 18:58:45,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {49187#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {49187#true} is VALID [2022-02-20 18:58:45,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {49187#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {49187#true} is VALID [2022-02-20 18:58:45,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {49187#true} assume ~id1~0 != ~id2~0; {49187#true} is VALID [2022-02-20 18:58:45,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {49187#true} assume ~id1~0 != ~id3~0; {49187#true} is VALID [2022-02-20 18:58:45,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {49187#true} assume ~id2~0 != ~id3~0; {49187#true} is VALID [2022-02-20 18:58:45,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {49187#true} assume ~id1~0 >= 0; {49187#true} is VALID [2022-02-20 18:58:45,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {49187#true} assume ~id2~0 >= 0; {49187#true} is VALID [2022-02-20 18:58:45,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {49187#true} assume ~id3~0 >= 0; {49187#true} is VALID [2022-02-20 18:58:45,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {49187#true} assume 0 == ~r1~0; {49187#true} is VALID [2022-02-20 18:58:45,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {49187#true} assume 0 == ~r2~0; {49187#true} is VALID [2022-02-20 18:58:45,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {49187#true} assume 0 == ~r3~0; {49187#true} is VALID [2022-02-20 18:58:45,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {49187#true} assume !(0 == main_~init__r122~0#1 % 256); {49187#true} is VALID [2022-02-20 18:58:45,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {49187#true} assume !(0 == main_~init__r132~0#1 % 256); {49187#true} is VALID [2022-02-20 18:58:45,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {49187#true} assume !(0 == main_~init__r212~0#1 % 256); {49187#true} is VALID [2022-02-20 18:58:45,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {49187#true} assume !(0 == main_~init__r232~0#1 % 256); {49187#true} is VALID [2022-02-20 18:58:45,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {49187#true} assume !(0 == main_~init__r312~0#1 % 256); {49187#true} is VALID [2022-02-20 18:58:45,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {49187#true} assume !(0 == main_~init__r322~0#1 % 256); {49187#true} is VALID [2022-02-20 18:58:45,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {49187#true} assume ~max1~0 == ~id1~0; {49187#true} is VALID [2022-02-20 18:58:45,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {49187#true} assume ~max2~0 == ~id2~0; {49187#true} is VALID [2022-02-20 18:58:45,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {49187#true} assume ~max3~0 == ~id3~0; {49187#true} is VALID [2022-02-20 18:58:45,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {49187#true} assume 0 == ~st1~0; {49187#true} is VALID [2022-02-20 18:58:45,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {49187#true} assume 0 == ~st2~0; {49187#true} is VALID [2022-02-20 18:58:45,151 INFO L290 TraceCheckUtils]: 34: Hoare triple {49187#true} assume 0 == ~st3~0; {49187#true} is VALID [2022-02-20 18:58:45,151 INFO L290 TraceCheckUtils]: 35: Hoare triple {49187#true} assume 0 == ~nl1~0; {49187#true} is VALID [2022-02-20 18:58:45,151 INFO L290 TraceCheckUtils]: 36: Hoare triple {49187#true} assume 0 == ~nl2~0; {49187#true} is VALID [2022-02-20 18:58:45,151 INFO L290 TraceCheckUtils]: 37: Hoare triple {49187#true} assume 0 == ~nl3~0; {49187#true} is VALID [2022-02-20 18:58:45,152 INFO L290 TraceCheckUtils]: 38: Hoare triple {49187#true} assume 0 == ~mode1~0 % 256; {49187#true} is VALID [2022-02-20 18:58:45,152 INFO L290 TraceCheckUtils]: 39: Hoare triple {49187#true} assume 0 == ~mode2~0 % 256; {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:45,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:45,153 INFO L290 TraceCheckUtils]: 41: Hoare triple {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~newmax1~0 % 256); {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:45,153 INFO L290 TraceCheckUtils]: 42: Hoare triple {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~newmax2~0 % 256); {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:45,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1906~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1906~0; {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:45,154 INFO L290 TraceCheckUtils]: 44: Hoare triple {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:45,154 INFO L290 TraceCheckUtils]: 45: Hoare triple {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:45,155 INFO L290 TraceCheckUtils]: 46: Hoare triple {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256); {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:45,155 INFO L290 TraceCheckUtils]: 47: Hoare triple {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 < 1; {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:45,155 INFO L290 TraceCheckUtils]: 48: Hoare triple {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~ep12~0 % 256); {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:45,156 INFO L290 TraceCheckUtils]: 49: Hoare triple {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~ep13~0 % 256); {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:45,156 INFO L290 TraceCheckUtils]: 50: Hoare triple {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:45,156 INFO L290 TraceCheckUtils]: 51: Hoare triple {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:45,157 INFO L290 TraceCheckUtils]: 52: Hoare triple {49189#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {49188#false} is VALID [2022-02-20 18:58:45,157 INFO L290 TraceCheckUtils]: 53: Hoare triple {49188#false} assume !!(0 == ~ep12~0 % 256); {49188#false} is VALID [2022-02-20 18:58:45,157 INFO L290 TraceCheckUtils]: 54: Hoare triple {49188#false} assume !!(0 == ~ep32~0 % 256); {49188#false} is VALID [2022-02-20 18:58:45,157 INFO L290 TraceCheckUtils]: 55: Hoare triple {49188#false} ~newmax2~0 := main_~node2__newmax~0#1; {49188#false} is VALID [2022-02-20 18:58:45,158 INFO L290 TraceCheckUtils]: 56: Hoare triple {49188#false} assume 2 == ~r2~0; {49188#false} is VALID [2022-02-20 18:58:45,158 INFO L290 TraceCheckUtils]: 57: Hoare triple {49188#false} assume ~max2~0 == ~id2~0;~st2~0 := 1; {49188#false} is VALID [2022-02-20 18:58:45,158 INFO L290 TraceCheckUtils]: 58: Hoare triple {49188#false} ~mode2~0 := 0; {49188#false} is VALID [2022-02-20 18:58:45,158 INFO L290 TraceCheckUtils]: 59: Hoare triple {49188#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {49188#false} is VALID [2022-02-20 18:58:45,158 INFO L290 TraceCheckUtils]: 60: Hoare triple {49188#false} assume !!(0 == ~mode3~0 % 256); {49188#false} is VALID [2022-02-20 18:58:45,158 INFO L290 TraceCheckUtils]: 61: Hoare triple {49188#false} assume ~r3~0 < 2; {49188#false} is VALID [2022-02-20 18:58:45,158 INFO L290 TraceCheckUtils]: 62: Hoare triple {49188#false} assume !!(0 == ~ep31~0 % 256); {49188#false} is VALID [2022-02-20 18:58:45,158 INFO L290 TraceCheckUtils]: 63: Hoare triple {49188#false} assume !!(0 == ~ep32~0 % 256); {49188#false} is VALID [2022-02-20 18:58:45,158 INFO L290 TraceCheckUtils]: 64: Hoare triple {49188#false} ~mode3~0 := 1; {49188#false} is VALID [2022-02-20 18:58:45,159 INFO L290 TraceCheckUtils]: 65: Hoare triple {49188#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {49188#false} is VALID [2022-02-20 18:58:45,159 INFO L290 TraceCheckUtils]: 66: Hoare triple {49188#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {49188#false} is VALID [2022-02-20 18:58:45,159 INFO L290 TraceCheckUtils]: 67: Hoare triple {49188#false} ~__return_2055~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2055~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {49188#false} is VALID [2022-02-20 18:58:45,159 INFO L290 TraceCheckUtils]: 68: Hoare triple {49188#false} assume 0 == main_~assert__arg~0#1 % 256; {49188#false} is VALID [2022-02-20 18:58:45,159 INFO L290 TraceCheckUtils]: 69: Hoare triple {49188#false} assume !false; {49188#false} is VALID [2022-02-20 18:58:45,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:45,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:45,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141445172] [2022-02-20 18:58:45,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141445172] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:45,160 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:45,160 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:45,160 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572891501] [2022-02-20 18:58:45,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:45,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-02-20 18:58:45,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:45,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:45,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:45,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:45,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:45,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:45,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:45,218 INFO L87 Difference]: Start difference. First operand 2945 states and 4783 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:49,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:49,006 INFO L93 Difference]: Finished difference Result 5677 states and 9250 transitions. [2022-02-20 18:58:49,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:49,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-02-20 18:58:49,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-02-20 18:58:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:49,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-02-20 18:58:49,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 485 transitions. [2022-02-20 18:58:49,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 485 edges. 485 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:49,861 INFO L225 Difference]: With dead ends: 5677 [2022-02-20 18:58:49,861 INFO L226 Difference]: Without dead ends: 4055 [2022-02-20 18:58:49,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:49,864 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 126 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:49,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 498 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:49,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4055 states. [2022-02-20 18:58:51,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4055 to 4053. [2022-02-20 18:58:51,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:51,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4055 states. Second operand has 4053 states, 4052 states have (on average 1.6187068114511352) internal successors, (6559), 4052 states have internal predecessors, (6559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:51,996 INFO L74 IsIncluded]: Start isIncluded. First operand 4055 states. Second operand has 4053 states, 4052 states have (on average 1.6187068114511352) internal successors, (6559), 4052 states have internal predecessors, (6559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:51,999 INFO L87 Difference]: Start difference. First operand 4055 states. Second operand has 4053 states, 4052 states have (on average 1.6187068114511352) internal successors, (6559), 4052 states have internal predecessors, (6559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:52,475 INFO L93 Difference]: Finished difference Result 4055 states and 6560 transitions. [2022-02-20 18:58:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 4055 states and 6560 transitions. [2022-02-20 18:58:52,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:52,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:52,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 4053 states, 4052 states have (on average 1.6187068114511352) internal successors, (6559), 4052 states have internal predecessors, (6559), 0 states have call successors, (0), 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 4055 states. [2022-02-20 18:58:52,489 INFO L87 Difference]: Start difference. First operand has 4053 states, 4052 states have (on average 1.6187068114511352) internal successors, (6559), 4052 states have internal predecessors, (6559), 0 states have call successors, (0), 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 4055 states. [2022-02-20 18:58:52,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:52,960 INFO L93 Difference]: Finished difference Result 4055 states and 6560 transitions. [2022-02-20 18:58:52,960 INFO L276 IsEmpty]: Start isEmpty. Operand 4055 states and 6560 transitions. [2022-02-20 18:58:52,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:52,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:52,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:52,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:52,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4053 states, 4052 states have (on average 1.6187068114511352) internal successors, (6559), 4052 states have internal predecessors, (6559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 6559 transitions. [2022-02-20 18:58:53,646 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 6559 transitions. Word has length 70 [2022-02-20 18:58:53,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:53,646 INFO L470 AbstractCegarLoop]: Abstraction has 4053 states and 6559 transitions. [2022-02-20 18:58:53,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:53,646 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 6559 transitions. [2022-02-20 18:58:53,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:58:53,647 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:53,647 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, 1, 1, 1, 1, 1, 1] [2022-02-20 18:58:53,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:58:53,647 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:53,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:53,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1414453242, now seen corresponding path program 1 times [2022-02-20 18:58:53,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:53,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164549088] [2022-02-20 18:58:53,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:53,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:53,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {70942#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(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1906~0 := 0;~__return_2055~0 := 0;~__return_2162~0 := 0; {70942#true} is VALID [2022-02-20 18:58:53,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {70942#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {70942#true} is VALID [2022-02-20 18:58:53,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {70942#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {70942#true} is VALID [2022-02-20 18:58:53,691 INFO L290 TraceCheckUtils]: 3: Hoare triple {70942#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {70942#true} is VALID [2022-02-20 18:58:53,691 INFO L290 TraceCheckUtils]: 4: Hoare triple {70942#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {70942#true} is VALID [2022-02-20 18:58:53,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {70942#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {70942#true} is VALID [2022-02-20 18:58:53,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {70942#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {70942#true} is VALID [2022-02-20 18:58:53,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {70942#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {70942#true} is VALID [2022-02-20 18:58:53,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {70942#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {70942#true} is VALID [2022-02-20 18:58:53,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {70942#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {70942#true} is VALID [2022-02-20 18:58:53,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {70942#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {70942#true} is VALID [2022-02-20 18:58:53,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {70942#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {70942#true} is VALID [2022-02-20 18:58:53,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {70942#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {70942#true} is VALID [2022-02-20 18:58:53,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {70942#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {70942#true} is VALID [2022-02-20 18:58:53,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {70942#true} assume ~id1~0 != ~id2~0; {70942#true} is VALID [2022-02-20 18:58:53,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {70942#true} assume ~id1~0 != ~id3~0; {70942#true} is VALID [2022-02-20 18:58:53,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {70942#true} assume ~id2~0 != ~id3~0; {70942#true} is VALID [2022-02-20 18:58:53,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {70942#true} assume ~id1~0 >= 0; {70942#true} is VALID [2022-02-20 18:58:53,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {70942#true} assume ~id2~0 >= 0; {70942#true} is VALID [2022-02-20 18:58:53,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {70942#true} assume ~id3~0 >= 0; {70942#true} is VALID [2022-02-20 18:58:53,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {70942#true} assume 0 == ~r1~0; {70942#true} is VALID [2022-02-20 18:58:53,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {70942#true} assume 0 == ~r2~0; {70942#true} is VALID [2022-02-20 18:58:53,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {70942#true} assume 0 == ~r3~0; {70942#true} is VALID [2022-02-20 18:58:53,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {70942#true} assume !(0 == main_~init__r122~0#1 % 256); {70942#true} is VALID [2022-02-20 18:58:53,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {70942#true} assume !(0 == main_~init__r132~0#1 % 256); {70942#true} is VALID [2022-02-20 18:58:53,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {70942#true} assume !(0 == main_~init__r212~0#1 % 256); {70942#true} is VALID [2022-02-20 18:58:53,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {70942#true} assume !(0 == main_~init__r232~0#1 % 256); {70942#true} is VALID [2022-02-20 18:58:53,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {70942#true} assume !(0 == main_~init__r312~0#1 % 256); {70942#true} is VALID [2022-02-20 18:58:53,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {70942#true} assume !(0 == main_~init__r322~0#1 % 256); {70942#true} is VALID [2022-02-20 18:58:53,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {70942#true} assume ~max1~0 == ~id1~0; {70942#true} is VALID [2022-02-20 18:58:53,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {70942#true} assume ~max2~0 == ~id2~0; {70942#true} is VALID [2022-02-20 18:58:53,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {70942#true} assume ~max3~0 == ~id3~0; {70942#true} is VALID [2022-02-20 18:58:53,694 INFO L290 TraceCheckUtils]: 32: Hoare triple {70942#true} assume 0 == ~st1~0; {70942#true} is VALID [2022-02-20 18:58:53,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {70942#true} assume 0 == ~st2~0; {70944#(<= ~st2~0 0)} is VALID [2022-02-20 18:58:53,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {70944#(<= ~st2~0 0)} assume 0 == ~st3~0; {70944#(<= ~st2~0 0)} is VALID [2022-02-20 18:58:53,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {70944#(<= ~st2~0 0)} assume 0 == ~nl1~0; {70944#(<= ~st2~0 0)} is VALID [2022-02-20 18:58:53,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {70944#(<= ~st2~0 0)} assume 0 == ~nl2~0; {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax1~0 % 256); {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax2~0 % 256); {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1906~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1906~0; {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256); {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 < 1; {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep12~0 % 256); {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep13~0 % 256); {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,700 INFO L290 TraceCheckUtils]: 50: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,700 INFO L290 TraceCheckUtils]: 51: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,700 INFO L290 TraceCheckUtils]: 52: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256); {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,700 INFO L290 TraceCheckUtils]: 53: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 < 2; {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,701 INFO L290 TraceCheckUtils]: 54: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep21~0 % 256); {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,701 INFO L290 TraceCheckUtils]: 55: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep23~0 % 256); {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,701 INFO L290 TraceCheckUtils]: 56: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,702 INFO L290 TraceCheckUtils]: 57: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,702 INFO L290 TraceCheckUtils]: 58: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256); {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,702 INFO L290 TraceCheckUtils]: 59: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 < 2; {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,703 INFO L290 TraceCheckUtils]: 60: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep31~0 % 256); {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,703 INFO L290 TraceCheckUtils]: 61: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep32~0 % 256); {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,703 INFO L290 TraceCheckUtils]: 62: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,704 INFO L290 TraceCheckUtils]: 63: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,704 INFO L290 TraceCheckUtils]: 64: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,704 INFO L290 TraceCheckUtils]: 65: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {70945#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:53,705 INFO L290 TraceCheckUtils]: 66: Hoare triple {70945#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);main_~check__tmp~0#1 := 0; {70943#false} is VALID [2022-02-20 18:58:53,705 INFO L290 TraceCheckUtils]: 67: Hoare triple {70943#false} ~__return_2055~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2055~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {70943#false} is VALID [2022-02-20 18:58:53,705 INFO L290 TraceCheckUtils]: 68: Hoare triple {70943#false} assume 0 == main_~assert__arg~0#1 % 256; {70943#false} is VALID [2022-02-20 18:58:53,705 INFO L290 TraceCheckUtils]: 69: Hoare triple {70943#false} assume !false; {70943#false} is VALID [2022-02-20 18:58:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:53,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:53,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164549088] [2022-02-20 18:58:53,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164549088] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:53,706 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:53,706 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:58:53,706 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105297273] [2022-02-20 18:58:53,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:53,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-02-20 18:58:53,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:53,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:53,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:53,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:58:53,750 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:53,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:58:53,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:58:53,750 INFO L87 Difference]: Start difference. First operand 4053 states and 6559 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:05,913 INFO L93 Difference]: Finished difference Result 12839 states and 20847 transitions. [2022-02-20 18:59:05,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:59:05,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-02-20 18:59:05,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:59:05,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 671 transitions. [2022-02-20 18:59:05,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:05,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 671 transitions. [2022-02-20 18:59:05,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 671 transitions. [2022-02-20 18:59:06,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 671 edges. 671 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:59:09,480 INFO L225 Difference]: With dead ends: 12839 [2022-02-20 18:59:09,480 INFO L226 Difference]: Without dead ends: 8861 [2022-02-20 18:59:09,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:59:09,484 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 429 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:59:09,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 747 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:59:09,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8861 states. [2022-02-20 18:59:15,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8861 to 6434. [2022-02-20 18:59:15,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:59:15,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8861 states. Second operand has 6434 states, 6433 states have (on average 1.61168972485621) internal successors, (10368), 6433 states have internal predecessors, (10368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:15,547 INFO L74 IsIncluded]: Start isIncluded. First operand 8861 states. Second operand has 6434 states, 6433 states have (on average 1.61168972485621) internal successors, (10368), 6433 states have internal predecessors, (10368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:15,551 INFO L87 Difference]: Start difference. First operand 8861 states. Second operand has 6434 states, 6433 states have (on average 1.61168972485621) internal successors, (10368), 6433 states have internal predecessors, (10368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:17,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:17,925 INFO L93 Difference]: Finished difference Result 8861 states and 14326 transitions. [2022-02-20 18:59:17,925 INFO L276 IsEmpty]: Start isEmpty. Operand 8861 states and 14326 transitions. [2022-02-20 18:59:17,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:59:17,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:59:17,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 6434 states, 6433 states have (on average 1.61168972485621) internal successors, (10368), 6433 states have internal predecessors, (10368), 0 states have call successors, (0), 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 8861 states. [2022-02-20 18:59:17,946 INFO L87 Difference]: Start difference. First operand has 6434 states, 6433 states have (on average 1.61168972485621) internal successors, (10368), 6433 states have internal predecessors, (10368), 0 states have call successors, (0), 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 8861 states. [2022-02-20 18:59:20,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:20,310 INFO L93 Difference]: Finished difference Result 8861 states and 14326 transitions. [2022-02-20 18:59:20,310 INFO L276 IsEmpty]: Start isEmpty. Operand 8861 states and 14326 transitions. [2022-02-20 18:59:20,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:59:20,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:59:20,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:59:20,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:59:20,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6434 states, 6433 states have (on average 1.61168972485621) internal successors, (10368), 6433 states have internal predecessors, (10368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:22,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6434 states to 6434 states and 10368 transitions. [2022-02-20 18:59:22,222 INFO L78 Accepts]: Start accepts. Automaton has 6434 states and 10368 transitions. Word has length 70 [2022-02-20 18:59:22,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:59:22,223 INFO L470 AbstractCegarLoop]: Abstraction has 6434 states and 10368 transitions. [2022-02-20 18:59:22,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:22,223 INFO L276 IsEmpty]: Start isEmpty. Operand 6434 states and 10368 transitions. [2022-02-20 18:59:22,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:59:22,223 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:59:22,223 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, 1, 1, 1, 1, 1, 1] [2022-02-20 18:59:22,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:59:22,224 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:59:22,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:59:22,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1510229994, now seen corresponding path program 1 times [2022-02-20 18:59:22,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:59:22,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859156311] [2022-02-20 18:59:22,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:59:22,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:59:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:59:22,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {115726#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(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1906~0 := 0;~__return_2055~0 := 0;~__return_2162~0 := 0; {115726#true} is VALID [2022-02-20 18:59:22,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {115726#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {115726#true} is VALID [2022-02-20 18:59:22,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {115726#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {115726#true} is VALID [2022-02-20 18:59:22,269 INFO L290 TraceCheckUtils]: 3: Hoare triple {115726#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {115726#true} is VALID [2022-02-20 18:59:22,270 INFO L290 TraceCheckUtils]: 4: Hoare triple {115726#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {115726#true} is VALID [2022-02-20 18:59:22,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {115726#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {115726#true} is VALID [2022-02-20 18:59:22,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {115726#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {115726#true} is VALID [2022-02-20 18:59:22,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {115726#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {115726#true} is VALID [2022-02-20 18:59:22,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {115726#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {115726#true} is VALID [2022-02-20 18:59:22,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {115726#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {115726#true} is VALID [2022-02-20 18:59:22,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {115726#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {115726#true} is VALID [2022-02-20 18:59:22,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {115726#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {115726#true} is VALID [2022-02-20 18:59:22,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {115726#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {115726#true} is VALID [2022-02-20 18:59:22,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {115726#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {115726#true} is VALID [2022-02-20 18:59:22,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {115726#true} assume ~id1~0 != ~id2~0; {115726#true} is VALID [2022-02-20 18:59:22,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {115726#true} assume ~id1~0 != ~id3~0; {115726#true} is VALID [2022-02-20 18:59:22,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {115726#true} assume ~id2~0 != ~id3~0; {115726#true} is VALID [2022-02-20 18:59:22,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {115726#true} assume ~id1~0 >= 0; {115726#true} is VALID [2022-02-20 18:59:22,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {115726#true} assume ~id2~0 >= 0; {115726#true} is VALID [2022-02-20 18:59:22,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {115726#true} assume ~id3~0 >= 0; {115726#true} is VALID [2022-02-20 18:59:22,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {115726#true} assume 0 == ~r1~0; {115726#true} is VALID [2022-02-20 18:59:22,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {115726#true} assume 0 == ~r2~0; {115726#true} is VALID [2022-02-20 18:59:22,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {115726#true} assume 0 == ~r3~0; {115726#true} is VALID [2022-02-20 18:59:22,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {115726#true} assume !(0 == main_~init__r122~0#1 % 256); {115726#true} is VALID [2022-02-20 18:59:22,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {115726#true} assume !(0 == main_~init__r132~0#1 % 256); {115726#true} is VALID [2022-02-20 18:59:22,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {115726#true} assume !(0 == main_~init__r212~0#1 % 256); {115726#true} is VALID [2022-02-20 18:59:22,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {115726#true} assume !(0 == main_~init__r232~0#1 % 256); {115726#true} is VALID [2022-02-20 18:59:22,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {115726#true} assume !(0 == main_~init__r312~0#1 % 256); {115726#true} is VALID [2022-02-20 18:59:22,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {115726#true} assume !(0 == main_~init__r322~0#1 % 256); {115726#true} is VALID [2022-02-20 18:59:22,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {115726#true} assume ~max1~0 == ~id1~0; {115726#true} is VALID [2022-02-20 18:59:22,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {115726#true} assume ~max2~0 == ~id2~0; {115726#true} is VALID [2022-02-20 18:59:22,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {115726#true} assume ~max3~0 == ~id3~0; {115726#true} is VALID [2022-02-20 18:59:22,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {115726#true} assume 0 == ~st1~0; {115726#true} is VALID [2022-02-20 18:59:22,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {115726#true} assume 0 == ~st2~0; {115726#true} is VALID [2022-02-20 18:59:22,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {115726#true} assume 0 == ~st3~0; {115726#true} is VALID [2022-02-20 18:59:22,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {115726#true} assume 0 == ~nl1~0; {115726#true} is VALID [2022-02-20 18:59:22,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {115726#true} assume 0 == ~nl2~0; {115726#true} is VALID [2022-02-20 18:59:22,273 INFO L290 TraceCheckUtils]: 37: Hoare triple {115726#true} assume 0 == ~nl3~0; {115726#true} is VALID [2022-02-20 18:59:22,273 INFO L290 TraceCheckUtils]: 38: Hoare triple {115726#true} assume 0 == ~mode1~0 % 256; {115726#true} is VALID [2022-02-20 18:59:22,273 INFO L290 TraceCheckUtils]: 39: Hoare triple {115726#true} assume 0 == ~mode2~0 % 256; {115726#true} is VALID [2022-02-20 18:59:22,274 INFO L290 TraceCheckUtils]: 40: Hoare triple {115726#true} assume 0 == ~mode3~0 % 256; {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:59:22,274 INFO L290 TraceCheckUtils]: 41: Hoare triple {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~newmax1~0 % 256); {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:59:22,274 INFO L290 TraceCheckUtils]: 42: Hoare triple {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~newmax2~0 % 256); {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:59:22,275 INFO L290 TraceCheckUtils]: 43: Hoare triple {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1906~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1906~0; {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:59:22,275 INFO L290 TraceCheckUtils]: 44: Hoare triple {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:59:22,275 INFO L290 TraceCheckUtils]: 45: Hoare triple {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:59:22,276 INFO L290 TraceCheckUtils]: 46: Hoare triple {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256); {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:59:22,276 INFO L290 TraceCheckUtils]: 47: Hoare triple {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 < 1; {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:59:22,276 INFO L290 TraceCheckUtils]: 48: Hoare triple {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep12~0 % 256); {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:59:22,277 INFO L290 TraceCheckUtils]: 49: Hoare triple {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep13~0 % 256); {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:59:22,277 INFO L290 TraceCheckUtils]: 50: Hoare triple {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:59:22,277 INFO L290 TraceCheckUtils]: 51: Hoare triple {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:59:22,278 INFO L290 TraceCheckUtils]: 52: Hoare triple {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256); {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:59:22,278 INFO L290 TraceCheckUtils]: 53: Hoare triple {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 < 2; {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:59:22,278 INFO L290 TraceCheckUtils]: 54: Hoare triple {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep21~0 % 256); {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:59:22,279 INFO L290 TraceCheckUtils]: 55: Hoare triple {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep23~0 % 256); {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:59:22,279 INFO L290 TraceCheckUtils]: 56: Hoare triple {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:59:22,279 INFO L290 TraceCheckUtils]: 57: Hoare triple {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:59:22,280 INFO L290 TraceCheckUtils]: 58: Hoare triple {115728#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {115727#false} is VALID [2022-02-20 18:59:22,280 INFO L290 TraceCheckUtils]: 59: Hoare triple {115727#false} assume !!(0 == ~ep13~0 % 256); {115727#false} is VALID [2022-02-20 18:59:22,280 INFO L290 TraceCheckUtils]: 60: Hoare triple {115727#false} assume !!(0 == ~ep23~0 % 256); {115727#false} is VALID [2022-02-20 18:59:22,280 INFO L290 TraceCheckUtils]: 61: Hoare triple {115727#false} ~newmax3~0 := main_~node3__newmax~0#1; {115727#false} is VALID [2022-02-20 18:59:22,280 INFO L290 TraceCheckUtils]: 62: Hoare triple {115727#false} assume 2 == ~r3~0; {115727#false} is VALID [2022-02-20 18:59:22,280 INFO L290 TraceCheckUtils]: 63: Hoare triple {115727#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {115727#false} is VALID [2022-02-20 18:59:22,281 INFO L290 TraceCheckUtils]: 64: Hoare triple {115727#false} ~mode3~0 := 0; {115727#false} is VALID [2022-02-20 18:59:22,281 INFO L290 TraceCheckUtils]: 65: Hoare triple {115727#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {115727#false} is VALID [2022-02-20 18:59:22,281 INFO L290 TraceCheckUtils]: 66: Hoare triple {115727#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {115727#false} is VALID [2022-02-20 18:59:22,281 INFO L290 TraceCheckUtils]: 67: Hoare triple {115727#false} ~__return_2055~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2055~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {115727#false} is VALID [2022-02-20 18:59:22,281 INFO L290 TraceCheckUtils]: 68: Hoare triple {115727#false} assume 0 == main_~assert__arg~0#1 % 256; {115727#false} is VALID [2022-02-20 18:59:22,281 INFO L290 TraceCheckUtils]: 69: Hoare triple {115727#false} assume !false; {115727#false} is VALID [2022-02-20 18:59:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:59:22,281 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:59:22,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859156311] [2022-02-20 18:59:22,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859156311] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:59:22,282 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:59:22,282 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:59:22,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478019253] [2022-02-20 18:59:22,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:59:22,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-02-20 18:59:22,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:59:22,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:22,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:59:22,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:59:22,317 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:59:22,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:59:22,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:59:22,317 INFO L87 Difference]: Start difference. First operand 6434 states and 10368 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:35,798 INFO L93 Difference]: Finished difference Result 12442 states and 20091 transitions. [2022-02-20 18:59:35,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:59:35,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-02-20 18:59:35,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:59:35,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-02-20 18:59:35,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-02-20 18:59:35,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 485 transitions. [2022-02-20 18:59:36,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 485 edges. 485 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.