./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.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.3.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 19261aa21d7ff8465246029ba19079abe08492ae10904d6c12d0346fe16f4773 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:58:06,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:58:06,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:58:06,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:58:06,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:58:06,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:58:06,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:58:06,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:58:06,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:58:06,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:58:06,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:58:06,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:58:06,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:58:06,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:58:07,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:58:07,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:58:07,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:58:07,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:58:07,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:58:07,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:58:07,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:58:07,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:58:07,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:58:07,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:58:07,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:58:07,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:58:07,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:58:07,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:58:07,026 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:58:07,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:58:07,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:58:07,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:58:07,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:58:07,028 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:58:07,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:58:07,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:58:07,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:58:07,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:58:07,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:58:07,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:58:07,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:58:07,031 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:07,046 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:58:07,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:58:07,046 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:58:07,046 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:58:07,047 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:58:07,047 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:58:07,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:58:07,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:58:07,048 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:58:07,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:58:07,048 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:58:07,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:58:07,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:58:07,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:58:07,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:58:07,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:58:07,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:58:07,049 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:58:07,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:58:07,049 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:58:07,050 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:58:07,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:58:07,050 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:58:07,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:58:07,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:58:07,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:58:07,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:58:07,051 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:58:07,051 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:58:07,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:58:07,051 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:58:07,051 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:58:07,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:58:07,051 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 -> 19261aa21d7ff8465246029ba19079abe08492ae10904d6c12d0346fe16f4773 [2022-02-20 18:58:07,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:58:07,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:58:07,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:58:07,293 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:58:07,294 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:58:07,294 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.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:58:07,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e07c06baf/da11ac86c181439fbb47e7b49233dfb8/FLAG059739b25 [2022-02-20 18:58:07,758 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:58:07,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:58:07,773 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e07c06baf/da11ac86c181439fbb47e7b49233dfb8/FLAG059739b25 [2022-02-20 18:58:07,788 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e07c06baf/da11ac86c181439fbb47e7b49233dfb8 [2022-02-20 18:58:07,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:58:07,791 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:58:07,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:58:07,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:58:07,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:58:07,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:58:07" (1/1) ... [2022-02-20 18:58:07,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2504d0f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:07, skipping insertion in model container [2022-02-20 18:58:07,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:58:07" (1/1) ... [2022-02-20 18:58:07,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:58:07,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:58:08,029 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.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7806,7819] [2022-02-20 18:58:08,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:58:08,074 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:58:08,127 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.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7806,7819] [2022-02-20 18:58:08,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:58:08,175 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:58:08,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:08 WrapperNode [2022-02-20 18:58:08,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:58:08,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:58:08,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:58:08,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:58:08,183 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:08" (1/1) ... [2022-02-20 18:58:08,201 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:08" (1/1) ... [2022-02-20 18:58:08,275 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 633 [2022-02-20 18:58:08,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:58:08,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:58:08,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:58:08,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:58:08,288 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:08" (1/1) ... [2022-02-20 18:58:08,288 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:08" (1/1) ... [2022-02-20 18:58:08,293 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:08" (1/1) ... [2022-02-20 18:58:08,296 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:08" (1/1) ... [2022-02-20 18:58:08,302 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:08" (1/1) ... [2022-02-20 18:58:08,306 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:08" (1/1) ... [2022-02-20 18:58:08,308 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:08" (1/1) ... [2022-02-20 18:58:08,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:58:08,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:58:08,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:58:08,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:58:08,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:08" (1/1) ... [2022-02-20 18:58:08,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:58:08,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:58:08,353 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:08,355 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:08,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:58:08,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:58:08,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:58:08,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:58:08,476 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:58:08,477 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:58:08,955 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:58:08,960 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:58:08,961 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:58:08,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:58:08 BoogieIcfgContainer [2022-02-20 18:58:08,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:58:08,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:58:08,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:58:08,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:58:08,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:58:07" (1/3) ... [2022-02-20 18:58:08,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403a4a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:58:08, skipping insertion in model container [2022-02-20 18:58:08,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:08" (2/3) ... [2022-02-20 18:58:08,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403a4a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:58:08, skipping insertion in model container [2022-02-20 18:58:08,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:58:08" (3/3) ... [2022-02-20 18:58:08,969 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:58:08,974 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:58:08,974 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:58:09,005 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:58:09,009 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:09,010 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:58:09,024 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:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:58:09,031 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:09,032 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:09,033 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:09,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:09,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1468963440, now seen corresponding path program 1 times [2022-02-20 18:58:09,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:09,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654455864] [2022-02-20 18:58:09,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:09,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:09,403 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_1935~0 := 0;~__return_2084~0 := 0;~__return_2191~0 := 0; {152#true} is VALID [2022-02-20 18:58:09,409 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:09,410 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:09,410 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:09,410 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:09,410 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:09,411 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:09,411 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:09,411 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:09,411 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:09,411 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:09,412 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:09,412 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:09,412 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:09,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {152#true} assume ~id1~0 != ~id2~0; {152#true} is VALID [2022-02-20 18:58:09,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {152#true} assume ~id1~0 != ~id3~0; {152#true} is VALID [2022-02-20 18:58:09,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {152#true} assume ~id2~0 != ~id3~0; {152#true} is VALID [2022-02-20 18:58:09,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {152#true} assume ~id1~0 >= 0; {152#true} is VALID [2022-02-20 18:58:09,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {152#true} assume ~id2~0 >= 0; {152#true} is VALID [2022-02-20 18:58:09,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {152#true} assume ~id3~0 >= 0; {152#true} is VALID [2022-02-20 18:58:09,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {152#true} assume 0 == ~r1~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:09,415 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:09,415 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:09,415 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:09,416 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:09,420 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:09,421 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:09,421 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:09,422 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:09,422 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:09,423 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:09,423 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:09,423 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:09,424 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:09,424 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:09,425 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:09,425 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:09,425 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:09,426 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:09,426 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:09,427 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:09,427 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:09,427 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:09,428 INFO L290 TraceCheckUtils]: 43: Hoare triple {154#(<= ~r1~0 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1935~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1935~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:58:09,428 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:09,429 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:09,429 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:09,430 INFO L290 TraceCheckUtils]: 47: Hoare triple {154#(<= ~r1~0 0)} assume !(~r1~0 < 2); {153#false} is VALID [2022-02-20 18:58:09,430 INFO L290 TraceCheckUtils]: 48: Hoare triple {153#false} ~mode1~0 := 1; {153#false} is VALID [2022-02-20 18:58:09,430 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:09,430 INFO L290 TraceCheckUtils]: 50: Hoare triple {153#false} assume !!(0 == ~mode2~0 % 256); {153#false} is VALID [2022-02-20 18:58:09,431 INFO L290 TraceCheckUtils]: 51: Hoare triple {153#false} assume !(~r2~0 < 2); {153#false} is VALID [2022-02-20 18:58:09,431 INFO L290 TraceCheckUtils]: 52: Hoare triple {153#false} ~mode2~0 := 1; {153#false} is VALID [2022-02-20 18:58:09,431 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:09,441 INFO L290 TraceCheckUtils]: 54: Hoare triple {153#false} assume !!(0 == ~mode3~0 % 256); {153#false} is VALID [2022-02-20 18:58:09,442 INFO L290 TraceCheckUtils]: 55: Hoare triple {153#false} assume !(~r3~0 < 2); {153#false} is VALID [2022-02-20 18:58:09,442 INFO L290 TraceCheckUtils]: 56: Hoare triple {153#false} ~mode3~0 := 1; {153#false} is VALID [2022-02-20 18:58:09,442 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:09,442 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:09,442 INFO L290 TraceCheckUtils]: 59: Hoare triple {153#false} ~__return_2084~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2084~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:09,443 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:09,443 INFO L290 TraceCheckUtils]: 61: Hoare triple {153#false} assume !false; {153#false} is VALID [2022-02-20 18:58:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:09,444 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:09,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654455864] [2022-02-20 18:58:09,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654455864] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:09,445 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:09,445 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:09,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58968209] [2022-02-20 18:58:09,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:09,451 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:09,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:09,454 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:09,499 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:09,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:09,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:09,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:09,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:09,519 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:09,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:09,858 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2022-02-20 18:58:09,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:09,858 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:09,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:09,860 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:09,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2022-02-20 18:58:09,868 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:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2022-02-20 18:58:09,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 547 transitions. [2022-02-20 18:58:10,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 547 edges. 547 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:10,254 INFO L225 Difference]: With dead ends: 323 [2022-02-20 18:58:10,255 INFO L226 Difference]: Without dead ends: 225 [2022-02-20 18:58:10,257 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:10,260 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 150 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:10,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 452 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:10,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-02-20 18:58:10,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2022-02-20 18:58:10,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:10,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 223 states, 222 states have (on average 1.572072072072072) internal successors, (349), 222 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have 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:10,308 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 223 states, 222 states have (on average 1.572072072072072) internal successors, (349), 222 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have 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:10,308 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 223 states, 222 states have (on average 1.572072072072072) internal successors, (349), 222 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have 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:10,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:10,315 INFO L93 Difference]: Finished difference Result 225 states and 350 transitions. [2022-02-20 18:58:10,316 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 350 transitions. [2022-02-20 18:58:10,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:10,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:10,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 223 states, 222 states have (on average 1.572072072072072) internal successors, (349), 222 states have internal predecessors, (349), 0 states have call successors, (0), 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 225 states. [2022-02-20 18:58:10,318 INFO L87 Difference]: Start difference. First operand has 223 states, 222 states have (on average 1.572072072072072) internal successors, (349), 222 states have internal predecessors, (349), 0 states have call successors, (0), 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 225 states. [2022-02-20 18:58:10,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:10,324 INFO L93 Difference]: Finished difference Result 225 states and 350 transitions. [2022-02-20 18:58:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 350 transitions. [2022-02-20 18:58:10,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:10,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:10,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:10,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.572072072072072) internal successors, (349), 222 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have 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:10,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 349 transitions. [2022-02-20 18:58:10,333 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 349 transitions. Word has length 62 [2022-02-20 18:58:10,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:10,334 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 349 transitions. [2022-02-20 18:58:10,334 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:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 349 transitions. [2022-02-20 18:58:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:58:10,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:10,336 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:58:10,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:58:10,336 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:10,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:10,337 INFO L85 PathProgramCache]: Analyzing trace with hash -240910223, now seen corresponding path program 1 times [2022-02-20 18:58:10,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:10,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765252816] [2022-02-20 18:58:10,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:10,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {1337#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_1935~0 := 0;~__return_2084~0 := 0;~__return_2191~0 := 0; {1337#true} is VALID [2022-02-20 18:58:10,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {1337#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; {1337#true} is VALID [2022-02-20 18:58:10,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {1337#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {1337#true} is VALID [2022-02-20 18:58:10,443 INFO L290 TraceCheckUtils]: 3: Hoare triple {1337#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {1337#true} is VALID [2022-02-20 18:58:10,443 INFO L290 TraceCheckUtils]: 4: Hoare triple {1337#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {1337#true} is VALID [2022-02-20 18:58:10,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {1337#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {1337#true} is VALID [2022-02-20 18:58:10,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {1337#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {1337#true} is VALID [2022-02-20 18:58:10,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {1337#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {1337#true} is VALID [2022-02-20 18:58:10,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {1337#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {1337#true} is VALID [2022-02-20 18:58:10,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {1337#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {1337#true} is VALID [2022-02-20 18:58:10,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {1337#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {1337#true} is VALID [2022-02-20 18:58:10,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {1337#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {1337#true} is VALID [2022-02-20 18:58:10,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {1337#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {1337#true} is VALID [2022-02-20 18:58:10,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {1337#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {1337#true} is VALID [2022-02-20 18:58:10,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {1337#true} assume ~id1~0 != ~id2~0; {1337#true} is VALID [2022-02-20 18:58:10,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {1337#true} assume ~id1~0 != ~id3~0; {1337#true} is VALID [2022-02-20 18:58:10,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {1337#true} assume ~id2~0 != ~id3~0; {1337#true} is VALID [2022-02-20 18:58:10,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {1337#true} assume ~id1~0 >= 0; {1337#true} is VALID [2022-02-20 18:58:10,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {1337#true} assume ~id2~0 >= 0; {1337#true} is VALID [2022-02-20 18:58:10,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {1337#true} assume ~id3~0 >= 0; {1337#true} is VALID [2022-02-20 18:58:10,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {1337#true} assume 0 == ~r1~0; {1337#true} is VALID [2022-02-20 18:58:10,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {1337#true} assume 0 == ~r2~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {1339#(<= ~r2~0 0)} assume 0 == ~r3~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {1339#(<= ~r2~0 0)} assume !(0 == main_~init__r122~0#1 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {1339#(<= ~r2~0 0)} assume !(0 == main_~init__r132~0#1 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {1339#(<= ~r2~0 0)} assume !(0 == main_~init__r212~0#1 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {1339#(<= ~r2~0 0)} assume !(0 == main_~init__r232~0#1 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {1339#(<= ~r2~0 0)} assume !(0 == main_~init__r312~0#1 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {1339#(<= ~r2~0 0)} assume !(0 == main_~init__r322~0#1 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {1339#(<= ~r2~0 0)} assume ~max1~0 == ~id1~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {1339#(<= ~r2~0 0)} assume ~max2~0 == ~id2~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {1339#(<= ~r2~0 0)} assume ~max3~0 == ~id3~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,450 INFO L290 TraceCheckUtils]: 32: Hoare triple {1339#(<= ~r2~0 0)} assume 0 == ~st1~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {1339#(<= ~r2~0 0)} assume 0 == ~st2~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {1339#(<= ~r2~0 0)} assume 0 == ~st3~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,451 INFO L290 TraceCheckUtils]: 35: Hoare triple {1339#(<= ~r2~0 0)} assume 0 == ~nl1~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {1339#(<= ~r2~0 0)} assume 0 == ~nl2~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,452 INFO L290 TraceCheckUtils]: 37: Hoare triple {1339#(<= ~r2~0 0)} assume 0 == ~nl3~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,452 INFO L290 TraceCheckUtils]: 38: Hoare triple {1339#(<= ~r2~0 0)} assume 0 == ~mode1~0 % 256; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,452 INFO L290 TraceCheckUtils]: 39: Hoare triple {1339#(<= ~r2~0 0)} assume 0 == ~mode2~0 % 256; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,453 INFO L290 TraceCheckUtils]: 40: Hoare triple {1339#(<= ~r2~0 0)} assume 0 == ~mode3~0 % 256; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,453 INFO L290 TraceCheckUtils]: 41: Hoare triple {1339#(<= ~r2~0 0)} assume !(0 == ~newmax1~0 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,453 INFO L290 TraceCheckUtils]: 42: Hoare triple {1339#(<= ~r2~0 0)} assume !(0 == ~newmax2~0 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,454 INFO L290 TraceCheckUtils]: 43: Hoare triple {1339#(<= ~r2~0 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1935~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1935~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,454 INFO L290 TraceCheckUtils]: 44: Hoare triple {1339#(<= ~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; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,454 INFO L290 TraceCheckUtils]: 45: Hoare triple {1339#(<= ~r2~0 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,455 INFO L290 TraceCheckUtils]: 46: Hoare triple {1339#(<= ~r2~0 0)} assume !!(0 == ~mode1~0 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,471 INFO L290 TraceCheckUtils]: 47: Hoare triple {1339#(<= ~r2~0 0)} assume ~r1~0 < 2; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,472 INFO L290 TraceCheckUtils]: 48: Hoare triple {1339#(<= ~r2~0 0)} assume !!(0 == ~ep12~0 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,472 INFO L290 TraceCheckUtils]: 49: Hoare triple {1339#(<= ~r2~0 0)} assume !!(0 == ~ep13~0 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,472 INFO L290 TraceCheckUtils]: 50: Hoare triple {1339#(<= ~r2~0 0)} ~mode1~0 := 1; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,473 INFO L290 TraceCheckUtils]: 51: Hoare triple {1339#(<= ~r2~0 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,473 INFO L290 TraceCheckUtils]: 52: Hoare triple {1339#(<= ~r2~0 0)} assume !!(0 == ~mode2~0 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:58:10,474 INFO L290 TraceCheckUtils]: 53: Hoare triple {1339#(<= ~r2~0 0)} assume !(~r2~0 < 2); {1338#false} is VALID [2022-02-20 18:58:10,474 INFO L290 TraceCheckUtils]: 54: Hoare triple {1338#false} ~mode2~0 := 1; {1338#false} is VALID [2022-02-20 18:58:10,474 INFO L290 TraceCheckUtils]: 55: Hoare triple {1338#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {1338#false} is VALID [2022-02-20 18:58:10,474 INFO L290 TraceCheckUtils]: 56: Hoare triple {1338#false} assume !!(0 == ~mode3~0 % 256); {1338#false} is VALID [2022-02-20 18:58:10,474 INFO L290 TraceCheckUtils]: 57: Hoare triple {1338#false} assume !(~r3~0 < 2); {1338#false} is VALID [2022-02-20 18:58:10,474 INFO L290 TraceCheckUtils]: 58: Hoare triple {1338#false} ~mode3~0 := 1; {1338#false} is VALID [2022-02-20 18:58:10,475 INFO L290 TraceCheckUtils]: 59: Hoare triple {1338#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; {1338#false} is VALID [2022-02-20 18:58:10,475 INFO L290 TraceCheckUtils]: 60: Hoare triple {1338#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {1338#false} is VALID [2022-02-20 18:58:10,475 INFO L290 TraceCheckUtils]: 61: Hoare triple {1338#false} ~__return_2084~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2084~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; {1338#false} is VALID [2022-02-20 18:58:10,475 INFO L290 TraceCheckUtils]: 62: Hoare triple {1338#false} assume 0 == main_~assert__arg~0#1 % 256; {1338#false} is VALID [2022-02-20 18:58:10,475 INFO L290 TraceCheckUtils]: 63: Hoare triple {1338#false} assume !false; {1338#false} is VALID [2022-02-20 18:58:10,476 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:10,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:10,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765252816] [2022-02-20 18:58:10,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765252816] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:10,476 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:10,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:10,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025144050] [2022-02-20 18:58:10,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:10,478 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:10,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:10,478 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:10,518 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:10,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:10,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:10,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:10,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:10,519 INFO L87 Difference]: Start difference. First operand 223 states and 349 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:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:10,824 INFO L93 Difference]: Finished difference Result 539 states and 869 transitions. [2022-02-20 18:58:10,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:10,827 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:10,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:10,829 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:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2022-02-20 18:58:10,832 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:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2022-02-20 18:58:10,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 508 transitions. [2022-02-20 18:58:11,150 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:11,157 INFO L225 Difference]: With dead ends: 539 [2022-02-20 18:58:11,157 INFO L226 Difference]: Without dead ends: 373 [2022-02-20 18:58:11,158 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:11,159 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:11,159 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:11,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-02-20 18:58:11,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 371. [2022-02-20 18:58:11,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:11,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 373 states. Second operand has 371 states, 370 states have (on average 1.6) internal successors, (592), 370 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have 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:11,227 INFO L74 IsIncluded]: Start isIncluded. First operand 373 states. Second operand has 371 states, 370 states have (on average 1.6) internal successors, (592), 370 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have 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:11,228 INFO L87 Difference]: Start difference. First operand 373 states. Second operand has 371 states, 370 states have (on average 1.6) internal successors, (592), 370 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have 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:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:11,237 INFO L93 Difference]: Finished difference Result 373 states and 593 transitions. [2022-02-20 18:58:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 593 transitions. [2022-02-20 18:58:11,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:11,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:11,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 371 states, 370 states have (on average 1.6) internal successors, (592), 370 states have internal predecessors, (592), 0 states have call successors, (0), 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 373 states. [2022-02-20 18:58:11,239 INFO L87 Difference]: Start difference. First operand has 371 states, 370 states have (on average 1.6) internal successors, (592), 370 states have internal predecessors, (592), 0 states have call successors, (0), 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 373 states. [2022-02-20 18:58:11,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:11,247 INFO L93 Difference]: Finished difference Result 373 states and 593 transitions. [2022-02-20 18:58:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 593 transitions. [2022-02-20 18:58:11,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:11,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:11,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:11,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 1.6) internal successors, (592), 370 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have 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:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 592 transitions. [2022-02-20 18:58:11,259 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 592 transitions. Word has length 64 [2022-02-20 18:58:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:11,260 INFO L470 AbstractCegarLoop]: Abstraction has 371 states and 592 transitions. [2022-02-20 18:58:11,260 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:11,260 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 592 transitions. [2022-02-20 18:58:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:58:11,261 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:11,261 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:11,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:58:11,261 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:11,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:11,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1851209774, now seen corresponding path program 1 times [2022-02-20 18:58:11,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:11,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168791650] [2022-02-20 18:58:11,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:11,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:11,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {3333#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_1935~0 := 0;~__return_2084~0 := 0;~__return_2191~0 := 0; {3333#true} is VALID [2022-02-20 18:58:11,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {3333#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; {3333#true} is VALID [2022-02-20 18:58:11,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {3333#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {3333#true} is VALID [2022-02-20 18:58:11,328 INFO L290 TraceCheckUtils]: 3: Hoare triple {3333#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {3333#true} is VALID [2022-02-20 18:58:11,328 INFO L290 TraceCheckUtils]: 4: Hoare triple {3333#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {3333#true} is VALID [2022-02-20 18:58:11,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {3333#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {3333#true} is VALID [2022-02-20 18:58:11,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {3333#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {3333#true} is VALID [2022-02-20 18:58:11,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {3333#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {3333#true} is VALID [2022-02-20 18:58:11,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {3333#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {3333#true} is VALID [2022-02-20 18:58:11,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {3333#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {3333#true} is VALID [2022-02-20 18:58:11,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {3333#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {3333#true} is VALID [2022-02-20 18:58:11,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {3333#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {3333#true} is VALID [2022-02-20 18:58:11,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {3333#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {3333#true} is VALID [2022-02-20 18:58:11,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {3333#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {3333#true} is VALID [2022-02-20 18:58:11,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {3333#true} assume ~id1~0 != ~id2~0; {3333#true} is VALID [2022-02-20 18:58:11,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {3333#true} assume ~id1~0 != ~id3~0; {3333#true} is VALID [2022-02-20 18:58:11,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {3333#true} assume ~id2~0 != ~id3~0; {3333#true} is VALID [2022-02-20 18:58:11,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {3333#true} assume ~id1~0 >= 0; {3333#true} is VALID [2022-02-20 18:58:11,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {3333#true} assume ~id2~0 >= 0; {3333#true} is VALID [2022-02-20 18:58:11,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {3333#true} assume ~id3~0 >= 0; {3333#true} is VALID [2022-02-20 18:58:11,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {3333#true} assume 0 == ~r1~0; {3333#true} is VALID [2022-02-20 18:58:11,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {3333#true} assume 0 == ~r2~0; {3333#true} is VALID [2022-02-20 18:58:11,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {3333#true} assume 0 == ~r3~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {3335#(<= ~r3~0 0)} assume !(0 == main_~init__r122~0#1 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {3335#(<= ~r3~0 0)} assume !(0 == main_~init__r132~0#1 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {3335#(<= ~r3~0 0)} assume !(0 == main_~init__r212~0#1 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {3335#(<= ~r3~0 0)} assume !(0 == main_~init__r232~0#1 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {3335#(<= ~r3~0 0)} assume !(0 == main_~init__r312~0#1 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {3335#(<= ~r3~0 0)} assume !(0 == main_~init__r322~0#1 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,333 INFO L290 TraceCheckUtils]: 29: Hoare triple {3335#(<= ~r3~0 0)} assume ~max1~0 == ~id1~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {3335#(<= ~r3~0 0)} assume ~max2~0 == ~id2~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {3335#(<= ~r3~0 0)} assume ~max3~0 == ~id3~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,334 INFO L290 TraceCheckUtils]: 32: Hoare triple {3335#(<= ~r3~0 0)} assume 0 == ~st1~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {3335#(<= ~r3~0 0)} assume 0 == ~st2~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,335 INFO L290 TraceCheckUtils]: 34: Hoare triple {3335#(<= ~r3~0 0)} assume 0 == ~st3~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,335 INFO L290 TraceCheckUtils]: 35: Hoare triple {3335#(<= ~r3~0 0)} assume 0 == ~nl1~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,336 INFO L290 TraceCheckUtils]: 36: Hoare triple {3335#(<= ~r3~0 0)} assume 0 == ~nl2~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,336 INFO L290 TraceCheckUtils]: 37: Hoare triple {3335#(<= ~r3~0 0)} assume 0 == ~nl3~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,336 INFO L290 TraceCheckUtils]: 38: Hoare triple {3335#(<= ~r3~0 0)} assume 0 == ~mode1~0 % 256; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {3335#(<= ~r3~0 0)} assume 0 == ~mode2~0 % 256; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,337 INFO L290 TraceCheckUtils]: 40: Hoare triple {3335#(<= ~r3~0 0)} assume 0 == ~mode3~0 % 256; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {3335#(<= ~r3~0 0)} assume !(0 == ~newmax1~0 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,337 INFO L290 TraceCheckUtils]: 42: Hoare triple {3335#(<= ~r3~0 0)} assume !(0 == ~newmax2~0 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {3335#(<= ~r3~0 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1935~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1935~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,338 INFO L290 TraceCheckUtils]: 44: Hoare triple {3335#(<= ~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; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,338 INFO L290 TraceCheckUtils]: 45: Hoare triple {3335#(<= ~r3~0 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,339 INFO L290 TraceCheckUtils]: 46: Hoare triple {3335#(<= ~r3~0 0)} assume !!(0 == ~mode1~0 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,339 INFO L290 TraceCheckUtils]: 47: Hoare triple {3335#(<= ~r3~0 0)} assume ~r1~0 < 2; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,339 INFO L290 TraceCheckUtils]: 48: Hoare triple {3335#(<= ~r3~0 0)} assume !!(0 == ~ep12~0 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,340 INFO L290 TraceCheckUtils]: 49: Hoare triple {3335#(<= ~r3~0 0)} assume !!(0 == ~ep13~0 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,340 INFO L290 TraceCheckUtils]: 50: Hoare triple {3335#(<= ~r3~0 0)} ~mode1~0 := 1; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,340 INFO L290 TraceCheckUtils]: 51: Hoare triple {3335#(<= ~r3~0 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,341 INFO L290 TraceCheckUtils]: 52: Hoare triple {3335#(<= ~r3~0 0)} assume !!(0 == ~mode2~0 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,341 INFO L290 TraceCheckUtils]: 53: Hoare triple {3335#(<= ~r3~0 0)} assume ~r2~0 < 2; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,341 INFO L290 TraceCheckUtils]: 54: Hoare triple {3335#(<= ~r3~0 0)} assume !!(0 == ~ep21~0 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,342 INFO L290 TraceCheckUtils]: 55: Hoare triple {3335#(<= ~r3~0 0)} assume !!(0 == ~ep23~0 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,342 INFO L290 TraceCheckUtils]: 56: Hoare triple {3335#(<= ~r3~0 0)} ~mode2~0 := 1; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,343 INFO L290 TraceCheckUtils]: 57: Hoare triple {3335#(<= ~r3~0 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,343 INFO L290 TraceCheckUtils]: 58: Hoare triple {3335#(<= ~r3~0 0)} assume !!(0 == ~mode3~0 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:58:11,343 INFO L290 TraceCheckUtils]: 59: Hoare triple {3335#(<= ~r3~0 0)} assume !(~r3~0 < 2); {3334#false} is VALID [2022-02-20 18:58:11,343 INFO L290 TraceCheckUtils]: 60: Hoare triple {3334#false} ~mode3~0 := 1; {3334#false} is VALID [2022-02-20 18:58:11,344 INFO L290 TraceCheckUtils]: 61: Hoare triple {3334#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; {3334#false} is VALID [2022-02-20 18:58:11,344 INFO L290 TraceCheckUtils]: 62: Hoare triple {3334#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {3334#false} is VALID [2022-02-20 18:58:11,344 INFO L290 TraceCheckUtils]: 63: Hoare triple {3334#false} ~__return_2084~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2084~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; {3334#false} is VALID [2022-02-20 18:58:11,344 INFO L290 TraceCheckUtils]: 64: Hoare triple {3334#false} assume 0 == main_~assert__arg~0#1 % 256; {3334#false} is VALID [2022-02-20 18:58:11,344 INFO L290 TraceCheckUtils]: 65: Hoare triple {3334#false} assume !false; {3334#false} is VALID [2022-02-20 18:58:11,345 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:11,345 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:11,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168791650] [2022-02-20 18:58:11,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168791650] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:11,345 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:11,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:11,346 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621207646] [2022-02-20 18:58:11,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:11,346 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:11,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:11,346 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:11,385 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:11,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:11,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:11,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:11,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:11,386 INFO L87 Difference]: Start difference. First operand 371 states and 592 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:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:11,753 INFO L93 Difference]: Finished difference Result 967 states and 1570 transitions. [2022-02-20 18:58:11,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:11,753 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:11,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:11,753 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:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2022-02-20 18:58:11,756 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:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2022-02-20 18:58:11,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 508 transitions. [2022-02-20 18:58:12,041 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:12,058 INFO L225 Difference]: With dead ends: 967 [2022-02-20 18:58:12,058 INFO L226 Difference]: Without dead ends: 653 [2022-02-20 18:58:12,059 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:12,059 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:12,060 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:12,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2022-02-20 18:58:12,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 651. [2022-02-20 18:58:12,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:12,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 653 states. Second operand has 651 states, 650 states have (on average 1.6123076923076922) internal successors, (1048), 650 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have 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:12,209 INFO L74 IsIncluded]: Start isIncluded. First operand 653 states. Second operand has 651 states, 650 states have (on average 1.6123076923076922) internal successors, (1048), 650 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have 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:12,210 INFO L87 Difference]: Start difference. First operand 653 states. Second operand has 651 states, 650 states have (on average 1.6123076923076922) internal successors, (1048), 650 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have 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:12,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:12,226 INFO L93 Difference]: Finished difference Result 653 states and 1049 transitions. [2022-02-20 18:58:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1049 transitions. [2022-02-20 18:58:12,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:12,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:12,228 INFO L74 IsIncluded]: Start isIncluded. First operand has 651 states, 650 states have (on average 1.6123076923076922) internal successors, (1048), 650 states have internal predecessors, (1048), 0 states have call successors, (0), 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 653 states. [2022-02-20 18:58:12,229 INFO L87 Difference]: Start difference. First operand has 651 states, 650 states have (on average 1.6123076923076922) internal successors, (1048), 650 states have internal predecessors, (1048), 0 states have call successors, (0), 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 653 states. [2022-02-20 18:58:12,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:12,244 INFO L93 Difference]: Finished difference Result 653 states and 1049 transitions. [2022-02-20 18:58:12,244 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1049 transitions. [2022-02-20 18:58:12,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:12,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:12,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:12,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 650 states have (on average 1.6123076923076922) internal successors, (1048), 650 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have 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:12,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1048 transitions. [2022-02-20 18:58:12,263 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1048 transitions. Word has length 66 [2022-02-20 18:58:12,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:12,264 INFO L470 AbstractCegarLoop]: Abstraction has 651 states and 1048 transitions. [2022-02-20 18:58:12,264 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:12,264 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1048 transitions. [2022-02-20 18:58:12,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 18:58:12,265 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:12,265 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:12,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:58:12,265 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:12,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:12,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1666116403, now seen corresponding path program 1 times [2022-02-20 18:58:12,266 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:12,266 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536392705] [2022-02-20 18:58:12,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:12,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:12,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {6890#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_1935~0 := 0;~__return_2084~0 := 0;~__return_2191~0 := 0; {6890#true} is VALID [2022-02-20 18:58:12,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {6890#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; {6890#true} is VALID [2022-02-20 18:58:12,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {6890#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {6890#true} is VALID [2022-02-20 18:58:12,347 INFO L290 TraceCheckUtils]: 3: Hoare triple {6890#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {6890#true} is VALID [2022-02-20 18:58:12,347 INFO L290 TraceCheckUtils]: 4: Hoare triple {6890#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {6890#true} is VALID [2022-02-20 18:58:12,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {6890#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {6890#true} is VALID [2022-02-20 18:58:12,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {6890#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {6890#true} is VALID [2022-02-20 18:58:12,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {6890#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {6890#true} is VALID [2022-02-20 18:58:12,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {6890#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {6890#true} is VALID [2022-02-20 18:58:12,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {6890#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {6890#true} is VALID [2022-02-20 18:58:12,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {6890#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {6890#true} is VALID [2022-02-20 18:58:12,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {6890#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {6890#true} is VALID [2022-02-20 18:58:12,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {6890#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {6890#true} is VALID [2022-02-20 18:58:12,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {6890#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {6890#true} is VALID [2022-02-20 18:58:12,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {6890#true} assume ~id1~0 != ~id2~0; {6890#true} is VALID [2022-02-20 18:58:12,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {6890#true} assume ~id1~0 != ~id3~0; {6890#true} is VALID [2022-02-20 18:58:12,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {6890#true} assume ~id2~0 != ~id3~0; {6890#true} is VALID [2022-02-20 18:58:12,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {6890#true} assume ~id1~0 >= 0; {6890#true} is VALID [2022-02-20 18:58:12,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {6890#true} assume ~id2~0 >= 0; {6890#true} is VALID [2022-02-20 18:58:12,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {6890#true} assume ~id3~0 >= 0; {6890#true} is VALID [2022-02-20 18:58:12,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {6890#true} assume 0 == ~r1~0; {6890#true} is VALID [2022-02-20 18:58:12,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {6890#true} assume 0 == ~r2~0; {6890#true} is VALID [2022-02-20 18:58:12,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {6890#true} assume 0 == ~r3~0; {6890#true} is VALID [2022-02-20 18:58:12,350 INFO L290 TraceCheckUtils]: 23: Hoare triple {6890#true} assume !(0 == main_~init__r122~0#1 % 256); {6890#true} is VALID [2022-02-20 18:58:12,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {6890#true} assume !(0 == main_~init__r132~0#1 % 256); {6890#true} is VALID [2022-02-20 18:58:12,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {6890#true} assume !(0 == main_~init__r212~0#1 % 256); {6890#true} is VALID [2022-02-20 18:58:12,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {6890#true} assume !(0 == main_~init__r232~0#1 % 256); {6890#true} is VALID [2022-02-20 18:58:12,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {6890#true} assume !(0 == main_~init__r312~0#1 % 256); {6890#true} is VALID [2022-02-20 18:58:12,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {6890#true} assume !(0 == main_~init__r322~0#1 % 256); {6890#true} is VALID [2022-02-20 18:58:12,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {6890#true} assume ~max1~0 == ~id1~0; {6890#true} is VALID [2022-02-20 18:58:12,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {6890#true} assume ~max2~0 == ~id2~0; {6890#true} is VALID [2022-02-20 18:58:12,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {6890#true} assume ~max3~0 == ~id3~0; {6890#true} is VALID [2022-02-20 18:58:12,351 INFO L290 TraceCheckUtils]: 32: Hoare triple {6890#true} assume 0 == ~st1~0; {6892#(<= ~st1~0 0)} is VALID [2022-02-20 18:58:12,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {6892#(<= ~st1~0 0)} assume 0 == ~st2~0; {6893#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,352 INFO L290 TraceCheckUtils]: 34: Hoare triple {6893#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,352 INFO L290 TraceCheckUtils]: 35: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,353 INFO L290 TraceCheckUtils]: 36: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,353 INFO L290 TraceCheckUtils]: 37: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,353 INFO L290 TraceCheckUtils]: 38: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,354 INFO L290 TraceCheckUtils]: 39: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,354 INFO L290 TraceCheckUtils]: 40: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,354 INFO L290 TraceCheckUtils]: 41: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax1~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,355 INFO L290 TraceCheckUtils]: 42: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax2~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,355 INFO L290 TraceCheckUtils]: 43: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1935~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1935~0; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,355 INFO L290 TraceCheckUtils]: 44: Hoare triple {6894#(<= (+ ~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; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,355 INFO L290 TraceCheckUtils]: 45: Hoare triple {6894#(<= (+ ~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; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,356 INFO L290 TraceCheckUtils]: 46: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,356 INFO L290 TraceCheckUtils]: 47: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 2; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,356 INFO L290 TraceCheckUtils]: 48: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,357 INFO L290 TraceCheckUtils]: 50: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,357 INFO L290 TraceCheckUtils]: 51: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,357 INFO L290 TraceCheckUtils]: 52: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,358 INFO L290 TraceCheckUtils]: 53: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 < 2; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,358 INFO L290 TraceCheckUtils]: 55: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,359 INFO L290 TraceCheckUtils]: 56: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,359 INFO L290 TraceCheckUtils]: 57: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,359 INFO L290 TraceCheckUtils]: 58: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,360 INFO L290 TraceCheckUtils]: 59: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 < 2; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,360 INFO L290 TraceCheckUtils]: 60: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,360 INFO L290 TraceCheckUtils]: 61: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,360 INFO L290 TraceCheckUtils]: 62: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,361 INFO L290 TraceCheckUtils]: 63: Hoare triple {6894#(<= (+ ~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; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:12,361 INFO L290 TraceCheckUtils]: 64: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {6891#false} is VALID [2022-02-20 18:58:12,361 INFO L290 TraceCheckUtils]: 65: Hoare triple {6891#false} ~__return_2084~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2084~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; {6891#false} is VALID [2022-02-20 18:58:12,361 INFO L290 TraceCheckUtils]: 66: Hoare triple {6891#false} assume 0 == main_~assert__arg~0#1 % 256; {6891#false} is VALID [2022-02-20 18:58:12,362 INFO L290 TraceCheckUtils]: 67: Hoare triple {6891#false} assume !false; {6891#false} is VALID [2022-02-20 18:58:12,362 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:12,362 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:12,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536392705] [2022-02-20 18:58:12,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536392705] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:12,363 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:12,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:58:12,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629359618] [2022-02-20 18:58:12,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:12,363 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:12,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:12,364 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:12,399 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:12,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:58:12,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:12,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:58:12,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:58:12,400 INFO L87 Difference]: Start difference. First operand 651 states and 1048 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:14,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:14,605 INFO L93 Difference]: Finished difference Result 2807 states and 4618 transitions. [2022-02-20 18:58:14,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:58:14,606 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:14,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:14,606 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:14,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1118 transitions. [2022-02-20 18:58:14,610 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:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1118 transitions. [2022-02-20 18:58:14,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1118 transitions. [2022-02-20 18:58:15,286 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:15,535 INFO L225 Difference]: With dead ends: 2807 [2022-02-20 18:58:15,536 INFO L226 Difference]: Without dead ends: 2213 [2022-02-20 18:58:15,537 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:15,545 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:15,546 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:15,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2022-02-20 18:58:16,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 1170. [2022-02-20 18:58:16,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:16,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2213 states. Second operand has 1170 states, 1169 states have (on average 1.6236099230111207) internal successors, (1898), 1169 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have 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:16,270 INFO L74 IsIncluded]: Start isIncluded. First operand 2213 states. Second operand has 1170 states, 1169 states have (on average 1.6236099230111207) internal successors, (1898), 1169 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have 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:16,271 INFO L87 Difference]: Start difference. First operand 2213 states. Second operand has 1170 states, 1169 states have (on average 1.6236099230111207) internal successors, (1898), 1169 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have 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:16,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:16,405 INFO L93 Difference]: Finished difference Result 2213 states and 3619 transitions. [2022-02-20 18:58:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 3619 transitions. [2022-02-20 18:58:16,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:16,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:16,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 1170 states, 1169 states have (on average 1.6236099230111207) internal successors, (1898), 1169 states have internal predecessors, (1898), 0 states have call successors, (0), 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 2213 states. [2022-02-20 18:58:16,411 INFO L87 Difference]: Start difference. First operand has 1170 states, 1169 states have (on average 1.6236099230111207) internal successors, (1898), 1169 states have internal predecessors, (1898), 0 states have call successors, (0), 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 2213 states. [2022-02-20 18:58:16,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:16,548 INFO L93 Difference]: Finished difference Result 2213 states and 3619 transitions. [2022-02-20 18:58:16,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 3619 transitions. [2022-02-20 18:58:16,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:16,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:16,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:16,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1169 states have (on average 1.6236099230111207) internal successors, (1898), 1169 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have 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:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1898 transitions. [2022-02-20 18:58:16,605 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1898 transitions. Word has length 68 [2022-02-20 18:58:16,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:16,606 INFO L470 AbstractCegarLoop]: Abstraction has 1170 states and 1898 transitions. [2022-02-20 18:58:16,606 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:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1898 transitions. [2022-02-20 18:58:16,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:58:16,607 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:16,608 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:16,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:58:16,608 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:16,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:16,609 INFO L85 PathProgramCache]: Analyzing trace with hash 47496755, now seen corresponding path program 1 times [2022-02-20 18:58:16,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:16,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107913699] [2022-02-20 18:58:16,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:16,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:16,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {16888#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_1935~0 := 0;~__return_2084~0 := 0;~__return_2191~0 := 0; {16888#true} is VALID [2022-02-20 18:58:16,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {16888#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; {16888#true} is VALID [2022-02-20 18:58:16,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {16888#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {16888#true} is VALID [2022-02-20 18:58:16,687 INFO L290 TraceCheckUtils]: 3: Hoare triple {16888#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {16888#true} is VALID [2022-02-20 18:58:16,688 INFO L290 TraceCheckUtils]: 4: Hoare triple {16888#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {16888#true} is VALID [2022-02-20 18:58:16,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {16888#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {16888#true} is VALID [2022-02-20 18:58:16,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {16888#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {16888#true} is VALID [2022-02-20 18:58:16,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {16888#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {16888#true} is VALID [2022-02-20 18:58:16,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {16888#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {16888#true} is VALID [2022-02-20 18:58:16,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {16888#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {16888#true} is VALID [2022-02-20 18:58:16,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {16888#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {16888#true} is VALID [2022-02-20 18:58:16,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {16888#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {16888#true} is VALID [2022-02-20 18:58:16,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {16888#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {16888#true} is VALID [2022-02-20 18:58:16,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {16888#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {16888#true} is VALID [2022-02-20 18:58:16,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {16888#true} assume ~id1~0 != ~id2~0; {16888#true} is VALID [2022-02-20 18:58:16,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {16888#true} assume ~id1~0 != ~id3~0; {16888#true} is VALID [2022-02-20 18:58:16,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {16888#true} assume ~id2~0 != ~id3~0; {16888#true} is VALID [2022-02-20 18:58:16,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {16888#true} assume ~id1~0 >= 0; {16888#true} is VALID [2022-02-20 18:58:16,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {16888#true} assume ~id2~0 >= 0; {16888#true} is VALID [2022-02-20 18:58:16,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {16888#true} assume ~id3~0 >= 0; {16888#true} is VALID [2022-02-20 18:58:16,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {16888#true} assume 0 == ~r1~0; {16888#true} is VALID [2022-02-20 18:58:16,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {16888#true} assume 0 == ~r2~0; {16888#true} is VALID [2022-02-20 18:58:16,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {16888#true} assume 0 == ~r3~0; {16888#true} is VALID [2022-02-20 18:58:16,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {16888#true} assume !(0 == main_~init__r122~0#1 % 256); {16888#true} is VALID [2022-02-20 18:58:16,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {16888#true} assume !(0 == main_~init__r132~0#1 % 256); {16888#true} is VALID [2022-02-20 18:58:16,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {16888#true} assume !(0 == main_~init__r212~0#1 % 256); {16888#true} is VALID [2022-02-20 18:58:16,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {16888#true} assume !(0 == main_~init__r232~0#1 % 256); {16888#true} is VALID [2022-02-20 18:58:16,690 INFO L290 TraceCheckUtils]: 27: Hoare triple {16888#true} assume !(0 == main_~init__r312~0#1 % 256); {16888#true} is VALID [2022-02-20 18:58:16,691 INFO L290 TraceCheckUtils]: 28: Hoare triple {16888#true} assume !(0 == main_~init__r322~0#1 % 256); {16888#true} is VALID [2022-02-20 18:58:16,691 INFO L290 TraceCheckUtils]: 29: Hoare triple {16888#true} assume ~max1~0 == ~id1~0; {16888#true} is VALID [2022-02-20 18:58:16,691 INFO L290 TraceCheckUtils]: 30: Hoare triple {16888#true} assume ~max2~0 == ~id2~0; {16888#true} is VALID [2022-02-20 18:58:16,691 INFO L290 TraceCheckUtils]: 31: Hoare triple {16888#true} assume ~max3~0 == ~id3~0; {16888#true} is VALID [2022-02-20 18:58:16,691 INFO L290 TraceCheckUtils]: 32: Hoare triple {16888#true} assume 0 == ~st1~0; {16890#(<= ~st1~0 0)} is VALID [2022-02-20 18:58:16,692 INFO L290 TraceCheckUtils]: 33: Hoare triple {16890#(<= ~st1~0 0)} assume 0 == ~st2~0; {16890#(<= ~st1~0 0)} is VALID [2022-02-20 18:58:16,692 INFO L290 TraceCheckUtils]: 34: Hoare triple {16890#(<= ~st1~0 0)} assume 0 == ~st3~0; {16890#(<= ~st1~0 0)} is VALID [2022-02-20 18:58:16,692 INFO L290 TraceCheckUtils]: 35: Hoare triple {16890#(<= ~st1~0 0)} assume 0 == ~nl1~0; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,692 INFO L290 TraceCheckUtils]: 36: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,693 INFO L290 TraceCheckUtils]: 37: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,693 INFO L290 TraceCheckUtils]: 38: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,693 INFO L290 TraceCheckUtils]: 39: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,694 INFO L290 TraceCheckUtils]: 40: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,694 INFO L290 TraceCheckUtils]: 41: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax1~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,694 INFO L290 TraceCheckUtils]: 42: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax2~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,694 INFO L290 TraceCheckUtils]: 43: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1935~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1935~0; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,695 INFO L290 TraceCheckUtils]: 44: Hoare triple {16891#(<= (+ ~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; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,695 INFO L290 TraceCheckUtils]: 45: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,695 INFO L290 TraceCheckUtils]: 46: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,696 INFO L290 TraceCheckUtils]: 47: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 < 2; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,697 INFO L290 TraceCheckUtils]: 48: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,697 INFO L290 TraceCheckUtils]: 50: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,698 INFO L290 TraceCheckUtils]: 51: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,698 INFO L290 TraceCheckUtils]: 52: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,698 INFO L290 TraceCheckUtils]: 53: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 < 2; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,698 INFO L290 TraceCheckUtils]: 54: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,699 INFO L290 TraceCheckUtils]: 55: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,699 INFO L290 TraceCheckUtils]: 56: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,699 INFO L290 TraceCheckUtils]: 57: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,700 INFO L290 TraceCheckUtils]: 58: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,700 INFO L290 TraceCheckUtils]: 59: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 < 2; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,700 INFO L290 TraceCheckUtils]: 60: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,701 INFO L290 TraceCheckUtils]: 61: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,701 INFO L290 TraceCheckUtils]: 62: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,701 INFO L290 TraceCheckUtils]: 63: Hoare triple {16891#(<= (+ ~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; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,701 INFO L290 TraceCheckUtils]: 64: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:16,702 INFO L290 TraceCheckUtils]: 65: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);main_~check__tmp~0#1 := 0; {16889#false} is VALID [2022-02-20 18:58:16,702 INFO L290 TraceCheckUtils]: 66: Hoare triple {16889#false} ~__return_2084~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2084~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; {16889#false} is VALID [2022-02-20 18:58:16,702 INFO L290 TraceCheckUtils]: 67: Hoare triple {16889#false} assume 0 == main_~assert__arg~0#1 % 256; {16889#false} is VALID [2022-02-20 18:58:16,702 INFO L290 TraceCheckUtils]: 68: Hoare triple {16889#false} assume !false; {16889#false} is VALID [2022-02-20 18:58:16,703 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:16,703 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:16,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107913699] [2022-02-20 18:58:16,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107913699] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:16,704 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:16,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:58:16,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523277257] [2022-02-20 18:58:16,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:16,705 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:16,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:16,705 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:16,757 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:16,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:58:16,758 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:16,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:58:16,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:58:16,759 INFO L87 Difference]: Start difference. First operand 1170 states and 1898 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:19,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:19,030 INFO L93 Difference]: Finished difference Result 3409 states and 5599 transitions. [2022-02-20 18:58:19,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:58:19,030 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:19,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:19,031 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:19,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 671 transitions. [2022-02-20 18:58:19,033 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:19,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 671 transitions. [2022-02-20 18:58:19,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 671 transitions. [2022-02-20 18:58:19,404 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:19,623 INFO L225 Difference]: With dead ends: 3409 [2022-02-20 18:58:19,623 INFO L226 Difference]: Without dead ends: 2296 [2022-02-20 18:58:19,625 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:19,629 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 430 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:19,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 662 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:19,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2022-02-20 18:58:20,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 1724. [2022-02-20 18:58:20,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:20,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2296 states. Second operand has 1724 states, 1723 states have (on average 1.6297156123041208) internal successors, (2808), 1723 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have 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:20,680 INFO L74 IsIncluded]: Start isIncluded. First operand 2296 states. Second operand has 1724 states, 1723 states have (on average 1.6297156123041208) internal successors, (2808), 1723 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have 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:20,682 INFO L87 Difference]: Start difference. First operand 2296 states. Second operand has 1724 states, 1723 states have (on average 1.6297156123041208) internal successors, (2808), 1723 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have 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:20,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:20,825 INFO L93 Difference]: Finished difference Result 2296 states and 3762 transitions. [2022-02-20 18:58:20,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 3762 transitions. [2022-02-20 18:58:20,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:20,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:20,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 1724 states, 1723 states have (on average 1.6297156123041208) internal successors, (2808), 1723 states have internal predecessors, (2808), 0 states have call successors, (0), 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 2296 states. [2022-02-20 18:58:20,833 INFO L87 Difference]: Start difference. First operand has 1724 states, 1723 states have (on average 1.6297156123041208) internal successors, (2808), 1723 states have internal predecessors, (2808), 0 states have call successors, (0), 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 2296 states. [2022-02-20 18:58:20,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:20,982 INFO L93 Difference]: Finished difference Result 2296 states and 3762 transitions. [2022-02-20 18:58:20,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 3762 transitions. [2022-02-20 18:58:20,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:20,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:20,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:20,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:20,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1723 states have (on average 1.6297156123041208) internal successors, (2808), 1723 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have 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:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2808 transitions. [2022-02-20 18:58:21,107 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2808 transitions. Word has length 69 [2022-02-20 18:58:21,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:21,107 INFO L470 AbstractCegarLoop]: Abstraction has 1724 states and 2808 transitions. [2022-02-20 18:58:21,108 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:21,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2808 transitions. [2022-02-20 18:58:21,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:58:21,109 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:21,109 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:21,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:58:21,110 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:21,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:21,110 INFO L85 PathProgramCache]: Analyzing trace with hash -613931840, now seen corresponding path program 1 times [2022-02-20 18:58:21,110 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:21,110 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326783425] [2022-02-20 18:58:21,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:21,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:21,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {28674#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_1935~0 := 0;~__return_2084~0 := 0;~__return_2191~0 := 0; {28674#true} is VALID [2022-02-20 18:58:21,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {28674#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; {28674#true} is VALID [2022-02-20 18:58:21,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {28674#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {28674#true} is VALID [2022-02-20 18:58:21,165 INFO L290 TraceCheckUtils]: 3: Hoare triple {28674#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {28674#true} is VALID [2022-02-20 18:58:21,165 INFO L290 TraceCheckUtils]: 4: Hoare triple {28674#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {28674#true} is VALID [2022-02-20 18:58:21,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {28674#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {28674#true} is VALID [2022-02-20 18:58:21,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {28674#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {28674#true} is VALID [2022-02-20 18:58:21,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {28674#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {28674#true} is VALID [2022-02-20 18:58:21,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {28674#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {28674#true} is VALID [2022-02-20 18:58:21,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {28674#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {28674#true} is VALID [2022-02-20 18:58:21,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {28674#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {28674#true} is VALID [2022-02-20 18:58:21,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {28674#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {28674#true} is VALID [2022-02-20 18:58:21,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {28674#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {28674#true} is VALID [2022-02-20 18:58:21,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {28674#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {28674#true} is VALID [2022-02-20 18:58:21,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {28674#true} assume ~id1~0 != ~id2~0; {28674#true} is VALID [2022-02-20 18:58:21,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {28674#true} assume ~id1~0 != ~id3~0; {28674#true} is VALID [2022-02-20 18:58:21,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {28674#true} assume ~id2~0 != ~id3~0; {28674#true} is VALID [2022-02-20 18:58:21,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {28674#true} assume ~id1~0 >= 0; {28674#true} is VALID [2022-02-20 18:58:21,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {28674#true} assume ~id2~0 >= 0; {28674#true} is VALID [2022-02-20 18:58:21,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {28674#true} assume ~id3~0 >= 0; {28674#true} is VALID [2022-02-20 18:58:21,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {28674#true} assume 0 == ~r1~0; {28674#true} is VALID [2022-02-20 18:58:21,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {28674#true} assume 0 == ~r2~0; {28674#true} is VALID [2022-02-20 18:58:21,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {28674#true} assume 0 == ~r3~0; {28674#true} is VALID [2022-02-20 18:58:21,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {28674#true} assume !(0 == main_~init__r122~0#1 % 256); {28674#true} is VALID [2022-02-20 18:58:21,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {28674#true} assume !(0 == main_~init__r132~0#1 % 256); {28674#true} is VALID [2022-02-20 18:58:21,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {28674#true} assume !(0 == main_~init__r212~0#1 % 256); {28674#true} is VALID [2022-02-20 18:58:21,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {28674#true} assume !(0 == main_~init__r232~0#1 % 256); {28674#true} is VALID [2022-02-20 18:58:21,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {28674#true} assume !(0 == main_~init__r312~0#1 % 256); {28674#true} is VALID [2022-02-20 18:58:21,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {28674#true} assume !(0 == main_~init__r322~0#1 % 256); {28674#true} is VALID [2022-02-20 18:58:21,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {28674#true} assume ~max1~0 == ~id1~0; {28674#true} is VALID [2022-02-20 18:58:21,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {28674#true} assume ~max2~0 == ~id2~0; {28674#true} is VALID [2022-02-20 18:58:21,187 INFO L290 TraceCheckUtils]: 31: Hoare triple {28674#true} assume ~max3~0 == ~id3~0; {28674#true} is VALID [2022-02-20 18:58:21,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {28674#true} assume 0 == ~st1~0; {28674#true} is VALID [2022-02-20 18:58:21,187 INFO L290 TraceCheckUtils]: 33: Hoare triple {28674#true} assume 0 == ~st2~0; {28674#true} is VALID [2022-02-20 18:58:21,187 INFO L290 TraceCheckUtils]: 34: Hoare triple {28674#true} assume 0 == ~st3~0; {28674#true} is VALID [2022-02-20 18:58:21,187 INFO L290 TraceCheckUtils]: 35: Hoare triple {28674#true} assume 0 == ~nl1~0; {28674#true} is VALID [2022-02-20 18:58:21,187 INFO L290 TraceCheckUtils]: 36: Hoare triple {28674#true} assume 0 == ~nl2~0; {28674#true} is VALID [2022-02-20 18:58:21,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {28674#true} assume 0 == ~nl3~0; {28674#true} is VALID [2022-02-20 18:58:21,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {28674#true} assume 0 == ~mode1~0 % 256; {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:21,189 INFO L290 TraceCheckUtils]: 39: Hoare triple {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:21,189 INFO L290 TraceCheckUtils]: 40: Hoare triple {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:21,189 INFO L290 TraceCheckUtils]: 41: Hoare triple {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax1~0 % 256); {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:21,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax2~0 % 256); {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:21,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1935~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1935~0; {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:21,192 INFO L290 TraceCheckUtils]: 44: Hoare triple {28676#(= (+ (* (- 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; {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:21,192 INFO L290 TraceCheckUtils]: 45: Hoare triple {28676#(= (+ (* (- 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; {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:21,194 INFO L290 TraceCheckUtils]: 46: Hoare triple {28676#(= (+ (* (- 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); {28675#false} is VALID [2022-02-20 18:58:21,194 INFO L290 TraceCheckUtils]: 47: Hoare triple {28675#false} assume !!(0 == ~ep21~0 % 256); {28675#false} is VALID [2022-02-20 18:58:21,194 INFO L290 TraceCheckUtils]: 48: Hoare triple {28675#false} assume !!(0 == ~ep31~0 % 256); {28675#false} is VALID [2022-02-20 18:58:21,194 INFO L290 TraceCheckUtils]: 49: Hoare triple {28675#false} ~newmax1~0 := main_~node1__newmax~0#1; {28675#false} is VALID [2022-02-20 18:58:21,194 INFO L290 TraceCheckUtils]: 50: Hoare triple {28675#false} assume 2 == ~r1~0; {28675#false} is VALID [2022-02-20 18:58:21,194 INFO L290 TraceCheckUtils]: 51: Hoare triple {28675#false} assume !(~max1~0 == ~id1~0);~st1~0 := 1; {28675#false} is VALID [2022-02-20 18:58:21,195 INFO L290 TraceCheckUtils]: 52: Hoare triple {28675#false} ~mode1~0 := 0; {28675#false} is VALID [2022-02-20 18:58:21,195 INFO L290 TraceCheckUtils]: 53: Hoare triple {28675#false} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {28675#false} is VALID [2022-02-20 18:58:21,195 INFO L290 TraceCheckUtils]: 54: Hoare triple {28675#false} assume !!(0 == ~mode2~0 % 256); {28675#false} is VALID [2022-02-20 18:58:21,195 INFO L290 TraceCheckUtils]: 55: Hoare triple {28675#false} assume ~r2~0 < 2; {28675#false} is VALID [2022-02-20 18:58:21,195 INFO L290 TraceCheckUtils]: 56: Hoare triple {28675#false} assume !!(0 == ~ep21~0 % 256); {28675#false} is VALID [2022-02-20 18:58:21,195 INFO L290 TraceCheckUtils]: 57: Hoare triple {28675#false} assume !!(0 == ~ep23~0 % 256); {28675#false} is VALID [2022-02-20 18:58:21,197 INFO L290 TraceCheckUtils]: 58: Hoare triple {28675#false} ~mode2~0 := 1; {28675#false} is VALID [2022-02-20 18:58:21,197 INFO L290 TraceCheckUtils]: 59: Hoare triple {28675#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {28675#false} is VALID [2022-02-20 18:58:21,197 INFO L290 TraceCheckUtils]: 60: Hoare triple {28675#false} assume !!(0 == ~mode3~0 % 256); {28675#false} is VALID [2022-02-20 18:58:21,198 INFO L290 TraceCheckUtils]: 61: Hoare triple {28675#false} assume ~r3~0 < 2; {28675#false} is VALID [2022-02-20 18:58:21,198 INFO L290 TraceCheckUtils]: 62: Hoare triple {28675#false} assume !!(0 == ~ep31~0 % 256); {28675#false} is VALID [2022-02-20 18:58:21,198 INFO L290 TraceCheckUtils]: 63: Hoare triple {28675#false} assume !!(0 == ~ep32~0 % 256); {28675#false} is VALID [2022-02-20 18:58:21,198 INFO L290 TraceCheckUtils]: 64: Hoare triple {28675#false} ~mode3~0 := 1; {28675#false} is VALID [2022-02-20 18:58:21,198 INFO L290 TraceCheckUtils]: 65: Hoare triple {28675#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; {28675#false} is VALID [2022-02-20 18:58:21,198 INFO L290 TraceCheckUtils]: 66: Hoare triple {28675#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {28675#false} is VALID [2022-02-20 18:58:21,198 INFO L290 TraceCheckUtils]: 67: Hoare triple {28675#false} ~__return_2084~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2084~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; {28675#false} is VALID [2022-02-20 18:58:21,198 INFO L290 TraceCheckUtils]: 68: Hoare triple {28675#false} assume 0 == main_~assert__arg~0#1 % 256; {28675#false} is VALID [2022-02-20 18:58:21,198 INFO L290 TraceCheckUtils]: 69: Hoare triple {28675#false} assume !false; {28675#false} is VALID [2022-02-20 18:58:21,199 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:21,199 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:21,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326783425] [2022-02-20 18:58:21,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326783425] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:21,201 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:21,201 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:21,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3099216] [2022-02-20 18:58:21,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:21,202 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:21,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:21,202 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:21,245 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:21,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:21,246 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:21,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:21,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:21,247 INFO L87 Difference]: Start difference. First operand 1724 states and 2808 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:23,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:23,883 INFO L93 Difference]: Finished difference Result 3779 states and 6218 transitions. [2022-02-20 18:58:23,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:23,883 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:23,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:23,884 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:23,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-02-20 18:58:23,885 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:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-02-20 18:58:23,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 485 transitions. [2022-02-20 18:58:24,195 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:24,463 INFO L225 Difference]: With dead ends: 3779 [2022-02-20 18:58:24,463 INFO L226 Difference]: Without dead ends: 2591 [2022-02-20 18:58:24,465 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:24,465 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:24,465 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:24,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2022-02-20 18:58:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2589. [2022-02-20 18:58:26,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:26,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2591 states. Second operand has 2589 states, 2588 states have (on average 1.6333075734157652) internal successors, (4227), 2588 states have internal predecessors, (4227), 0 states have call successors, (0), 0 states have 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,453 INFO L74 IsIncluded]: Start isIncluded. First operand 2591 states. Second operand has 2589 states, 2588 states have (on average 1.6333075734157652) internal successors, (4227), 2588 states have internal predecessors, (4227), 0 states have call successors, (0), 0 states have 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,455 INFO L87 Difference]: Start difference. First operand 2591 states. Second operand has 2589 states, 2588 states have (on average 1.6333075734157652) internal successors, (4227), 2588 states have internal predecessors, (4227), 0 states have call successors, (0), 0 states have 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,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:26,630 INFO L93 Difference]: Finished difference Result 2591 states and 4228 transitions. [2022-02-20 18:58:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 4228 transitions. [2022-02-20 18:58:26,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:26,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:26,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 2589 states, 2588 states have (on average 1.6333075734157652) internal successors, (4227), 2588 states have internal predecessors, (4227), 0 states have call successors, (0), 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 2591 states. [2022-02-20 18:58:26,638 INFO L87 Difference]: Start difference. First operand has 2589 states, 2588 states have (on average 1.6333075734157652) internal successors, (4227), 2588 states have internal predecessors, (4227), 0 states have call successors, (0), 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 2591 states. [2022-02-20 18:58:26,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:26,814 INFO L93 Difference]: Finished difference Result 2591 states and 4228 transitions. [2022-02-20 18:58:26,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 4228 transitions. [2022-02-20 18:58:26,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:26,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:26,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:26,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2589 states, 2588 states have (on average 1.6333075734157652) internal successors, (4227), 2588 states have internal predecessors, (4227), 0 states have call successors, (0), 0 states have 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,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2589 states and 4227 transitions. [2022-02-20 18:58:27,079 INFO L78 Accepts]: Start accepts. Automaton has 2589 states and 4227 transitions. Word has length 70 [2022-02-20 18:58:27,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:27,079 INFO L470 AbstractCegarLoop]: Abstraction has 2589 states and 4227 transitions. [2022-02-20 18:58:27,079 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:27,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2589 states and 4227 transitions. [2022-02-20 18:58:27,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:58:27,080 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:27,080 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:27,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:58:27,080 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:27,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:27,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1843763252, now seen corresponding path program 1 times [2022-02-20 18:58:27,081 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:27,081 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888564071] [2022-02-20 18:58:27,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:27,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:27,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {42782#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_1935~0 := 0;~__return_2084~0 := 0;~__return_2191~0 := 0; {42782#true} is VALID [2022-02-20 18:58:27,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {42782#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; {42782#true} is VALID [2022-02-20 18:58:27,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {42782#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {42782#true} is VALID [2022-02-20 18:58:27,119 INFO L290 TraceCheckUtils]: 3: Hoare triple {42782#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {42782#true} is VALID [2022-02-20 18:58:27,119 INFO L290 TraceCheckUtils]: 4: Hoare triple {42782#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {42782#true} is VALID [2022-02-20 18:58:27,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {42782#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {42782#true} is VALID [2022-02-20 18:58:27,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {42782#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {42782#true} is VALID [2022-02-20 18:58:27,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {42782#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {42782#true} is VALID [2022-02-20 18:58:27,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {42782#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {42782#true} is VALID [2022-02-20 18:58:27,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {42782#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {42782#true} is VALID [2022-02-20 18:58:27,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {42782#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {42782#true} is VALID [2022-02-20 18:58:27,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {42782#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {42782#true} is VALID [2022-02-20 18:58:27,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {42782#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {42782#true} is VALID [2022-02-20 18:58:27,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {42782#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {42782#true} is VALID [2022-02-20 18:58:27,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {42782#true} assume ~id1~0 != ~id2~0; {42782#true} is VALID [2022-02-20 18:58:27,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {42782#true} assume ~id1~0 != ~id3~0; {42782#true} is VALID [2022-02-20 18:58:27,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {42782#true} assume ~id2~0 != ~id3~0; {42782#true} is VALID [2022-02-20 18:58:27,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {42782#true} assume ~id1~0 >= 0; {42782#true} is VALID [2022-02-20 18:58:27,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {42782#true} assume ~id2~0 >= 0; {42782#true} is VALID [2022-02-20 18:58:27,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {42782#true} assume ~id3~0 >= 0; {42782#true} is VALID [2022-02-20 18:58:27,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {42782#true} assume 0 == ~r1~0; {42782#true} is VALID [2022-02-20 18:58:27,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {42782#true} assume 0 == ~r2~0; {42782#true} is VALID [2022-02-20 18:58:27,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {42782#true} assume 0 == ~r3~0; {42782#true} is VALID [2022-02-20 18:58:27,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {42782#true} assume !(0 == main_~init__r122~0#1 % 256); {42782#true} is VALID [2022-02-20 18:58:27,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {42782#true} assume !(0 == main_~init__r132~0#1 % 256); {42782#true} is VALID [2022-02-20 18:58:27,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {42782#true} assume !(0 == main_~init__r212~0#1 % 256); {42782#true} is VALID [2022-02-20 18:58:27,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {42782#true} assume !(0 == main_~init__r232~0#1 % 256); {42782#true} is VALID [2022-02-20 18:58:27,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {42782#true} assume !(0 == main_~init__r312~0#1 % 256); {42782#true} is VALID [2022-02-20 18:58:27,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {42782#true} assume !(0 == main_~init__r322~0#1 % 256); {42782#true} is VALID [2022-02-20 18:58:27,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {42782#true} assume ~max1~0 == ~id1~0; {42782#true} is VALID [2022-02-20 18:58:27,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {42782#true} assume ~max2~0 == ~id2~0; {42782#true} is VALID [2022-02-20 18:58:27,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {42782#true} assume ~max3~0 == ~id3~0; {42782#true} is VALID [2022-02-20 18:58:27,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {42782#true} assume 0 == ~st1~0; {42782#true} is VALID [2022-02-20 18:58:27,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {42782#true} assume 0 == ~st2~0; {42782#true} is VALID [2022-02-20 18:58:27,122 INFO L290 TraceCheckUtils]: 34: Hoare triple {42782#true} assume 0 == ~st3~0; {42782#true} is VALID [2022-02-20 18:58:27,122 INFO L290 TraceCheckUtils]: 35: Hoare triple {42782#true} assume 0 == ~nl1~0; {42782#true} is VALID [2022-02-20 18:58:27,123 INFO L290 TraceCheckUtils]: 36: Hoare triple {42782#true} assume 0 == ~nl2~0; {42782#true} is VALID [2022-02-20 18:58:27,123 INFO L290 TraceCheckUtils]: 37: Hoare triple {42782#true} assume 0 == ~nl3~0; {42782#true} is VALID [2022-02-20 18:58:27,123 INFO L290 TraceCheckUtils]: 38: Hoare triple {42782#true} assume 0 == ~mode1~0 % 256; {42782#true} is VALID [2022-02-20 18:58:27,123 INFO L290 TraceCheckUtils]: 39: Hoare triple {42782#true} assume 0 == ~mode2~0 % 256; {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:27,124 INFO L290 TraceCheckUtils]: 40: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:27,124 INFO L290 TraceCheckUtils]: 41: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~newmax1~0 % 256); {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:27,124 INFO L290 TraceCheckUtils]: 42: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~newmax2~0 % 256); {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:27,125 INFO L290 TraceCheckUtils]: 43: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1935~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1935~0; {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:27,125 INFO L290 TraceCheckUtils]: 44: Hoare triple {42784#(= (+ (* (- 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; {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:27,126 INFO L290 TraceCheckUtils]: 45: Hoare triple {42784#(= (+ (* (- 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; {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:27,126 INFO L290 TraceCheckUtils]: 46: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256); {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:27,126 INFO L290 TraceCheckUtils]: 47: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 < 2; {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:27,127 INFO L290 TraceCheckUtils]: 48: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~ep12~0 % 256); {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:27,127 INFO L290 TraceCheckUtils]: 49: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~ep13~0 % 256); {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:27,127 INFO L290 TraceCheckUtils]: 50: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:27,128 INFO L290 TraceCheckUtils]: 51: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:27,128 INFO L290 TraceCheckUtils]: 52: Hoare triple {42784#(= (+ (* (- 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); {42783#false} is VALID [2022-02-20 18:58:27,128 INFO L290 TraceCheckUtils]: 53: Hoare triple {42783#false} assume !!(0 == ~ep12~0 % 256); {42783#false} is VALID [2022-02-20 18:58:27,128 INFO L290 TraceCheckUtils]: 54: Hoare triple {42783#false} assume !!(0 == ~ep32~0 % 256); {42783#false} is VALID [2022-02-20 18:58:27,129 INFO L290 TraceCheckUtils]: 55: Hoare triple {42783#false} ~newmax2~0 := main_~node2__newmax~0#1; {42783#false} is VALID [2022-02-20 18:58:27,129 INFO L290 TraceCheckUtils]: 56: Hoare triple {42783#false} assume 2 == ~r2~0; {42783#false} is VALID [2022-02-20 18:58:27,129 INFO L290 TraceCheckUtils]: 57: Hoare triple {42783#false} assume ~max2~0 == ~id2~0;~st2~0 := 1; {42783#false} is VALID [2022-02-20 18:58:27,129 INFO L290 TraceCheckUtils]: 58: Hoare triple {42783#false} ~mode2~0 := 0; {42783#false} is VALID [2022-02-20 18:58:27,129 INFO L290 TraceCheckUtils]: 59: Hoare triple {42783#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {42783#false} is VALID [2022-02-20 18:58:27,129 INFO L290 TraceCheckUtils]: 60: Hoare triple {42783#false} assume !!(0 == ~mode3~0 % 256); {42783#false} is VALID [2022-02-20 18:58:27,129 INFO L290 TraceCheckUtils]: 61: Hoare triple {42783#false} assume ~r3~0 < 2; {42783#false} is VALID [2022-02-20 18:58:27,129 INFO L290 TraceCheckUtils]: 62: Hoare triple {42783#false} assume !!(0 == ~ep31~0 % 256); {42783#false} is VALID [2022-02-20 18:58:27,130 INFO L290 TraceCheckUtils]: 63: Hoare triple {42783#false} assume !!(0 == ~ep32~0 % 256); {42783#false} is VALID [2022-02-20 18:58:27,130 INFO L290 TraceCheckUtils]: 64: Hoare triple {42783#false} ~mode3~0 := 1; {42783#false} is VALID [2022-02-20 18:58:27,130 INFO L290 TraceCheckUtils]: 65: Hoare triple {42783#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; {42783#false} is VALID [2022-02-20 18:58:27,130 INFO L290 TraceCheckUtils]: 66: Hoare triple {42783#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {42783#false} is VALID [2022-02-20 18:58:27,130 INFO L290 TraceCheckUtils]: 67: Hoare triple {42783#false} ~__return_2084~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2084~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; {42783#false} is VALID [2022-02-20 18:58:27,130 INFO L290 TraceCheckUtils]: 68: Hoare triple {42783#false} assume 0 == main_~assert__arg~0#1 % 256; {42783#false} is VALID [2022-02-20 18:58:27,130 INFO L290 TraceCheckUtils]: 69: Hoare triple {42783#false} assume !false; {42783#false} is VALID [2022-02-20 18:58:27,130 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,131 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:27,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888564071] [2022-02-20 18:58:27,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888564071] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:27,131 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:27,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:27,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764423037] [2022-02-20 18:58:27,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:27,132 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:27,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:27,132 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:27,175 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:27,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:27,176 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:27,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:27,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:27,176 INFO L87 Difference]: Start difference. First operand 2589 states and 4227 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:30,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:30,503 INFO L93 Difference]: Finished difference Result 5033 states and 8246 transitions. [2022-02-20 18:58:30,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:30,503 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:30,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:30,504 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:30,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-02-20 18:58:30,505 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:30,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-02-20 18:58:30,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 485 transitions. [2022-02-20 18:58:30,675 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:31,195 INFO L225 Difference]: With dead ends: 5033 [2022-02-20 18:58:31,196 INFO L226 Difference]: Without dead ends: 3599 [2022-02-20 18:58:31,197 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:31,198 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:31,198 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:31,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3599 states. [2022-02-20 18:58:33,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3599 to 3597. [2022-02-20 18:58:33,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:33,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3599 states. Second operand has 3597 states, 3596 states have (on average 1.628754171301446) internal successors, (5857), 3596 states have internal predecessors, (5857), 0 states have call successors, (0), 0 states have 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,230 INFO L74 IsIncluded]: Start isIncluded. First operand 3599 states. Second operand has 3597 states, 3596 states have (on average 1.628754171301446) internal successors, (5857), 3596 states have internal predecessors, (5857), 0 states have call successors, (0), 0 states have 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,247 INFO L87 Difference]: Start difference. First operand 3599 states. Second operand has 3597 states, 3596 states have (on average 1.628754171301446) internal successors, (5857), 3596 states have internal predecessors, (5857), 0 states have call successors, (0), 0 states have 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,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:33,639 INFO L93 Difference]: Finished difference Result 3599 states and 5858 transitions. [2022-02-20 18:58:33,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 5858 transitions. [2022-02-20 18:58:33,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:33,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:33,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 3597 states, 3596 states have (on average 1.628754171301446) internal successors, (5857), 3596 states have internal predecessors, (5857), 0 states have call successors, (0), 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 3599 states. [2022-02-20 18:58:33,650 INFO L87 Difference]: Start difference. First operand has 3597 states, 3596 states have (on average 1.628754171301446) internal successors, (5857), 3596 states have internal predecessors, (5857), 0 states have call successors, (0), 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 3599 states. [2022-02-20 18:58:34,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:34,038 INFO L93 Difference]: Finished difference Result 3599 states and 5858 transitions. [2022-02-20 18:58:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 5858 transitions. [2022-02-20 18:58:34,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:34,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:34,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:34,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3597 states, 3596 states have (on average 1.628754171301446) internal successors, (5857), 3596 states have internal predecessors, (5857), 0 states have call successors, (0), 0 states have 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:34,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 5857 transitions. [2022-02-20 18:58:34,567 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 5857 transitions. Word has length 70 [2022-02-20 18:58:34,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:34,567 INFO L470 AbstractCegarLoop]: Abstraction has 3597 states and 5857 transitions. [2022-02-20 18:58:34,567 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:34,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 5857 transitions. [2022-02-20 18:58:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:58:34,568 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:34,568 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:58:34,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:58:34,568 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:34,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:34,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1414453242, now seen corresponding path program 1 times [2022-02-20 18:58:34,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:34,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59725380] [2022-02-20 18:58:34,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:34,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:34,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {62079#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_1935~0 := 0;~__return_2084~0 := 0;~__return_2191~0 := 0; {62079#true} is VALID [2022-02-20 18:58:34,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {62079#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; {62079#true} is VALID [2022-02-20 18:58:34,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {62079#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {62079#true} is VALID [2022-02-20 18:58:34,615 INFO L290 TraceCheckUtils]: 3: Hoare triple {62079#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {62079#true} is VALID [2022-02-20 18:58:34,615 INFO L290 TraceCheckUtils]: 4: Hoare triple {62079#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {62079#true} is VALID [2022-02-20 18:58:34,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {62079#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {62079#true} is VALID [2022-02-20 18:58:34,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {62079#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {62079#true} is VALID [2022-02-20 18:58:34,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {62079#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {62079#true} is VALID [2022-02-20 18:58:34,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {62079#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {62079#true} is VALID [2022-02-20 18:58:34,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {62079#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {62079#true} is VALID [2022-02-20 18:58:34,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {62079#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {62079#true} is VALID [2022-02-20 18:58:34,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {62079#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {62079#true} is VALID [2022-02-20 18:58:34,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {62079#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {62079#true} is VALID [2022-02-20 18:58:34,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {62079#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {62079#true} is VALID [2022-02-20 18:58:34,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {62079#true} assume ~id1~0 != ~id2~0; {62079#true} is VALID [2022-02-20 18:58:34,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {62079#true} assume ~id1~0 != ~id3~0; {62079#true} is VALID [2022-02-20 18:58:34,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {62079#true} assume ~id2~0 != ~id3~0; {62079#true} is VALID [2022-02-20 18:58:34,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {62079#true} assume ~id1~0 >= 0; {62079#true} is VALID [2022-02-20 18:58:34,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {62079#true} assume ~id2~0 >= 0; {62079#true} is VALID [2022-02-20 18:58:34,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {62079#true} assume ~id3~0 >= 0; {62079#true} is VALID [2022-02-20 18:58:34,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {62079#true} assume 0 == ~r1~0; {62079#true} is VALID [2022-02-20 18:58:34,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {62079#true} assume 0 == ~r2~0; {62079#true} is VALID [2022-02-20 18:58:34,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {62079#true} assume 0 == ~r3~0; {62079#true} is VALID [2022-02-20 18:58:34,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {62079#true} assume !(0 == main_~init__r122~0#1 % 256); {62079#true} is VALID [2022-02-20 18:58:34,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {62079#true} assume !(0 == main_~init__r132~0#1 % 256); {62079#true} is VALID [2022-02-20 18:58:34,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {62079#true} assume !(0 == main_~init__r212~0#1 % 256); {62079#true} is VALID [2022-02-20 18:58:34,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {62079#true} assume !(0 == main_~init__r232~0#1 % 256); {62079#true} is VALID [2022-02-20 18:58:34,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {62079#true} assume !(0 == main_~init__r312~0#1 % 256); {62079#true} is VALID [2022-02-20 18:58:34,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {62079#true} assume !(0 == main_~init__r322~0#1 % 256); {62079#true} is VALID [2022-02-20 18:58:34,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {62079#true} assume ~max1~0 == ~id1~0; {62079#true} is VALID [2022-02-20 18:58:34,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {62079#true} assume ~max2~0 == ~id2~0; {62079#true} is VALID [2022-02-20 18:58:34,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {62079#true} assume ~max3~0 == ~id3~0; {62079#true} is VALID [2022-02-20 18:58:34,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {62079#true} assume 0 == ~st1~0; {62079#true} is VALID [2022-02-20 18:58:34,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {62079#true} assume 0 == ~st2~0; {62081#(<= ~st2~0 0)} is VALID [2022-02-20 18:58:34,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {62081#(<= ~st2~0 0)} assume 0 == ~st3~0; {62081#(<= ~st2~0 0)} is VALID [2022-02-20 18:58:34,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {62081#(<= ~st2~0 0)} assume 0 == ~nl1~0; {62081#(<= ~st2~0 0)} is VALID [2022-02-20 18:58:34,619 INFO L290 TraceCheckUtils]: 36: Hoare triple {62081#(<= ~st2~0 0)} assume 0 == ~nl2~0; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,620 INFO L290 TraceCheckUtils]: 38: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,620 INFO L290 TraceCheckUtils]: 39: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,621 INFO L290 TraceCheckUtils]: 40: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,621 INFO L290 TraceCheckUtils]: 41: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax1~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,621 INFO L290 TraceCheckUtils]: 42: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax2~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,622 INFO L290 TraceCheckUtils]: 43: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1935~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1935~0; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,622 INFO L290 TraceCheckUtils]: 44: Hoare triple {62082#(<= (+ ~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; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,623 INFO L290 TraceCheckUtils]: 45: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,623 INFO L290 TraceCheckUtils]: 46: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,623 INFO L290 TraceCheckUtils]: 47: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 < 2; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,624 INFO L290 TraceCheckUtils]: 48: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep12~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,624 INFO L290 TraceCheckUtils]: 49: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep13~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,624 INFO L290 TraceCheckUtils]: 50: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,625 INFO L290 TraceCheckUtils]: 51: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,625 INFO L290 TraceCheckUtils]: 52: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,625 INFO L290 TraceCheckUtils]: 53: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 < 2; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,626 INFO L290 TraceCheckUtils]: 54: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep21~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,626 INFO L290 TraceCheckUtils]: 55: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep23~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,626 INFO L290 TraceCheckUtils]: 56: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,627 INFO L290 TraceCheckUtils]: 57: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,627 INFO L290 TraceCheckUtils]: 58: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,627 INFO L290 TraceCheckUtils]: 59: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 < 2; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,628 INFO L290 TraceCheckUtils]: 60: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep31~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,628 INFO L290 TraceCheckUtils]: 61: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep32~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,628 INFO L290 TraceCheckUtils]: 62: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,629 INFO L290 TraceCheckUtils]: 63: Hoare triple {62082#(<= (+ ~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; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,629 INFO L290 TraceCheckUtils]: 64: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,629 INFO L290 TraceCheckUtils]: 65: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:34,630 INFO L290 TraceCheckUtils]: 66: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);main_~check__tmp~0#1 := 0; {62080#false} is VALID [2022-02-20 18:58:34,630 INFO L290 TraceCheckUtils]: 67: Hoare triple {62080#false} ~__return_2084~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2084~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; {62080#false} is VALID [2022-02-20 18:58:34,630 INFO L290 TraceCheckUtils]: 68: Hoare triple {62080#false} assume 0 == main_~assert__arg~0#1 % 256; {62080#false} is VALID [2022-02-20 18:58:34,630 INFO L290 TraceCheckUtils]: 69: Hoare triple {62080#false} assume !false; {62080#false} is VALID [2022-02-20 18:58:34,630 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:34,631 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:34,631 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59725380] [2022-02-20 18:58:34,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59725380] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:34,631 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:34,631 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:58:34,631 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344935221] [2022-02-20 18:58:34,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:34,632 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:34,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:34,632 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:34,681 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:34,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:58:34,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:34,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:58:34,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:58:34,682 INFO L87 Difference]: Start difference. First operand 3597 states and 5857 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:58:44,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:44,214 INFO L93 Difference]: Finished difference Result 11303 states and 18475 transitions. [2022-02-20 18:58:44,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:58:44,214 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:44,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:44,215 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:58:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 671 transitions. [2022-02-20 18:58:44,217 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:58:44,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 671 transitions. [2022-02-20 18:58:44,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 671 transitions. [2022-02-20 18:58:44,489 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:47,045 INFO L225 Difference]: With dead ends: 11303 [2022-02-20 18:58:47,045 INFO L226 Difference]: Without dead ends: 7781 [2022-02-20 18:58:47,049 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:47,049 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:58:47,049 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:58:47,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7781 states. [2022-02-20 18:58:50,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7781 to 5670. [2022-02-20 18:58:50,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:50,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7781 states. Second operand has 5670 states, 5669 states have (on average 1.6232139707179396) internal successors, (9202), 5669 states have internal predecessors, (9202), 0 states have call successors, (0), 0 states have 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:50,022 INFO L74 IsIncluded]: Start isIncluded. First operand 7781 states. Second operand has 5670 states, 5669 states have (on average 1.6232139707179396) internal successors, (9202), 5669 states have internal predecessors, (9202), 0 states have call successors, (0), 0 states have 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:50,027 INFO L87 Difference]: Start difference. First operand 7781 states. Second operand has 5670 states, 5669 states have (on average 1.6232139707179396) internal successors, (9202), 5669 states have internal predecessors, (9202), 0 states have call successors, (0), 0 states have 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,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:51,690 INFO L93 Difference]: Finished difference Result 7781 states and 12668 transitions. [2022-02-20 18:58:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 7781 states and 12668 transitions. [2022-02-20 18:58:51,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:51,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:51,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 5670 states, 5669 states have (on average 1.6232139707179396) internal successors, (9202), 5669 states have internal predecessors, (9202), 0 states have call successors, (0), 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 7781 states. [2022-02-20 18:58:51,709 INFO L87 Difference]: Start difference. First operand has 5670 states, 5669 states have (on average 1.6232139707179396) internal successors, (9202), 5669 states have internal predecessors, (9202), 0 states have call successors, (0), 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 7781 states. [2022-02-20 18:58:53,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:53,520 INFO L93 Difference]: Finished difference Result 7781 states and 12668 transitions. [2022-02-20 18:58:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 7781 states and 12668 transitions. [2022-02-20 18:58:53,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:53,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:53,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:53,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:53,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5670 states, 5669 states have (on average 1.6232139707179396) internal successors, (9202), 5669 states have internal predecessors, (9202), 0 states have call successors, (0), 0 states have 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:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5670 states to 5670 states and 9202 transitions. [2022-02-20 18:58:54,830 INFO L78 Accepts]: Start accepts. Automaton has 5670 states and 9202 transitions. Word has length 70 [2022-02-20 18:58:54,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:54,830 INFO L470 AbstractCegarLoop]: Abstraction has 5670 states and 9202 transitions. [2022-02-20 18:58:54,830 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:58:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 5670 states and 9202 transitions. [2022-02-20 18:58:54,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:58:54,831 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:54,831 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:54,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:58:54,831 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:54,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:54,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1510229994, now seen corresponding path program 1 times [2022-02-20 18:58:54,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:54,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566406851] [2022-02-20 18:58:54,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:54,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:54,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {101470#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_1935~0 := 0;~__return_2084~0 := 0;~__return_2191~0 := 0; {101470#true} is VALID [2022-02-20 18:58:54,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {101470#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; {101470#true} is VALID [2022-02-20 18:58:54,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {101470#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {101470#true} is VALID [2022-02-20 18:58:54,868 INFO L290 TraceCheckUtils]: 3: Hoare triple {101470#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {101470#true} is VALID [2022-02-20 18:58:54,868 INFO L290 TraceCheckUtils]: 4: Hoare triple {101470#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {101470#true} is VALID [2022-02-20 18:58:54,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {101470#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {101470#true} is VALID [2022-02-20 18:58:54,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {101470#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {101470#true} is VALID [2022-02-20 18:58:54,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {101470#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {101470#true} is VALID [2022-02-20 18:58:54,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {101470#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {101470#true} is VALID [2022-02-20 18:58:54,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {101470#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {101470#true} is VALID [2022-02-20 18:58:54,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {101470#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {101470#true} is VALID [2022-02-20 18:58:54,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {101470#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {101470#true} is VALID [2022-02-20 18:58:54,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {101470#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {101470#true} is VALID [2022-02-20 18:58:54,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {101470#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {101470#true} is VALID [2022-02-20 18:58:54,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {101470#true} assume ~id1~0 != ~id2~0; {101470#true} is VALID [2022-02-20 18:58:54,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {101470#true} assume ~id1~0 != ~id3~0; {101470#true} is VALID [2022-02-20 18:58:54,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {101470#true} assume ~id2~0 != ~id3~0; {101470#true} is VALID [2022-02-20 18:58:54,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {101470#true} assume ~id1~0 >= 0; {101470#true} is VALID [2022-02-20 18:58:54,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {101470#true} assume ~id2~0 >= 0; {101470#true} is VALID [2022-02-20 18:58:54,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {101470#true} assume ~id3~0 >= 0; {101470#true} is VALID [2022-02-20 18:58:54,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {101470#true} assume 0 == ~r1~0; {101470#true} is VALID [2022-02-20 18:58:54,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {101470#true} assume 0 == ~r2~0; {101470#true} is VALID [2022-02-20 18:58:54,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {101470#true} assume 0 == ~r3~0; {101470#true} is VALID [2022-02-20 18:58:54,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {101470#true} assume !(0 == main_~init__r122~0#1 % 256); {101470#true} is VALID [2022-02-20 18:58:54,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {101470#true} assume !(0 == main_~init__r132~0#1 % 256); {101470#true} is VALID [2022-02-20 18:58:54,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {101470#true} assume !(0 == main_~init__r212~0#1 % 256); {101470#true} is VALID [2022-02-20 18:58:54,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {101470#true} assume !(0 == main_~init__r232~0#1 % 256); {101470#true} is VALID [2022-02-20 18:58:54,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {101470#true} assume !(0 == main_~init__r312~0#1 % 256); {101470#true} is VALID [2022-02-20 18:58:54,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {101470#true} assume !(0 == main_~init__r322~0#1 % 256); {101470#true} is VALID [2022-02-20 18:58:54,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {101470#true} assume ~max1~0 == ~id1~0; {101470#true} is VALID [2022-02-20 18:58:54,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {101470#true} assume ~max2~0 == ~id2~0; {101470#true} is VALID [2022-02-20 18:58:54,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {101470#true} assume ~max3~0 == ~id3~0; {101470#true} is VALID [2022-02-20 18:58:54,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {101470#true} assume 0 == ~st1~0; {101470#true} is VALID [2022-02-20 18:58:54,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {101470#true} assume 0 == ~st2~0; {101470#true} is VALID [2022-02-20 18:58:54,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {101470#true} assume 0 == ~st3~0; {101470#true} is VALID [2022-02-20 18:58:54,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {101470#true} assume 0 == ~nl1~0; {101470#true} is VALID [2022-02-20 18:58:54,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {101470#true} assume 0 == ~nl2~0; {101470#true} is VALID [2022-02-20 18:58:54,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {101470#true} assume 0 == ~nl3~0; {101470#true} is VALID [2022-02-20 18:58:54,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {101470#true} assume 0 == ~mode1~0 % 256; {101470#true} is VALID [2022-02-20 18:58:54,872 INFO L290 TraceCheckUtils]: 39: Hoare triple {101470#true} assume 0 == ~mode2~0 % 256; {101470#true} is VALID [2022-02-20 18:58:54,872 INFO L290 TraceCheckUtils]: 40: Hoare triple {101470#true} assume 0 == ~mode3~0 % 256; {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:54,872 INFO L290 TraceCheckUtils]: 41: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~newmax1~0 % 256); {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:54,873 INFO L290 TraceCheckUtils]: 42: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~newmax2~0 % 256); {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:54,873 INFO L290 TraceCheckUtils]: 43: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1935~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1935~0; {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:54,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {101472#(= (+ (* (- 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; {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:54,874 INFO L290 TraceCheckUtils]: 45: Hoare triple {101472#(= (+ (* (- 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; {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:54,874 INFO L290 TraceCheckUtils]: 46: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256); {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:54,874 INFO L290 TraceCheckUtils]: 47: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 < 2; {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:54,875 INFO L290 TraceCheckUtils]: 48: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep12~0 % 256); {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:54,875 INFO L290 TraceCheckUtils]: 49: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep13~0 % 256); {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:54,875 INFO L290 TraceCheckUtils]: 50: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:54,876 INFO L290 TraceCheckUtils]: 51: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:54,876 INFO L290 TraceCheckUtils]: 52: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256); {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:54,876 INFO L290 TraceCheckUtils]: 53: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 < 2; {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:54,876 INFO L290 TraceCheckUtils]: 54: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep21~0 % 256); {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:54,877 INFO L290 TraceCheckUtils]: 55: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep23~0 % 256); {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:54,877 INFO L290 TraceCheckUtils]: 56: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:54,877 INFO L290 TraceCheckUtils]: 57: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:54,878 INFO L290 TraceCheckUtils]: 58: Hoare triple {101472#(= (+ (* (- 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); {101471#false} is VALID [2022-02-20 18:58:54,878 INFO L290 TraceCheckUtils]: 59: Hoare triple {101471#false} assume !!(0 == ~ep13~0 % 256); {101471#false} is VALID [2022-02-20 18:58:54,878 INFO L290 TraceCheckUtils]: 60: Hoare triple {101471#false} assume !!(0 == ~ep23~0 % 256); {101471#false} is VALID [2022-02-20 18:58:54,878 INFO L290 TraceCheckUtils]: 61: Hoare triple {101471#false} ~newmax3~0 := main_~node3__newmax~0#1; {101471#false} is VALID [2022-02-20 18:58:54,878 INFO L290 TraceCheckUtils]: 62: Hoare triple {101471#false} assume 2 == ~r3~0; {101471#false} is VALID [2022-02-20 18:58:54,879 INFO L290 TraceCheckUtils]: 63: Hoare triple {101471#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {101471#false} is VALID [2022-02-20 18:58:54,879 INFO L290 TraceCheckUtils]: 64: Hoare triple {101471#false} ~mode3~0 := 0; {101471#false} is VALID [2022-02-20 18:58:54,879 INFO L290 TraceCheckUtils]: 65: Hoare triple {101471#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; {101471#false} is VALID [2022-02-20 18:58:54,879 INFO L290 TraceCheckUtils]: 66: Hoare triple {101471#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {101471#false} is VALID [2022-02-20 18:58:54,879 INFO L290 TraceCheckUtils]: 67: Hoare triple {101471#false} ~__return_2084~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2084~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; {101471#false} is VALID [2022-02-20 18:58:54,879 INFO L290 TraceCheckUtils]: 68: Hoare triple {101471#false} assume 0 == main_~assert__arg~0#1 % 256; {101471#false} is VALID [2022-02-20 18:58:54,879 INFO L290 TraceCheckUtils]: 69: Hoare triple {101471#false} assume !false; {101471#false} is VALID [2022-02-20 18:58:54,879 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:54,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:54,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566406851] [2022-02-20 18:58:54,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566406851] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:54,880 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:54,880 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:54,880 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937198998] [2022-02-20 18:58:54,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:54,881 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:54,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:54,881 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:54,907 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:54,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:54,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:54,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:54,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:54,908 INFO L87 Difference]: Start difference. First operand 5670 states and 9202 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:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:03,736 INFO L93 Difference]: Finished difference Result 11090 states and 18039 transitions. [2022-02-20 18:59:03,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:59:03,736 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:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:59:03,736 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:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-02-20 18:59:03,738 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:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-02-20 18:59:03,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 485 transitions. [2022-02-20 18:59:03,909 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:59:06,467 INFO L225 Difference]: With dead ends: 11090 [2022-02-20 18:59:06,468 INFO L226 Difference]: Without dead ends: 7838 [2022-02-20 18:59:06,471 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:59:06,488 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 120 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 475 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:59:06,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 475 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:59:06,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7838 states. [2022-02-20 18:59:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7838 to 7836. [2022-02-20 18:59:10,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:59:10,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7838 states. Second operand has 7836 states, 7835 states have (on average 1.61531589023612) internal successors, (12656), 7835 states have internal predecessors, (12656), 0 states have call successors, (0), 0 states have 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:10,480 INFO L74 IsIncluded]: Start isIncluded. First operand 7838 states. Second operand has 7836 states, 7835 states have (on average 1.61531589023612) internal successors, (12656), 7835 states have internal predecessors, (12656), 0 states have call successors, (0), 0 states have 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:10,487 INFO L87 Difference]: Start difference. First operand 7838 states. Second operand has 7836 states, 7835 states have (on average 1.61531589023612) internal successors, (12656), 7835 states have internal predecessors, (12656), 0 states have call successors, (0), 0 states have 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:12,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:12,200 INFO L93 Difference]: Finished difference Result 7838 states and 12657 transitions. [2022-02-20 18:59:12,200 INFO L276 IsEmpty]: Start isEmpty. Operand 7838 states and 12657 transitions. [2022-02-20 18:59:12,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:59:12,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:59:12,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 7836 states, 7835 states have (on average 1.61531589023612) internal successors, (12656), 7835 states have internal predecessors, (12656), 0 states have call successors, (0), 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 7838 states. [2022-02-20 18:59:12,220 INFO L87 Difference]: Start difference. First operand has 7836 states, 7835 states have (on average 1.61531589023612) internal successors, (12656), 7835 states have internal predecessors, (12656), 0 states have call successors, (0), 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 7838 states. [2022-02-20 18:59:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:13,962 INFO L93 Difference]: Finished difference Result 7838 states and 12657 transitions. [2022-02-20 18:59:13,962 INFO L276 IsEmpty]: Start isEmpty. Operand 7838 states and 12657 transitions. [2022-02-20 18:59:13,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:59:13,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:59:13,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:59:13,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:59:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7836 states, 7835 states have (on average 1.61531589023612) internal successors, (12656), 7835 states have internal predecessors, (12656), 0 states have call successors, (0), 0 states have 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:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7836 states to 7836 states and 12656 transitions. [2022-02-20 18:59:16,533 INFO L78 Accepts]: Start accepts. Automaton has 7836 states and 12656 transitions. Word has length 70 [2022-02-20 18:59:16,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:59:16,533 INFO L470 AbstractCegarLoop]: Abstraction has 7836 states and 12656 transitions. [2022-02-20 18:59:16,533 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:59:16,533 INFO L276 IsEmpty]: Start isEmpty. Operand 7836 states and 12656 transitions. [2022-02-20 18:59:16,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 18:59:16,534 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:59:16,534 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, 1] [2022-02-20 18:59:16,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:59:16,534 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:59:16,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:59:16,535 INFO L85 PathProgramCache]: Analyzing trace with hash 844989402, now seen corresponding path program 1 times [2022-02-20 18:59:16,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:59:16,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485083042] [2022-02-20 18:59:16,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:59:16,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:59:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:59:16,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {143710#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_1935~0 := 0;~__return_2084~0 := 0;~__return_2191~0 := 0; {143710#true} is VALID [2022-02-20 18:59:16,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {143710#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; {143710#true} is VALID [2022-02-20 18:59:16,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {143710#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {143710#true} is VALID [2022-02-20 18:59:16,588 INFO L290 TraceCheckUtils]: 3: Hoare triple {143710#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {143710#true} is VALID [2022-02-20 18:59:16,588 INFO L290 TraceCheckUtils]: 4: Hoare triple {143710#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {143710#true} is VALID [2022-02-20 18:59:16,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {143710#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {143710#true} is VALID [2022-02-20 18:59:16,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {143710#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {143710#true} is VALID [2022-02-20 18:59:16,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {143710#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {143710#true} is VALID [2022-02-20 18:59:16,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {143710#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {143710#true} is VALID [2022-02-20 18:59:16,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {143710#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {143710#true} is VALID [2022-02-20 18:59:16,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {143710#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {143710#true} is VALID [2022-02-20 18:59:16,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {143710#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {143710#true} is VALID [2022-02-20 18:59:16,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {143710#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {143710#true} is VALID [2022-02-20 18:59:16,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {143710#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {143710#true} is VALID [2022-02-20 18:59:16,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {143710#true} assume ~id1~0 != ~id2~0; {143710#true} is VALID [2022-02-20 18:59:16,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {143710#true} assume ~id1~0 != ~id3~0; {143710#true} is VALID [2022-02-20 18:59:16,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {143710#true} assume ~id2~0 != ~id3~0; {143710#true} is VALID [2022-02-20 18:59:16,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {143710#true} assume ~id1~0 >= 0; {143710#true} is VALID [2022-02-20 18:59:16,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {143710#true} assume ~id2~0 >= 0; {143710#true} is VALID [2022-02-20 18:59:16,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {143710#true} assume ~id3~0 >= 0; {143710#true} is VALID [2022-02-20 18:59:16,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {143710#true} assume 0 == ~r1~0; {143710#true} is VALID [2022-02-20 18:59:16,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {143710#true} assume 0 == ~r2~0; {143710#true} is VALID [2022-02-20 18:59:16,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {143710#true} assume 0 == ~r3~0; {143710#true} is VALID [2022-02-20 18:59:16,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {143710#true} assume !(0 == main_~init__r122~0#1 % 256); {143710#true} is VALID [2022-02-20 18:59:16,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {143710#true} assume !(0 == main_~init__r132~0#1 % 256); {143710#true} is VALID [2022-02-20 18:59:16,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {143710#true} assume !(0 == main_~init__r212~0#1 % 256); {143710#true} is VALID [2022-02-20 18:59:16,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {143710#true} assume !(0 == main_~init__r232~0#1 % 256); {143710#true} is VALID [2022-02-20 18:59:16,591 INFO L290 TraceCheckUtils]: 27: Hoare triple {143710#true} assume !(0 == main_~init__r312~0#1 % 256); {143710#true} is VALID [2022-02-20 18:59:16,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {143710#true} assume !(0 == main_~init__r322~0#1 % 256); {143710#true} is VALID [2022-02-20 18:59:16,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {143710#true} assume ~max1~0 == ~id1~0; {143710#true} is VALID [2022-02-20 18:59:16,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {143710#true} assume ~max2~0 == ~id2~0; {143710#true} is VALID [2022-02-20 18:59:16,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {143710#true} assume ~max3~0 == ~id3~0; {143710#true} is VALID [2022-02-20 18:59:16,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {143710#true} assume 0 == ~st1~0; {143710#true} is VALID [2022-02-20 18:59:16,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {143710#true} assume 0 == ~st2~0; {143710#true} is VALID [2022-02-20 18:59:16,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {143710#true} assume 0 == ~st3~0; {143712#(<= ~st3~0 0)} is VALID [2022-02-20 18:59:16,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {143712#(<= ~st3~0 0)} assume 0 == ~nl1~0; {143712#(<= ~st3~0 0)} is VALID [2022-02-20 18:59:16,593 INFO L290 TraceCheckUtils]: 36: Hoare triple {143712#(<= ~st3~0 0)} assume 0 == ~nl2~0; {143712#(<= ~st3~0 0)} is VALID [2022-02-20 18:59:16,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {143712#(<= ~st3~0 0)} assume 0 == ~nl3~0; {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,593 INFO L290 TraceCheckUtils]: 39: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,594 INFO L290 TraceCheckUtils]: 40: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256; {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,594 INFO L290 TraceCheckUtils]: 41: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == ~newmax1~0 % 256); {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == ~newmax2~0 % 256); {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,595 INFO L290 TraceCheckUtils]: 43: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1935~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1935~0; {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,595 INFO L290 TraceCheckUtils]: 44: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~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; {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,596 INFO L290 TraceCheckUtils]: 45: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,596 INFO L290 TraceCheckUtils]: 46: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~mode1~0 % 256); {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,596 INFO L290 TraceCheckUtils]: 47: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 < 2; {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,597 INFO L290 TraceCheckUtils]: 48: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep12~0 % 256); {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,597 INFO L290 TraceCheckUtils]: 49: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep13~0 % 256); {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,597 INFO L290 TraceCheckUtils]: 50: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,597 INFO L290 TraceCheckUtils]: 51: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,598 INFO L290 TraceCheckUtils]: 52: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~mode2~0 % 256); {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,598 INFO L290 TraceCheckUtils]: 53: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 < 2; {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,598 INFO L290 TraceCheckUtils]: 54: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep21~0 % 256); {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,599 INFO L290 TraceCheckUtils]: 55: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep23~0 % 256); {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,599 INFO L290 TraceCheckUtils]: 56: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,599 INFO L290 TraceCheckUtils]: 57: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,600 INFO L290 TraceCheckUtils]: 58: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~mode3~0 % 256); {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,600 INFO L290 TraceCheckUtils]: 59: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 < 2; {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,600 INFO L290 TraceCheckUtils]: 60: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep31~0 % 256); {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,601 INFO L290 TraceCheckUtils]: 61: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep32~0 % 256); {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,601 INFO L290 TraceCheckUtils]: 62: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,601 INFO L290 TraceCheckUtils]: 63: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~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; {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,602 INFO L290 TraceCheckUtils]: 64: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,602 INFO L290 TraceCheckUtils]: 65: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,602 INFO L290 TraceCheckUtils]: 66: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {143713#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:59:16,603 INFO L290 TraceCheckUtils]: 67: Hoare triple {143713#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);main_~check__tmp~0#1 := 0; {143711#false} is VALID [2022-02-20 18:59:16,603 INFO L290 TraceCheckUtils]: 68: Hoare triple {143711#false} ~__return_2084~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2084~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; {143711#false} is VALID [2022-02-20 18:59:16,603 INFO L290 TraceCheckUtils]: 69: Hoare triple {143711#false} assume 0 == main_~assert__arg~0#1 % 256; {143711#false} is VALID [2022-02-20 18:59:16,603 INFO L290 TraceCheckUtils]: 70: Hoare triple {143711#false} assume !false; {143711#false} is VALID [2022-02-20 18:59:16,603 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:16,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:59:16,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485083042] [2022-02-20 18:59:16,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485083042] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:59:16,604 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:59:16,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:59:16,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806005768] [2022-02-20 18:59:16,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:59:16,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2022-02-20 18:59:16,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:59:16,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:16,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:59:16,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:59:16,646 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:59:16,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:59:16,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:59:16,647 INFO L87 Difference]: Start difference. First operand 7836 states and 12656 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)