./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-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 21f8745a4b7dc6c318e9cfa92c5330ecd148615dc4c561afd5b7113093125b70 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:38:11,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:38:11,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:38:12,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:38:12,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:38:12,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:38:12,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:38:12,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:38:12,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:38:12,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:38:12,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:38:12,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:38:12,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:38:12,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:38:12,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:38:12,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:38:12,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:38:12,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:38:12,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:38:12,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:38:12,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:38:12,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:38:12,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:38:12,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:38:12,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:38:12,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:38:12,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:38:12,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:38:12,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:38:12,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:38:12,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:38:12,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:38:12,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:38:12,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:38:12,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:38:12,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:38:12,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:38:12,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:38:12,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:38:12,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:38:12,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:38:12,055 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:38:12,072 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:38:12,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:38:12,072 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:38:12,072 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:38:12,073 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:38:12,073 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:38:12,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:38:12,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:38:12,074 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:38:12,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:38:12,074 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:38:12,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:38:12,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:38:12,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:38:12,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:38:12,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:38:12,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:38:12,075 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:38:12,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:38:12,075 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:38:12,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:38:12,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:38:12,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:38:12,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:38:12,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:38:12,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:38:12,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:38:12,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:38:12,077 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:38:12,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:38:12,077 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:38:12,078 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:38:12,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:38:12,078 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 -> 21f8745a4b7dc6c318e9cfa92c5330ecd148615dc4c561afd5b7113093125b70 [2022-02-20 18:38:12,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:38:12,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:38:12,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:38:12,305 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:38:12,305 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:38:12,306 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2022-02-20 18:38:12,358 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e0bf9c24/11e83bcf9c3b4a2cb3623a18df7a50c2/FLAGd70bed5fb [2022-02-20 18:38:12,719 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:38:12,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2022-02-20 18:38:12,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e0bf9c24/11e83bcf9c3b4a2cb3623a18df7a50c2/FLAGd70bed5fb [2022-02-20 18:38:13,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e0bf9c24/11e83bcf9c3b4a2cb3623a18df7a50c2 [2022-02-20 18:38:13,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:38:13,101 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:38:13,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:38:13,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:38:13,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:38:13,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:38:13" (1/1) ... [2022-02-20 18:38:13,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5af03a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:13, skipping insertion in model container [2022-02-20 18:38:13,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:38:13" (1/1) ... [2022-02-20 18:38:13,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:38:13,162 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:38:13,381 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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[9615,9628] [2022-02-20 18:38:13,396 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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11969,11982] [2022-02-20 18:38:13,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:38:13,444 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:38:13,496 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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[9615,9628] [2022-02-20 18:38:13,503 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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11969,11982] [2022-02-20 18:38:13,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:38:13,536 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:38:13,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:13 WrapperNode [2022-02-20 18:38:13,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:38:13,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:38:13,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:38:13,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:38:13,545 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:38:13" (1/1) ... [2022-02-20 18:38:13,559 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:38:13" (1/1) ... [2022-02-20 18:38:13,613 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 966 [2022-02-20 18:38:13,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:38:13,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:38:13,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:38:13,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:38:13,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:13" (1/1) ... [2022-02-20 18:38:13,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:13" (1/1) ... [2022-02-20 18:38:13,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:13" (1/1) ... [2022-02-20 18:38:13,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:13" (1/1) ... [2022-02-20 18:38:13,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:13" (1/1) ... [2022-02-20 18:38:13,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:13" (1/1) ... [2022-02-20 18:38:13,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:13" (1/1) ... [2022-02-20 18:38:13,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:38:13,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:38:13,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:38:13,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:38:13,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:13" (1/1) ... [2022-02-20 18:38:13,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:38:13,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:38:13,680 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:38:13,693 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:38:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:38:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:38:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:38:13,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:38:13,830 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:38:13,831 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:38:14,602 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:38:14,614 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:38:14,614 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:38:14,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:38:14 BoogieIcfgContainer [2022-02-20 18:38:14,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:38:14,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:38:14,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:38:14,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:38:14,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:38:13" (1/3) ... [2022-02-20 18:38:14,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9bcb30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:38:14, skipping insertion in model container [2022-02-20 18:38:14,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:13" (2/3) ... [2022-02-20 18:38:14,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9bcb30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:38:14, skipping insertion in model container [2022-02-20 18:38:14,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:38:14" (3/3) ... [2022-02-20 18:38:14,624 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2022-02-20 18:38:14,628 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:38:14,628 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 18:38:14,671 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:38:14,675 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:38:14,675 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 18:38:14,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 234 states have (on average 1.8034188034188035) internal successors, (422), 236 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have 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:38:14,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 18:38:14,697 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:14,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:38:14,698 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:14,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:14,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1900773932, now seen corresponding path program 1 times [2022-02-20 18:38:14,707 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:14,707 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652439138] [2022-02-20 18:38:14,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:14,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:15,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#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(55, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~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_1131~0 := 0;~__return_1259~0 := 0;~__return_1679~0 := 0;~__return_1378~0 := 0;~__tmp_1379_0~0 := 0;~__return_1487~0 := 0;~__return_1392~0 := 0; {240#true} is VALID [2022-02-20 18:38:15,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#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_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#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; {242#(= (+ (* (- 1) ~ep12~0) |ULTIMATE.start_main_~init__r121~0#1|) 0)} is VALID [2022-02-20 18:38:15,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {242#(= (+ (* (- 1) ~ep12~0) |ULTIMATE.start_main_~init__r121~0#1|) 0)} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,115 INFO L290 TraceCheckUtils]: 3: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,115 INFO L290 TraceCheckUtils]: 4: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 != ~id2~0; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 != ~id3~0; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id2~0 != ~id3~0; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 >= 0; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id2~0 >= 0; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id3~0 >= 0; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r1~0; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r2~0; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r3~0; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r122~0#1 % 256); {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r132~0#1 % 256); {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r212~0#1 % 256); {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r232~0#1 % 256); {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r312~0#1 % 256); {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r322~0#1 % 256); {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max1~0 == ~id1~0; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max2~0 == ~id2~0; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max3~0 == ~id3~0; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,131 INFO L290 TraceCheckUtils]: 32: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st1~0; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st2~0; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,132 INFO L290 TraceCheckUtils]: 34: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st3~0; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,132 INFO L290 TraceCheckUtils]: 35: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl1~0; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl2~0; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl3~0; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode1~0 % 256; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode2~0 % 256; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,135 INFO L290 TraceCheckUtils]: 40: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1131~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1131~0; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,135 INFO L290 TraceCheckUtils]: 41: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~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; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,136 INFO L290 TraceCheckUtils]: 42: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume main_~main__i2~0#1 < 6; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,136 INFO L290 TraceCheckUtils]: 43: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !!(0 == ~mode1~0 % 256); {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,137 INFO L290 TraceCheckUtils]: 44: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~r1~0 < 2; {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:15,138 INFO L290 TraceCheckUtils]: 45: Hoare triple {243#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !!(0 == ~ep12~0 % 256); {241#false} is VALID [2022-02-20 18:38:15,138 INFO L290 TraceCheckUtils]: 46: Hoare triple {241#false} assume !!(0 == ~ep13~0 % 256); {241#false} is VALID [2022-02-20 18:38:15,138 INFO L290 TraceCheckUtils]: 47: Hoare triple {241#false} ~mode1~0 := 1; {241#false} is VALID [2022-02-20 18:38:15,138 INFO L290 TraceCheckUtils]: 48: Hoare triple {241#false} assume !!(0 == ~mode2~0 % 256); {241#false} is VALID [2022-02-20 18:38:15,141 INFO L290 TraceCheckUtils]: 49: Hoare triple {241#false} assume ~r2~0 < 2; {241#false} is VALID [2022-02-20 18:38:15,141 INFO L290 TraceCheckUtils]: 50: Hoare triple {241#false} assume !!(0 == ~ep21~0 % 256); {241#false} is VALID [2022-02-20 18:38:15,141 INFO L290 TraceCheckUtils]: 51: Hoare triple {241#false} assume !!(0 == ~ep23~0 % 256); {241#false} is VALID [2022-02-20 18:38:15,142 INFO L290 TraceCheckUtils]: 52: Hoare triple {241#false} ~mode2~0 := 1; {241#false} is VALID [2022-02-20 18:38:15,142 INFO L290 TraceCheckUtils]: 53: Hoare triple {241#false} assume !!(0 == ~mode3~0 % 256); {241#false} is VALID [2022-02-20 18:38:15,142 INFO L290 TraceCheckUtils]: 54: Hoare triple {241#false} assume ~r3~0 < 2; {241#false} is VALID [2022-02-20 18:38:15,144 INFO L290 TraceCheckUtils]: 55: Hoare triple {241#false} assume !!(0 == ~ep31~0 % 256); {241#false} is VALID [2022-02-20 18:38:15,144 INFO L290 TraceCheckUtils]: 56: Hoare triple {241#false} assume !!(0 == ~ep32~0 % 256); {241#false} is VALID [2022-02-20 18:38:15,145 INFO L290 TraceCheckUtils]: 57: Hoare triple {241#false} ~mode3~0 := 1;~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; {241#false} is VALID [2022-02-20 18:38:15,145 INFO L290 TraceCheckUtils]: 58: Hoare triple {241#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {241#false} is VALID [2022-02-20 18:38:15,145 INFO L290 TraceCheckUtils]: 59: Hoare triple {241#false} assume ~st1~0 + ~nl1~0 <= 1; {241#false} is VALID [2022-02-20 18:38:15,146 INFO L290 TraceCheckUtils]: 60: Hoare triple {241#false} assume ~st2~0 + ~nl2~0 <= 1; {241#false} is VALID [2022-02-20 18:38:15,146 INFO L290 TraceCheckUtils]: 61: Hoare triple {241#false} assume ~st3~0 + ~nl3~0 <= 1; {241#false} is VALID [2022-02-20 18:38:15,146 INFO L290 TraceCheckUtils]: 62: Hoare triple {241#false} assume !(~r1~0 >= 2); {241#false} is VALID [2022-02-20 18:38:15,146 INFO L290 TraceCheckUtils]: 63: Hoare triple {241#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {241#false} is VALID [2022-02-20 18:38:15,147 INFO L290 TraceCheckUtils]: 64: Hoare triple {241#false} assume ~r1~0 < 2; {241#false} is VALID [2022-02-20 18:38:15,147 INFO L290 TraceCheckUtils]: 65: Hoare triple {241#false} assume !(~r1~0 >= 2); {241#false} is VALID [2022-02-20 18:38:15,147 INFO L290 TraceCheckUtils]: 66: Hoare triple {241#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {241#false} is VALID [2022-02-20 18:38:15,147 INFO L290 TraceCheckUtils]: 67: Hoare triple {241#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1259~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1259~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; {241#false} is VALID [2022-02-20 18:38:15,147 INFO L290 TraceCheckUtils]: 68: Hoare triple {241#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {241#false} is VALID [2022-02-20 18:38:15,148 INFO L290 TraceCheckUtils]: 69: Hoare triple {241#false} assume main_~main__i2~0#1 < 6; {241#false} is VALID [2022-02-20 18:38:15,148 INFO L290 TraceCheckUtils]: 70: Hoare triple {241#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {241#false} is VALID [2022-02-20 18:38:15,148 INFO L290 TraceCheckUtils]: 71: Hoare triple {241#false} assume !!(0 == ~ep21~0 % 256); {241#false} is VALID [2022-02-20 18:38:15,148 INFO L290 TraceCheckUtils]: 72: Hoare triple {241#false} assume !!(0 == ~ep31~0 % 256); {241#false} is VALID [2022-02-20 18:38:15,148 INFO L290 TraceCheckUtils]: 73: Hoare triple {241#false} assume 1 == ~r1~0; {241#false} is VALID [2022-02-20 18:38:15,149 INFO L290 TraceCheckUtils]: 74: Hoare triple {241#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0; {241#false} is VALID [2022-02-20 18:38:15,149 INFO L290 TraceCheckUtils]: 75: Hoare triple {241#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {241#false} is VALID [2022-02-20 18:38:15,150 INFO L290 TraceCheckUtils]: 76: Hoare triple {241#false} assume !!(0 == ~ep12~0 % 256); {241#false} is VALID [2022-02-20 18:38:15,150 INFO L290 TraceCheckUtils]: 77: Hoare triple {241#false} assume !!(0 == ~ep32~0 % 256); {241#false} is VALID [2022-02-20 18:38:15,152 INFO L290 TraceCheckUtils]: 78: Hoare triple {241#false} assume !(2 == ~r2~0);~mode2~0 := 0; {241#false} is VALID [2022-02-20 18:38:15,152 INFO L290 TraceCheckUtils]: 79: Hoare triple {241#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {241#false} is VALID [2022-02-20 18:38:15,152 INFO L290 TraceCheckUtils]: 80: Hoare triple {241#false} assume !!(0 == ~ep13~0 % 256); {241#false} is VALID [2022-02-20 18:38:15,152 INFO L290 TraceCheckUtils]: 81: Hoare triple {241#false} assume !!(0 == ~ep23~0 % 256); {241#false} is VALID [2022-02-20 18:38:15,153 INFO L290 TraceCheckUtils]: 82: Hoare triple {241#false} assume !(2 == ~r3~0);~mode3~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~1#1; {241#false} is VALID [2022-02-20 18:38:15,153 INFO L290 TraceCheckUtils]: 83: Hoare triple {241#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {241#false} is VALID [2022-02-20 18:38:15,153 INFO L290 TraceCheckUtils]: 84: Hoare triple {241#false} assume ~st1~0 + ~nl1~0 <= 1; {241#false} is VALID [2022-02-20 18:38:15,153 INFO L290 TraceCheckUtils]: 85: Hoare triple {241#false} assume ~st2~0 + ~nl2~0 <= 1; {241#false} is VALID [2022-02-20 18:38:15,154 INFO L290 TraceCheckUtils]: 86: Hoare triple {241#false} assume ~st3~0 + ~nl3~0 <= 1; {241#false} is VALID [2022-02-20 18:38:15,157 INFO L290 TraceCheckUtils]: 87: Hoare triple {241#false} assume !(~r1~0 >= 2); {241#false} is VALID [2022-02-20 18:38:15,157 INFO L290 TraceCheckUtils]: 88: Hoare triple {241#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1679~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1679~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {241#false} is VALID [2022-02-20 18:38:15,158 INFO L290 TraceCheckUtils]: 89: Hoare triple {241#false} assume 0 == main_~assert__arg~1#1 % 256; {241#false} is VALID [2022-02-20 18:38:15,158 INFO L290 TraceCheckUtils]: 90: Hoare triple {241#false} assume !false; {241#false} is VALID [2022-02-20 18:38:15,160 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:38:15,161 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:15,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652439138] [2022-02-20 18:38:15,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652439138] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:15,162 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:15,162 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:38:15,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253573911] [2022-02-20 18:38:15,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:15,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 18:38:15,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:15,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have 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:38:15,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:15,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:38:15,249 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:15,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:38:15,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:38:15,274 INFO L87 Difference]: Start difference. First operand has 237 states, 234 states have (on average 1.8034188034188035) internal successors, (422), 236 states have internal predecessors, (422), 0 states have call successors, (0), 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 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have 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:38:16,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:16,231 INFO L93 Difference]: Finished difference Result 685 states and 1223 transitions. [2022-02-20 18:38:16,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:38:16,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 18:38:16,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have 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:38:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1223 transitions. [2022-02-20 18:38:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have 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:38:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1223 transitions. [2022-02-20 18:38:16,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1223 transitions. [2022-02-20 18:38:17,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1223 edges. 1223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:17,148 INFO L225 Difference]: With dead ends: 685 [2022-02-20 18:38:17,149 INFO L226 Difference]: Without dead ends: 451 [2022-02-20 18:38:17,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:38:17,157 INFO L933 BasicCegarLoop]: 688 mSDtfsCounter, 874 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:17,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [874 Valid, 1070 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-02-20 18:38:17,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 431. [2022-02-20 18:38:17,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:17,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 451 states. Second operand has 431 states, 429 states have (on average 1.4662004662004662) internal successors, (629), 430 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have 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:38:17,265 INFO L74 IsIncluded]: Start isIncluded. First operand 451 states. Second operand has 431 states, 429 states have (on average 1.4662004662004662) internal successors, (629), 430 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have 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:38:17,266 INFO L87 Difference]: Start difference. First operand 451 states. Second operand has 431 states, 429 states have (on average 1.4662004662004662) internal successors, (629), 430 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have 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:38:17,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:17,281 INFO L93 Difference]: Finished difference Result 451 states and 653 transitions. [2022-02-20 18:38:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 653 transitions. [2022-02-20 18:38:17,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:17,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:17,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 431 states, 429 states have (on average 1.4662004662004662) internal successors, (629), 430 states have internal predecessors, (629), 0 states have call successors, (0), 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 451 states. [2022-02-20 18:38:17,288 INFO L87 Difference]: Start difference. First operand has 431 states, 429 states have (on average 1.4662004662004662) internal successors, (629), 430 states have internal predecessors, (629), 0 states have call successors, (0), 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 451 states. [2022-02-20 18:38:17,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:17,304 INFO L93 Difference]: Finished difference Result 451 states and 653 transitions. [2022-02-20 18:38:17,304 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 653 transitions. [2022-02-20 18:38:17,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:17,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:17,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:17,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:17,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 429 states have (on average 1.4662004662004662) internal successors, (629), 430 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have 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:38:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 629 transitions. [2022-02-20 18:38:17,322 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 629 transitions. Word has length 91 [2022-02-20 18:38:17,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:17,323 INFO L470 AbstractCegarLoop]: Abstraction has 431 states and 629 transitions. [2022-02-20 18:38:17,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have 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:38:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 629 transitions. [2022-02-20 18:38:17,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 18:38:17,326 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:17,326 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, 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:38:17,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:38:17,326 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:17,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:17,327 INFO L85 PathProgramCache]: Analyzing trace with hash 510528216, now seen corresponding path program 1 times [2022-02-20 18:38:17,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:17,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404096762] [2022-02-20 18:38:17,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:17,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:17,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {2601#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(55, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~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_1131~0 := 0;~__return_1259~0 := 0;~__return_1679~0 := 0;~__return_1378~0 := 0;~__tmp_1379_0~0 := 0;~__return_1487~0 := 0;~__return_1392~0 := 0; {2601#true} is VALID [2022-02-20 18:38:17,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {2601#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#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_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#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; {2601#true} is VALID [2022-02-20 18:38:17,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {2601#true} assume !!(0 == main_~init__r121~0#1 % 256); {2601#true} is VALID [2022-02-20 18:38:17,418 INFO L290 TraceCheckUtils]: 3: Hoare triple {2601#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {2603#(= (+ (* (- 256) (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:38:17,418 INFO L290 TraceCheckUtils]: 4: Hoare triple {2603#(= (+ (* (- 256) (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) 0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {2603#(= (+ (* (- 256) (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:38:17,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {2603#(= (+ (* (- 256) (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) 0)} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {2602#false} is VALID [2022-02-20 18:38:17,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {2602#false} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {2602#false} is VALID [2022-02-20 18:38:17,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {2602#false} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {2602#false} is VALID [2022-02-20 18:38:17,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {2602#false} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {2602#false} is VALID [2022-02-20 18:38:17,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {2602#false} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {2602#false} is VALID [2022-02-20 18:38:17,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {2602#false} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {2602#false} is VALID [2022-02-20 18:38:17,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {2602#false} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {2602#false} is VALID [2022-02-20 18:38:17,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {2602#false} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {2602#false} is VALID [2022-02-20 18:38:17,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {2602#false} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {2602#false} is VALID [2022-02-20 18:38:17,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {2602#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {2602#false} is VALID [2022-02-20 18:38:17,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {2602#false} assume ~id1~0 != ~id2~0; {2602#false} is VALID [2022-02-20 18:38:17,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {2602#false} assume ~id1~0 != ~id3~0; {2602#false} is VALID [2022-02-20 18:38:17,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {2602#false} assume ~id2~0 != ~id3~0; {2602#false} is VALID [2022-02-20 18:38:17,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {2602#false} assume ~id1~0 >= 0; {2602#false} is VALID [2022-02-20 18:38:17,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {2602#false} assume ~id2~0 >= 0; {2602#false} is VALID [2022-02-20 18:38:17,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {2602#false} assume ~id3~0 >= 0; {2602#false} is VALID [2022-02-20 18:38:17,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {2602#false} assume 0 == ~r1~0; {2602#false} is VALID [2022-02-20 18:38:17,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {2602#false} assume 0 == ~r2~0; {2602#false} is VALID [2022-02-20 18:38:17,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {2602#false} assume 0 == ~r3~0; {2602#false} is VALID [2022-02-20 18:38:17,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {2602#false} assume !(0 == main_~init__r122~0#1 % 256); {2602#false} is VALID [2022-02-20 18:38:17,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {2602#false} assume !(0 == main_~init__r132~0#1 % 256); {2602#false} is VALID [2022-02-20 18:38:17,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {2602#false} assume !(0 == main_~init__r212~0#1 % 256); {2602#false} is VALID [2022-02-20 18:38:17,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {2602#false} assume !(0 == main_~init__r232~0#1 % 256); {2602#false} is VALID [2022-02-20 18:38:17,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {2602#false} assume !(0 == main_~init__r312~0#1 % 256); {2602#false} is VALID [2022-02-20 18:38:17,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {2602#false} assume !(0 == main_~init__r322~0#1 % 256); {2602#false} is VALID [2022-02-20 18:38:17,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {2602#false} assume ~max1~0 == ~id1~0; {2602#false} is VALID [2022-02-20 18:38:17,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {2602#false} assume ~max2~0 == ~id2~0; {2602#false} is VALID [2022-02-20 18:38:17,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {2602#false} assume ~max3~0 == ~id3~0; {2602#false} is VALID [2022-02-20 18:38:17,422 INFO L290 TraceCheckUtils]: 33: Hoare triple {2602#false} assume 0 == ~st1~0; {2602#false} is VALID [2022-02-20 18:38:17,422 INFO L290 TraceCheckUtils]: 34: Hoare triple {2602#false} assume 0 == ~st2~0; {2602#false} is VALID [2022-02-20 18:38:17,422 INFO L290 TraceCheckUtils]: 35: Hoare triple {2602#false} assume 0 == ~st3~0; {2602#false} is VALID [2022-02-20 18:38:17,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {2602#false} assume 0 == ~nl1~0; {2602#false} is VALID [2022-02-20 18:38:17,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {2602#false} assume 0 == ~nl2~0; {2602#false} is VALID [2022-02-20 18:38:17,422 INFO L290 TraceCheckUtils]: 38: Hoare triple {2602#false} assume 0 == ~nl3~0; {2602#false} is VALID [2022-02-20 18:38:17,422 INFO L290 TraceCheckUtils]: 39: Hoare triple {2602#false} assume 0 == ~mode1~0 % 256; {2602#false} is VALID [2022-02-20 18:38:17,422 INFO L290 TraceCheckUtils]: 40: Hoare triple {2602#false} assume 0 == ~mode2~0 % 256; {2602#false} is VALID [2022-02-20 18:38:17,422 INFO L290 TraceCheckUtils]: 41: Hoare triple {2602#false} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1131~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1131~0; {2602#false} is VALID [2022-02-20 18:38:17,422 INFO L290 TraceCheckUtils]: 42: Hoare triple {2602#false} 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; {2602#false} is VALID [2022-02-20 18:38:17,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {2602#false} assume main_~main__i2~0#1 < 6; {2602#false} is VALID [2022-02-20 18:38:17,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {2602#false} assume !!(0 == ~mode1~0 % 256); {2602#false} is VALID [2022-02-20 18:38:17,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {2602#false} assume ~r1~0 < 2; {2602#false} is VALID [2022-02-20 18:38:17,423 INFO L290 TraceCheckUtils]: 46: Hoare triple {2602#false} assume !!(0 == ~ep12~0 % 256); {2602#false} is VALID [2022-02-20 18:38:17,423 INFO L290 TraceCheckUtils]: 47: Hoare triple {2602#false} assume !!(0 == ~ep13~0 % 256); {2602#false} is VALID [2022-02-20 18:38:17,423 INFO L290 TraceCheckUtils]: 48: Hoare triple {2602#false} ~mode1~0 := 1; {2602#false} is VALID [2022-02-20 18:38:17,423 INFO L290 TraceCheckUtils]: 49: Hoare triple {2602#false} assume !!(0 == ~mode2~0 % 256); {2602#false} is VALID [2022-02-20 18:38:17,423 INFO L290 TraceCheckUtils]: 50: Hoare triple {2602#false} assume ~r2~0 < 2; {2602#false} is VALID [2022-02-20 18:38:17,423 INFO L290 TraceCheckUtils]: 51: Hoare triple {2602#false} assume !!(0 == ~ep21~0 % 256); {2602#false} is VALID [2022-02-20 18:38:17,423 INFO L290 TraceCheckUtils]: 52: Hoare triple {2602#false} assume !!(0 == ~ep23~0 % 256); {2602#false} is VALID [2022-02-20 18:38:17,424 INFO L290 TraceCheckUtils]: 53: Hoare triple {2602#false} ~mode2~0 := 1; {2602#false} is VALID [2022-02-20 18:38:17,424 INFO L290 TraceCheckUtils]: 54: Hoare triple {2602#false} assume !!(0 == ~mode3~0 % 256); {2602#false} is VALID [2022-02-20 18:38:17,424 INFO L290 TraceCheckUtils]: 55: Hoare triple {2602#false} assume ~r3~0 < 2; {2602#false} is VALID [2022-02-20 18:38:17,424 INFO L290 TraceCheckUtils]: 56: Hoare triple {2602#false} assume !!(0 == ~ep31~0 % 256); {2602#false} is VALID [2022-02-20 18:38:17,424 INFO L290 TraceCheckUtils]: 57: Hoare triple {2602#false} assume !!(0 == ~ep32~0 % 256); {2602#false} is VALID [2022-02-20 18:38:17,424 INFO L290 TraceCheckUtils]: 58: Hoare triple {2602#false} ~mode3~0 := 1;~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; {2602#false} is VALID [2022-02-20 18:38:17,424 INFO L290 TraceCheckUtils]: 59: Hoare triple {2602#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2602#false} is VALID [2022-02-20 18:38:17,424 INFO L290 TraceCheckUtils]: 60: Hoare triple {2602#false} assume ~st1~0 + ~nl1~0 <= 1; {2602#false} is VALID [2022-02-20 18:38:17,424 INFO L290 TraceCheckUtils]: 61: Hoare triple {2602#false} assume ~st2~0 + ~nl2~0 <= 1; {2602#false} is VALID [2022-02-20 18:38:17,424 INFO L290 TraceCheckUtils]: 62: Hoare triple {2602#false} assume ~st3~0 + ~nl3~0 <= 1; {2602#false} is VALID [2022-02-20 18:38:17,424 INFO L290 TraceCheckUtils]: 63: Hoare triple {2602#false} assume !(~r1~0 >= 2); {2602#false} is VALID [2022-02-20 18:38:17,425 INFO L290 TraceCheckUtils]: 64: Hoare triple {2602#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2602#false} is VALID [2022-02-20 18:38:17,425 INFO L290 TraceCheckUtils]: 65: Hoare triple {2602#false} assume ~r1~0 < 2; {2602#false} is VALID [2022-02-20 18:38:17,425 INFO L290 TraceCheckUtils]: 66: Hoare triple {2602#false} assume !(~r1~0 >= 2); {2602#false} is VALID [2022-02-20 18:38:17,425 INFO L290 TraceCheckUtils]: 67: Hoare triple {2602#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {2602#false} is VALID [2022-02-20 18:38:17,425 INFO L290 TraceCheckUtils]: 68: Hoare triple {2602#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1259~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1259~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; {2602#false} is VALID [2022-02-20 18:38:17,425 INFO L290 TraceCheckUtils]: 69: Hoare triple {2602#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {2602#false} is VALID [2022-02-20 18:38:17,425 INFO L290 TraceCheckUtils]: 70: Hoare triple {2602#false} assume main_~main__i2~0#1 < 6; {2602#false} is VALID [2022-02-20 18:38:17,425 INFO L290 TraceCheckUtils]: 71: Hoare triple {2602#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {2602#false} is VALID [2022-02-20 18:38:17,425 INFO L290 TraceCheckUtils]: 72: Hoare triple {2602#false} assume !!(0 == ~ep21~0 % 256); {2602#false} is VALID [2022-02-20 18:38:17,425 INFO L290 TraceCheckUtils]: 73: Hoare triple {2602#false} assume !!(0 == ~ep31~0 % 256); {2602#false} is VALID [2022-02-20 18:38:17,426 INFO L290 TraceCheckUtils]: 74: Hoare triple {2602#false} assume 1 == ~r1~0; {2602#false} is VALID [2022-02-20 18:38:17,426 INFO L290 TraceCheckUtils]: 75: Hoare triple {2602#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0; {2602#false} is VALID [2022-02-20 18:38:17,426 INFO L290 TraceCheckUtils]: 76: Hoare triple {2602#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {2602#false} is VALID [2022-02-20 18:38:17,426 INFO L290 TraceCheckUtils]: 77: Hoare triple {2602#false} assume !!(0 == ~ep12~0 % 256); {2602#false} is VALID [2022-02-20 18:38:17,426 INFO L290 TraceCheckUtils]: 78: Hoare triple {2602#false} assume !!(0 == ~ep32~0 % 256); {2602#false} is VALID [2022-02-20 18:38:17,426 INFO L290 TraceCheckUtils]: 79: Hoare triple {2602#false} assume !(2 == ~r2~0);~mode2~0 := 0; {2602#false} is VALID [2022-02-20 18:38:17,426 INFO L290 TraceCheckUtils]: 80: Hoare triple {2602#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {2602#false} is VALID [2022-02-20 18:38:17,426 INFO L290 TraceCheckUtils]: 81: Hoare triple {2602#false} assume !!(0 == ~ep13~0 % 256); {2602#false} is VALID [2022-02-20 18:38:17,426 INFO L290 TraceCheckUtils]: 82: Hoare triple {2602#false} assume !!(0 == ~ep23~0 % 256); {2602#false} is VALID [2022-02-20 18:38:17,426 INFO L290 TraceCheckUtils]: 83: Hoare triple {2602#false} assume !(2 == ~r3~0);~mode3~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~1#1; {2602#false} is VALID [2022-02-20 18:38:17,427 INFO L290 TraceCheckUtils]: 84: Hoare triple {2602#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2602#false} is VALID [2022-02-20 18:38:17,427 INFO L290 TraceCheckUtils]: 85: Hoare triple {2602#false} assume ~st1~0 + ~nl1~0 <= 1; {2602#false} is VALID [2022-02-20 18:38:17,427 INFO L290 TraceCheckUtils]: 86: Hoare triple {2602#false} assume ~st2~0 + ~nl2~0 <= 1; {2602#false} is VALID [2022-02-20 18:38:17,427 INFO L290 TraceCheckUtils]: 87: Hoare triple {2602#false} assume ~st3~0 + ~nl3~0 <= 1; {2602#false} is VALID [2022-02-20 18:38:17,427 INFO L290 TraceCheckUtils]: 88: Hoare triple {2602#false} assume !(~r1~0 >= 2); {2602#false} is VALID [2022-02-20 18:38:17,427 INFO L290 TraceCheckUtils]: 89: Hoare triple {2602#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1679~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1679~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {2602#false} is VALID [2022-02-20 18:38:17,427 INFO L290 TraceCheckUtils]: 90: Hoare triple {2602#false} assume 0 == main_~assert__arg~1#1 % 256; {2602#false} is VALID [2022-02-20 18:38:17,427 INFO L290 TraceCheckUtils]: 91: Hoare triple {2602#false} assume !false; {2602#false} is VALID [2022-02-20 18:38:17,428 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:38:17,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:17,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404096762] [2022-02-20 18:38:17,428 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404096762] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:17,428 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:17,428 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:17,428 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872864121] [2022-02-20 18:38:17,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:17,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 18:38:17,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:17,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:38:17,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:17,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:17,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:17,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:17,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:17,478 INFO L87 Difference]: Start difference. First operand 431 states and 629 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:38:18,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:18,110 INFO L93 Difference]: Finished difference Result 1255 states and 1825 transitions. [2022-02-20 18:38:18,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:18,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 18:38:18,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:38:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1005 transitions. [2022-02-20 18:38:18,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:38:18,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1005 transitions. [2022-02-20 18:38:18,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1005 transitions. [2022-02-20 18:38:18,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1005 edges. 1005 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:18,782 INFO L225 Difference]: With dead ends: 1255 [2022-02-20 18:38:18,782 INFO L226 Difference]: Without dead ends: 852 [2022-02-20 18:38:18,783 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:38:18,784 INFO L933 BasicCegarLoop]: 674 mSDtfsCounter, 333 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:18,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 1009 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2022-02-20 18:38:18,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 433. [2022-02-20 18:38:18,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:18,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 852 states. Second operand has 433 states, 431 states have (on average 1.4640371229698377) internal successors, (631), 432 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have 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:38:18,835 INFO L74 IsIncluded]: Start isIncluded. First operand 852 states. Second operand has 433 states, 431 states have (on average 1.4640371229698377) internal successors, (631), 432 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have 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:38:18,836 INFO L87 Difference]: Start difference. First operand 852 states. Second operand has 433 states, 431 states have (on average 1.4640371229698377) internal successors, (631), 432 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have 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:38:18,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:18,871 INFO L93 Difference]: Finished difference Result 852 states and 1241 transitions. [2022-02-20 18:38:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1241 transitions. [2022-02-20 18:38:18,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:18,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:18,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 433 states, 431 states have (on average 1.4640371229698377) internal successors, (631), 432 states have internal predecessors, (631), 0 states have call successors, (0), 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 852 states. [2022-02-20 18:38:18,874 INFO L87 Difference]: Start difference. First operand has 433 states, 431 states have (on average 1.4640371229698377) internal successors, (631), 432 states have internal predecessors, (631), 0 states have call successors, (0), 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 852 states. [2022-02-20 18:38:18,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:18,904 INFO L93 Difference]: Finished difference Result 852 states and 1241 transitions. [2022-02-20 18:38:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1241 transitions. [2022-02-20 18:38:18,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:18,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:18,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:18,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:18,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 431 states have (on average 1.4640371229698377) internal successors, (631), 432 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have 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:38:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 631 transitions. [2022-02-20 18:38:18,916 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 631 transitions. Word has length 92 [2022-02-20 18:38:18,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:18,916 INFO L470 AbstractCegarLoop]: Abstraction has 433 states and 631 transitions. [2022-02-20 18:38:18,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:38:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 631 transitions. [2022-02-20 18:38:18,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-20 18:38:18,917 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:18,917 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, 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:38:18,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:38:18,917 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:18,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:18,918 INFO L85 PathProgramCache]: Analyzing trace with hash 776423708, now seen corresponding path program 1 times [2022-02-20 18:38:18,918 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:18,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701889898] [2022-02-20 18:38:18,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:18,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:19,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {6512#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(55, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~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_1131~0 := 0;~__return_1259~0 := 0;~__return_1679~0 := 0;~__return_1378~0 := 0;~__tmp_1379_0~0 := 0;~__return_1487~0 := 0;~__return_1392~0 := 0; {6512#true} is VALID [2022-02-20 18:38:19,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {6512#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#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_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#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; {6512#true} is VALID [2022-02-20 18:38:19,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {6512#true} assume !!(0 == main_~init__r121~0#1 % 256); {6512#true} is VALID [2022-02-20 18:38:19,029 INFO L290 TraceCheckUtils]: 3: Hoare triple {6512#true} assume !(0 == main_~init__r131~0#1 % 256); {6512#true} is VALID [2022-02-20 18:38:19,030 INFO L290 TraceCheckUtils]: 4: Hoare triple {6512#true} assume !(0 == ~ep32~0 % 256);main_~init__tmp~0#1 := 1; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id1~0 != ~id2~0; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id1~0 != ~id3~0; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id2~0 != ~id3~0; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id1~0 >= 0; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id2~0 >= 0; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~id3~0 >= 0; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~r1~0; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~r2~0; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,038 INFO L290 TraceCheckUtils]: 24: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~r3~0; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r122~0#1 % 256); {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r132~0#1 % 256); {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,039 INFO L290 TraceCheckUtils]: 27: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r212~0#1 % 256); {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,039 INFO L290 TraceCheckUtils]: 28: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r232~0#1 % 256); {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,040 INFO L290 TraceCheckUtils]: 29: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r312~0#1 % 256); {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,040 INFO L290 TraceCheckUtils]: 30: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !(0 == main_~init__r322~0#1 % 256); {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~max1~0 == ~id1~0; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,041 INFO L290 TraceCheckUtils]: 32: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~max2~0 == ~id2~0; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,041 INFO L290 TraceCheckUtils]: 33: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~max3~0 == ~id3~0; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,041 INFO L290 TraceCheckUtils]: 34: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~st1~0; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,042 INFO L290 TraceCheckUtils]: 35: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~st2~0; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,042 INFO L290 TraceCheckUtils]: 36: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~st3~0; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,043 INFO L290 TraceCheckUtils]: 37: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~nl1~0; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,043 INFO L290 TraceCheckUtils]: 38: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~nl2~0; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,043 INFO L290 TraceCheckUtils]: 39: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~nl3~0; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,044 INFO L290 TraceCheckUtils]: 40: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~mode1~0 % 256; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,044 INFO L290 TraceCheckUtils]: 41: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~mode2~0 % 256; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1131~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1131~0; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,045 INFO L290 TraceCheckUtils]: 43: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 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; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,045 INFO L290 TraceCheckUtils]: 44: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume main_~main__i2~0#1 < 6; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~mode1~0 % 256); {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,046 INFO L290 TraceCheckUtils]: 46: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~r1~0 < 2; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,047 INFO L290 TraceCheckUtils]: 47: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep12~0 % 256); {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,047 INFO L290 TraceCheckUtils]: 48: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep13~0 % 256); {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,047 INFO L290 TraceCheckUtils]: 49: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} ~mode1~0 := 1; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,048 INFO L290 TraceCheckUtils]: 50: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~mode2~0 % 256); {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,048 INFO L290 TraceCheckUtils]: 51: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~r2~0 < 2; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,049 INFO L290 TraceCheckUtils]: 52: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep21~0 % 256); {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,049 INFO L290 TraceCheckUtils]: 53: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep23~0 % 256); {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,049 INFO L290 TraceCheckUtils]: 54: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} ~mode2~0 := 1; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,050 INFO L290 TraceCheckUtils]: 55: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~mode3~0 % 256); {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,050 INFO L290 TraceCheckUtils]: 56: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume ~r3~0 < 2; {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,051 INFO L290 TraceCheckUtils]: 57: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep31~0 % 256); {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} is VALID [2022-02-20 18:38:19,051 INFO L290 TraceCheckUtils]: 58: Hoare triple {6514#(not (= (+ ~ep32~0 (* (- 256) (div ~ep32~0 256))) 0))} assume !!(0 == ~ep32~0 % 256); {6513#false} is VALID [2022-02-20 18:38:19,051 INFO L290 TraceCheckUtils]: 59: Hoare triple {6513#false} ~mode3~0 := 1;~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; {6513#false} is VALID [2022-02-20 18:38:19,052 INFO L290 TraceCheckUtils]: 60: Hoare triple {6513#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {6513#false} is VALID [2022-02-20 18:38:19,052 INFO L290 TraceCheckUtils]: 61: Hoare triple {6513#false} assume ~st1~0 + ~nl1~0 <= 1; {6513#false} is VALID [2022-02-20 18:38:19,052 INFO L290 TraceCheckUtils]: 62: Hoare triple {6513#false} assume ~st2~0 + ~nl2~0 <= 1; {6513#false} is VALID [2022-02-20 18:38:19,052 INFO L290 TraceCheckUtils]: 63: Hoare triple {6513#false} assume ~st3~0 + ~nl3~0 <= 1; {6513#false} is VALID [2022-02-20 18:38:19,052 INFO L290 TraceCheckUtils]: 64: Hoare triple {6513#false} assume !(~r1~0 >= 2); {6513#false} is VALID [2022-02-20 18:38:19,052 INFO L290 TraceCheckUtils]: 65: Hoare triple {6513#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {6513#false} is VALID [2022-02-20 18:38:19,053 INFO L290 TraceCheckUtils]: 66: Hoare triple {6513#false} assume ~r1~0 < 2; {6513#false} is VALID [2022-02-20 18:38:19,053 INFO L290 TraceCheckUtils]: 67: Hoare triple {6513#false} assume !(~r1~0 >= 2); {6513#false} is VALID [2022-02-20 18:38:19,053 INFO L290 TraceCheckUtils]: 68: Hoare triple {6513#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {6513#false} is VALID [2022-02-20 18:38:19,053 INFO L290 TraceCheckUtils]: 69: Hoare triple {6513#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1259~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1259~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; {6513#false} is VALID [2022-02-20 18:38:19,053 INFO L290 TraceCheckUtils]: 70: Hoare triple {6513#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {6513#false} is VALID [2022-02-20 18:38:19,053 INFO L290 TraceCheckUtils]: 71: Hoare triple {6513#false} assume main_~main__i2~0#1 < 6; {6513#false} is VALID [2022-02-20 18:38:19,053 INFO L290 TraceCheckUtils]: 72: Hoare triple {6513#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {6513#false} is VALID [2022-02-20 18:38:19,054 INFO L290 TraceCheckUtils]: 73: Hoare triple {6513#false} assume !!(0 == ~ep21~0 % 256); {6513#false} is VALID [2022-02-20 18:38:19,054 INFO L290 TraceCheckUtils]: 74: Hoare triple {6513#false} assume !!(0 == ~ep31~0 % 256); {6513#false} is VALID [2022-02-20 18:38:19,054 INFO L290 TraceCheckUtils]: 75: Hoare triple {6513#false} assume 1 == ~r1~0; {6513#false} is VALID [2022-02-20 18:38:19,054 INFO L290 TraceCheckUtils]: 76: Hoare triple {6513#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0; {6513#false} is VALID [2022-02-20 18:38:19,054 INFO L290 TraceCheckUtils]: 77: Hoare triple {6513#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {6513#false} is VALID [2022-02-20 18:38:19,054 INFO L290 TraceCheckUtils]: 78: Hoare triple {6513#false} assume !!(0 == ~ep12~0 % 256); {6513#false} is VALID [2022-02-20 18:38:19,055 INFO L290 TraceCheckUtils]: 79: Hoare triple {6513#false} assume !!(0 == ~ep32~0 % 256); {6513#false} is VALID [2022-02-20 18:38:19,055 INFO L290 TraceCheckUtils]: 80: Hoare triple {6513#false} assume !(2 == ~r2~0);~mode2~0 := 0; {6513#false} is VALID [2022-02-20 18:38:19,055 INFO L290 TraceCheckUtils]: 81: Hoare triple {6513#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {6513#false} is VALID [2022-02-20 18:38:19,055 INFO L290 TraceCheckUtils]: 82: Hoare triple {6513#false} assume !!(0 == ~ep13~0 % 256); {6513#false} is VALID [2022-02-20 18:38:19,055 INFO L290 TraceCheckUtils]: 83: Hoare triple {6513#false} assume !!(0 == ~ep23~0 % 256); {6513#false} is VALID [2022-02-20 18:38:19,055 INFO L290 TraceCheckUtils]: 84: Hoare triple {6513#false} assume !(2 == ~r3~0);~mode3~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~1#1; {6513#false} is VALID [2022-02-20 18:38:19,055 INFO L290 TraceCheckUtils]: 85: Hoare triple {6513#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {6513#false} is VALID [2022-02-20 18:38:19,056 INFO L290 TraceCheckUtils]: 86: Hoare triple {6513#false} assume ~st1~0 + ~nl1~0 <= 1; {6513#false} is VALID [2022-02-20 18:38:19,056 INFO L290 TraceCheckUtils]: 87: Hoare triple {6513#false} assume ~st2~0 + ~nl2~0 <= 1; {6513#false} is VALID [2022-02-20 18:38:19,056 INFO L290 TraceCheckUtils]: 88: Hoare triple {6513#false} assume ~st3~0 + ~nl3~0 <= 1; {6513#false} is VALID [2022-02-20 18:38:19,056 INFO L290 TraceCheckUtils]: 89: Hoare triple {6513#false} assume !(~r1~0 >= 2); {6513#false} is VALID [2022-02-20 18:38:19,056 INFO L290 TraceCheckUtils]: 90: Hoare triple {6513#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1679~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1679~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {6513#false} is VALID [2022-02-20 18:38:19,057 INFO L290 TraceCheckUtils]: 91: Hoare triple {6513#false} assume 0 == main_~assert__arg~1#1 % 256; {6513#false} is VALID [2022-02-20 18:38:19,057 INFO L290 TraceCheckUtils]: 92: Hoare triple {6513#false} assume !false; {6513#false} is VALID [2022-02-20 18:38:19,057 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:38:19,057 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:19,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701889898] [2022-02-20 18:38:19,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701889898] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:19,058 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:19,058 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:19,058 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462803978] [2022-02-20 18:38:19,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:19,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-02-20 18:38:19,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:19,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:38:19,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:19,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:19,129 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:19,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:19,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:19,129 INFO L87 Difference]: Start difference. First operand 433 states and 631 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:38:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:19,697 INFO L93 Difference]: Finished difference Result 1090 states and 1604 transitions. [2022-02-20 18:38:19,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:19,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-02-20 18:38:19,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:38:19,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 877 transitions. [2022-02-20 18:38:19,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:38:19,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 877 transitions. [2022-02-20 18:38:19,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 877 transitions. [2022-02-20 18:38:20,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 877 edges. 877 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:20,255 INFO L225 Difference]: With dead ends: 1090 [2022-02-20 18:38:20,255 INFO L226 Difference]: Without dead ends: 835 [2022-02-20 18:38:20,259 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:38:20,261 INFO L933 BasicCegarLoop]: 611 mSDtfsCounter, 274 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:20,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 923 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:20,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-02-20 18:38:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 817. [2022-02-20 18:38:20,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:20,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 835 states. Second operand has 817 states, 815 states have (on average 1.4539877300613497) internal successors, (1185), 816 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have 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:38:20,360 INFO L74 IsIncluded]: Start isIncluded. First operand 835 states. Second operand has 817 states, 815 states have (on average 1.4539877300613497) internal successors, (1185), 816 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have 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:38:20,361 INFO L87 Difference]: Start difference. First operand 835 states. Second operand has 817 states, 815 states have (on average 1.4539877300613497) internal successors, (1185), 816 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have 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:38:20,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:20,388 INFO L93 Difference]: Finished difference Result 835 states and 1205 transitions. [2022-02-20 18:38:20,388 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1205 transitions. [2022-02-20 18:38:20,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:20,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:20,391 INFO L74 IsIncluded]: Start isIncluded. First operand has 817 states, 815 states have (on average 1.4539877300613497) internal successors, (1185), 816 states have internal predecessors, (1185), 0 states have call successors, (0), 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 835 states. [2022-02-20 18:38:20,392 INFO L87 Difference]: Start difference. First operand has 817 states, 815 states have (on average 1.4539877300613497) internal successors, (1185), 816 states have internal predecessors, (1185), 0 states have call successors, (0), 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 835 states. [2022-02-20 18:38:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:20,423 INFO L93 Difference]: Finished difference Result 835 states and 1205 transitions. [2022-02-20 18:38:20,423 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1205 transitions. [2022-02-20 18:38:20,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:20,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:20,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:20,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:20,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 815 states have (on average 1.4539877300613497) internal successors, (1185), 816 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have 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:38:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1185 transitions. [2022-02-20 18:38:20,456 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1185 transitions. Word has length 93 [2022-02-20 18:38:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:20,456 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1185 transitions. [2022-02-20 18:38:20,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:38:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1185 transitions. [2022-02-20 18:38:20,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-20 18:38:20,458 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:20,458 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, 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:38:20,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:38:20,458 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:20,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:20,458 INFO L85 PathProgramCache]: Analyzing trace with hash -379676641, now seen corresponding path program 1 times [2022-02-20 18:38:20,458 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:20,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437561048] [2022-02-20 18:38:20,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:20,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:20,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {10681#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(55, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~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_1131~0 := 0;~__return_1259~0 := 0;~__return_1679~0 := 0;~__return_1378~0 := 0;~__tmp_1379_0~0 := 0;~__return_1487~0 := 0;~__return_1392~0 := 0; {10681#true} is VALID [2022-02-20 18:38:20,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {10681#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#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_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#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; {10683#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:38:20,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {10683#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {10683#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:38:20,616 INFO L290 TraceCheckUtils]: 3: Hoare triple {10683#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} assume !(0 == main_~init__r131~0#1 % 256); {10684#(and (< (* 256 (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) (= ~ep13~0 |ULTIMATE.start_main_~init__r131~0#1|))} is VALID [2022-02-20 18:38:20,617 INFO L290 TraceCheckUtils]: 4: Hoare triple {10684#(and (< (* 256 (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) (= ~ep13~0 |ULTIMATE.start_main_~init__r131~0#1|))} assume !!(0 == ~ep32~0 % 256);main_~init__tmp~0#1 := 0; {10684#(and (< (* 256 (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) (= ~ep13~0 |ULTIMATE.start_main_~init__r131~0#1|))} is VALID [2022-02-20 18:38:20,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {10684#(and (< (* 256 (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) (= ~ep13~0 |ULTIMATE.start_main_~init__r131~0#1|))} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {10684#(and (< (* 256 (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) (= ~ep13~0 |ULTIMATE.start_main_~init__r131~0#1|))} is VALID [2022-02-20 18:38:20,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {10684#(and (< (* 256 (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) (= ~ep13~0 |ULTIMATE.start_main_~init__r131~0#1|))} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id1~0 != ~id2~0; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id1~0 != ~id3~0; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id2~0 != ~id3~0; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id1~0 >= 0; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id2~0 >= 0; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id3~0 >= 0; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~r1~0; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~r2~0; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~r3~0; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r122~0#1 % 256); {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r132~0#1 % 256); {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r212~0#1 % 256); {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,633 INFO L290 TraceCheckUtils]: 28: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r232~0#1 % 256); {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r312~0#1 % 256); {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r322~0#1 % 256); {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~max1~0 == ~id1~0; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~max2~0 == ~id2~0; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,635 INFO L290 TraceCheckUtils]: 33: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~max3~0 == ~id3~0; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~st1~0; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~st2~0; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~st3~0; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~nl1~0; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~nl2~0; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,637 INFO L290 TraceCheckUtils]: 39: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~nl3~0; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,637 INFO L290 TraceCheckUtils]: 40: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~mode1~0 % 256; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,638 INFO L290 TraceCheckUtils]: 41: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~mode2~0 % 256; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,638 INFO L290 TraceCheckUtils]: 42: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1131~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1131~0; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,638 INFO L290 TraceCheckUtils]: 43: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~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; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,639 INFO L290 TraceCheckUtils]: 44: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume main_~main__i2~0#1 < 6; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,639 INFO L290 TraceCheckUtils]: 45: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == ~mode1~0 % 256); {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,639 INFO L290 TraceCheckUtils]: 46: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~r1~0 < 2; {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,639 INFO L290 TraceCheckUtils]: 47: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == ~ep12~0 % 256); {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:38:20,640 INFO L290 TraceCheckUtils]: 48: Hoare triple {10685#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == ~ep13~0 % 256); {10682#false} is VALID [2022-02-20 18:38:20,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {10682#false} ~mode1~0 := 1; {10682#false} is VALID [2022-02-20 18:38:20,640 INFO L290 TraceCheckUtils]: 50: Hoare triple {10682#false} assume !!(0 == ~mode2~0 % 256); {10682#false} is VALID [2022-02-20 18:38:20,640 INFO L290 TraceCheckUtils]: 51: Hoare triple {10682#false} assume ~r2~0 < 2; {10682#false} is VALID [2022-02-20 18:38:20,640 INFO L290 TraceCheckUtils]: 52: Hoare triple {10682#false} assume !!(0 == ~ep21~0 % 256); {10682#false} is VALID [2022-02-20 18:38:20,641 INFO L290 TraceCheckUtils]: 53: Hoare triple {10682#false} assume !!(0 == ~ep23~0 % 256); {10682#false} is VALID [2022-02-20 18:38:20,641 INFO L290 TraceCheckUtils]: 54: Hoare triple {10682#false} ~mode2~0 := 1; {10682#false} is VALID [2022-02-20 18:38:20,641 INFO L290 TraceCheckUtils]: 55: Hoare triple {10682#false} assume !!(0 == ~mode3~0 % 256); {10682#false} is VALID [2022-02-20 18:38:20,641 INFO L290 TraceCheckUtils]: 56: Hoare triple {10682#false} assume ~r3~0 < 2; {10682#false} is VALID [2022-02-20 18:38:20,641 INFO L290 TraceCheckUtils]: 57: Hoare triple {10682#false} assume !!(0 == ~ep31~0 % 256); {10682#false} is VALID [2022-02-20 18:38:20,641 INFO L290 TraceCheckUtils]: 58: Hoare triple {10682#false} assume !!(0 == ~ep32~0 % 256); {10682#false} is VALID [2022-02-20 18:38:20,641 INFO L290 TraceCheckUtils]: 59: Hoare triple {10682#false} ~mode3~0 := 1;~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; {10682#false} is VALID [2022-02-20 18:38:20,641 INFO L290 TraceCheckUtils]: 60: Hoare triple {10682#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {10682#false} is VALID [2022-02-20 18:38:20,641 INFO L290 TraceCheckUtils]: 61: Hoare triple {10682#false} assume ~st1~0 + ~nl1~0 <= 1; {10682#false} is VALID [2022-02-20 18:38:20,641 INFO L290 TraceCheckUtils]: 62: Hoare triple {10682#false} assume ~st2~0 + ~nl2~0 <= 1; {10682#false} is VALID [2022-02-20 18:38:20,642 INFO L290 TraceCheckUtils]: 63: Hoare triple {10682#false} assume ~st3~0 + ~nl3~0 <= 1; {10682#false} is VALID [2022-02-20 18:38:20,642 INFO L290 TraceCheckUtils]: 64: Hoare triple {10682#false} assume !(~r1~0 >= 2); {10682#false} is VALID [2022-02-20 18:38:20,642 INFO L290 TraceCheckUtils]: 65: Hoare triple {10682#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {10682#false} is VALID [2022-02-20 18:38:20,642 INFO L290 TraceCheckUtils]: 66: Hoare triple {10682#false} assume ~r1~0 < 2; {10682#false} is VALID [2022-02-20 18:38:20,642 INFO L290 TraceCheckUtils]: 67: Hoare triple {10682#false} assume !(~r1~0 >= 2); {10682#false} is VALID [2022-02-20 18:38:20,642 INFO L290 TraceCheckUtils]: 68: Hoare triple {10682#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {10682#false} is VALID [2022-02-20 18:38:20,642 INFO L290 TraceCheckUtils]: 69: Hoare triple {10682#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1259~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1259~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; {10682#false} is VALID [2022-02-20 18:38:20,642 INFO L290 TraceCheckUtils]: 70: Hoare triple {10682#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {10682#false} is VALID [2022-02-20 18:38:20,642 INFO L290 TraceCheckUtils]: 71: Hoare triple {10682#false} assume main_~main__i2~0#1 < 6; {10682#false} is VALID [2022-02-20 18:38:20,642 INFO L290 TraceCheckUtils]: 72: Hoare triple {10682#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {10682#false} is VALID [2022-02-20 18:38:20,642 INFO L290 TraceCheckUtils]: 73: Hoare triple {10682#false} assume !!(0 == ~ep21~0 % 256); {10682#false} is VALID [2022-02-20 18:38:20,643 INFO L290 TraceCheckUtils]: 74: Hoare triple {10682#false} assume !!(0 == ~ep31~0 % 256); {10682#false} is VALID [2022-02-20 18:38:20,643 INFO L290 TraceCheckUtils]: 75: Hoare triple {10682#false} assume 1 == ~r1~0; {10682#false} is VALID [2022-02-20 18:38:20,643 INFO L290 TraceCheckUtils]: 76: Hoare triple {10682#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0; {10682#false} is VALID [2022-02-20 18:38:20,643 INFO L290 TraceCheckUtils]: 77: Hoare triple {10682#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {10682#false} is VALID [2022-02-20 18:38:20,643 INFO L290 TraceCheckUtils]: 78: Hoare triple {10682#false} assume !!(0 == ~ep12~0 % 256); {10682#false} is VALID [2022-02-20 18:38:20,643 INFO L290 TraceCheckUtils]: 79: Hoare triple {10682#false} assume !!(0 == ~ep32~0 % 256); {10682#false} is VALID [2022-02-20 18:38:20,643 INFO L290 TraceCheckUtils]: 80: Hoare triple {10682#false} assume !(2 == ~r2~0);~mode2~0 := 0; {10682#false} is VALID [2022-02-20 18:38:20,643 INFO L290 TraceCheckUtils]: 81: Hoare triple {10682#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {10682#false} is VALID [2022-02-20 18:38:20,643 INFO L290 TraceCheckUtils]: 82: Hoare triple {10682#false} assume !!(0 == ~ep13~0 % 256); {10682#false} is VALID [2022-02-20 18:38:20,643 INFO L290 TraceCheckUtils]: 83: Hoare triple {10682#false} assume !!(0 == ~ep23~0 % 256); {10682#false} is VALID [2022-02-20 18:38:20,643 INFO L290 TraceCheckUtils]: 84: Hoare triple {10682#false} assume !(2 == ~r3~0);~mode3~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~1#1; {10682#false} is VALID [2022-02-20 18:38:20,644 INFO L290 TraceCheckUtils]: 85: Hoare triple {10682#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {10682#false} is VALID [2022-02-20 18:38:20,644 INFO L290 TraceCheckUtils]: 86: Hoare triple {10682#false} assume ~st1~0 + ~nl1~0 <= 1; {10682#false} is VALID [2022-02-20 18:38:20,644 INFO L290 TraceCheckUtils]: 87: Hoare triple {10682#false} assume ~st2~0 + ~nl2~0 <= 1; {10682#false} is VALID [2022-02-20 18:38:20,644 INFO L290 TraceCheckUtils]: 88: Hoare triple {10682#false} assume ~st3~0 + ~nl3~0 <= 1; {10682#false} is VALID [2022-02-20 18:38:20,644 INFO L290 TraceCheckUtils]: 89: Hoare triple {10682#false} assume !(~r1~0 >= 2); {10682#false} is VALID [2022-02-20 18:38:20,644 INFO L290 TraceCheckUtils]: 90: Hoare triple {10682#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1679~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1679~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {10682#false} is VALID [2022-02-20 18:38:20,644 INFO L290 TraceCheckUtils]: 91: Hoare triple {10682#false} assume 0 == main_~assert__arg~1#1 % 256; {10682#false} is VALID [2022-02-20 18:38:20,644 INFO L290 TraceCheckUtils]: 92: Hoare triple {10682#false} assume !false; {10682#false} is VALID [2022-02-20 18:38:20,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:38:20,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:20,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437561048] [2022-02-20 18:38:20,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437561048] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:20,645 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:20,645 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:38:20,645 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830878161] [2022-02-20 18:38:20,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:20,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-02-20 18:38:20,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:20,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:38:20,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:20,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:38:20,706 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:20,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:38:20,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:38:20,707 INFO L87 Difference]: Start difference. First operand 817 states and 1185 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:38:21,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:21,903 INFO L93 Difference]: Finished difference Result 2212 states and 3216 transitions. [2022-02-20 18:38:21,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:38:21,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-02-20 18:38:21,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:38:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 991 transitions. [2022-02-20 18:38:21,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:38:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 991 transitions. [2022-02-20 18:38:21,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 991 transitions. [2022-02-20 18:38:22,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 991 edges. 991 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:22,604 INFO L225 Difference]: With dead ends: 2212 [2022-02-20 18:38:22,604 INFO L226 Difference]: Without dead ends: 1409 [2022-02-20 18:38:22,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:38:22,613 INFO L933 BasicCegarLoop]: 562 mSDtfsCounter, 637 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:22,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [637 Valid, 1174 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:22,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2022-02-20 18:38:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1395. [2022-02-20 18:38:22,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:22,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1409 states. Second operand has 1395 states, 1393 states have (on average 1.4465183058147881) internal successors, (2015), 1394 states have internal predecessors, (2015), 0 states have call successors, (0), 0 states have 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:38:22,877 INFO L74 IsIncluded]: Start isIncluded. First operand 1409 states. Second operand has 1395 states, 1393 states have (on average 1.4465183058147881) internal successors, (2015), 1394 states have internal predecessors, (2015), 0 states have call successors, (0), 0 states have 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:38:22,879 INFO L87 Difference]: Start difference. First operand 1409 states. Second operand has 1395 states, 1393 states have (on average 1.4465183058147881) internal successors, (2015), 1394 states have internal predecessors, (2015), 0 states have call successors, (0), 0 states have 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:38:22,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:22,958 INFO L93 Difference]: Finished difference Result 1409 states and 2029 transitions. [2022-02-20 18:38:22,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 2029 transitions. [2022-02-20 18:38:22,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:22,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:22,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 1395 states, 1393 states have (on average 1.4465183058147881) internal successors, (2015), 1394 states have internal predecessors, (2015), 0 states have call successors, (0), 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 1409 states. [2022-02-20 18:38:22,965 INFO L87 Difference]: Start difference. First operand has 1395 states, 1393 states have (on average 1.4465183058147881) internal successors, (2015), 1394 states have internal predecessors, (2015), 0 states have call successors, (0), 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 1409 states. [2022-02-20 18:38:23,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:23,032 INFO L93 Difference]: Finished difference Result 1409 states and 2029 transitions. [2022-02-20 18:38:23,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 2029 transitions. [2022-02-20 18:38:23,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:23,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:23,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:23,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1393 states have (on average 1.4465183058147881) internal successors, (2015), 1394 states have internal predecessors, (2015), 0 states have call successors, (0), 0 states have 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:38:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 2015 transitions. [2022-02-20 18:38:23,113 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 2015 transitions. Word has length 93 [2022-02-20 18:38:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:23,114 INFO L470 AbstractCegarLoop]: Abstraction has 1395 states and 2015 transitions. [2022-02-20 18:38:23,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:38:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 2015 transitions. [2022-02-20 18:38:23,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-20 18:38:23,116 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:23,117 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, 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:38:23,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:38:23,117 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:23,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:23,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1337277749, now seen corresponding path program 1 times [2022-02-20 18:38:23,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:23,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640637083] [2022-02-20 18:38:23,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:23,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:23,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {18236#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(55, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~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_1131~0 := 0;~__return_1259~0 := 0;~__return_1679~0 := 0;~__return_1378~0 := 0;~__tmp_1379_0~0 := 0;~__return_1487~0 := 0;~__return_1392~0 := 0; {18236#true} is VALID [2022-02-20 18:38:23,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {18236#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#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_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#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; {18238#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:23,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {18238#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {18238#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:23,223 INFO L290 TraceCheckUtils]: 3: Hoare triple {18238#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {18238#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:23,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {18238#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {18238#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:23,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {18238#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256); {18238#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:23,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {18238#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {18238#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:23,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {18238#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {18238#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:23,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {18238#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 != ~id2~0; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 != ~id3~0; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id2~0 != ~id3~0; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 >= 0; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id2~0 >= 0; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id3~0 >= 0; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r1~0; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r2~0; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r3~0; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r122~0#1 % 256); {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r132~0#1 % 256); {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r212~0#1 % 256); {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r232~0#1 % 256); {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r312~0#1 % 256); {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r322~0#1 % 256); {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max1~0 == ~id1~0; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max2~0 == ~id2~0; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max3~0 == ~id3~0; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st1~0; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st2~0; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st3~0; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,245 INFO L290 TraceCheckUtils]: 37: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl1~0; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,246 INFO L290 TraceCheckUtils]: 38: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl2~0; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,246 INFO L290 TraceCheckUtils]: 39: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl3~0; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,246 INFO L290 TraceCheckUtils]: 40: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode1~0 % 256; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,247 INFO L290 TraceCheckUtils]: 41: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode2~0 % 256; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,247 INFO L290 TraceCheckUtils]: 42: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1131~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1131~0; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,248 INFO L290 TraceCheckUtils]: 43: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~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; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,248 INFO L290 TraceCheckUtils]: 44: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume main_~main__i2~0#1 < 6; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,249 INFO L290 TraceCheckUtils]: 45: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~mode1~0 % 256); {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,249 INFO L290 TraceCheckUtils]: 46: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~r1~0 < 2; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,249 INFO L290 TraceCheckUtils]: 47: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep12~0 % 256); {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,250 INFO L290 TraceCheckUtils]: 48: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep13~0 % 256); {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,250 INFO L290 TraceCheckUtils]: 49: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} ~mode1~0 := 1; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,250 INFO L290 TraceCheckUtils]: 50: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~mode2~0 % 256); {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,251 INFO L290 TraceCheckUtils]: 51: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~r2~0 < 2; {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:23,251 INFO L290 TraceCheckUtils]: 52: Hoare triple {18239#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep21~0 % 256); {18237#false} is VALID [2022-02-20 18:38:23,251 INFO L290 TraceCheckUtils]: 53: Hoare triple {18237#false} assume !!(0 == ~ep23~0 % 256); {18237#false} is VALID [2022-02-20 18:38:23,252 INFO L290 TraceCheckUtils]: 54: Hoare triple {18237#false} ~mode2~0 := 1; {18237#false} is VALID [2022-02-20 18:38:23,252 INFO L290 TraceCheckUtils]: 55: Hoare triple {18237#false} assume !!(0 == ~mode3~0 % 256); {18237#false} is VALID [2022-02-20 18:38:23,252 INFO L290 TraceCheckUtils]: 56: Hoare triple {18237#false} assume ~r3~0 < 2; {18237#false} is VALID [2022-02-20 18:38:23,252 INFO L290 TraceCheckUtils]: 57: Hoare triple {18237#false} assume !!(0 == ~ep31~0 % 256); {18237#false} is VALID [2022-02-20 18:38:23,252 INFO L290 TraceCheckUtils]: 58: Hoare triple {18237#false} assume !!(0 == ~ep32~0 % 256); {18237#false} is VALID [2022-02-20 18:38:23,252 INFO L290 TraceCheckUtils]: 59: Hoare triple {18237#false} ~mode3~0 := 1;~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; {18237#false} is VALID [2022-02-20 18:38:23,253 INFO L290 TraceCheckUtils]: 60: Hoare triple {18237#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {18237#false} is VALID [2022-02-20 18:38:23,253 INFO L290 TraceCheckUtils]: 61: Hoare triple {18237#false} assume ~st1~0 + ~nl1~0 <= 1; {18237#false} is VALID [2022-02-20 18:38:23,253 INFO L290 TraceCheckUtils]: 62: Hoare triple {18237#false} assume ~st2~0 + ~nl2~0 <= 1; {18237#false} is VALID [2022-02-20 18:38:23,253 INFO L290 TraceCheckUtils]: 63: Hoare triple {18237#false} assume ~st3~0 + ~nl3~0 <= 1; {18237#false} is VALID [2022-02-20 18:38:23,253 INFO L290 TraceCheckUtils]: 64: Hoare triple {18237#false} assume !(~r1~0 >= 2); {18237#false} is VALID [2022-02-20 18:38:23,253 INFO L290 TraceCheckUtils]: 65: Hoare triple {18237#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {18237#false} is VALID [2022-02-20 18:38:23,253 INFO L290 TraceCheckUtils]: 66: Hoare triple {18237#false} assume ~r1~0 < 2; {18237#false} is VALID [2022-02-20 18:38:23,254 INFO L290 TraceCheckUtils]: 67: Hoare triple {18237#false} assume !(~r1~0 >= 2); {18237#false} is VALID [2022-02-20 18:38:23,254 INFO L290 TraceCheckUtils]: 68: Hoare triple {18237#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {18237#false} is VALID [2022-02-20 18:38:23,254 INFO L290 TraceCheckUtils]: 69: Hoare triple {18237#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1259~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1259~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; {18237#false} is VALID [2022-02-20 18:38:23,254 INFO L290 TraceCheckUtils]: 70: Hoare triple {18237#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {18237#false} is VALID [2022-02-20 18:38:23,254 INFO L290 TraceCheckUtils]: 71: Hoare triple {18237#false} assume main_~main__i2~0#1 < 6; {18237#false} is VALID [2022-02-20 18:38:23,254 INFO L290 TraceCheckUtils]: 72: Hoare triple {18237#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {18237#false} is VALID [2022-02-20 18:38:23,255 INFO L290 TraceCheckUtils]: 73: Hoare triple {18237#false} assume !!(0 == ~ep21~0 % 256); {18237#false} is VALID [2022-02-20 18:38:23,255 INFO L290 TraceCheckUtils]: 74: Hoare triple {18237#false} assume !!(0 == ~ep31~0 % 256); {18237#false} is VALID [2022-02-20 18:38:23,255 INFO L290 TraceCheckUtils]: 75: Hoare triple {18237#false} assume 1 == ~r1~0; {18237#false} is VALID [2022-02-20 18:38:23,255 INFO L290 TraceCheckUtils]: 76: Hoare triple {18237#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0; {18237#false} is VALID [2022-02-20 18:38:23,255 INFO L290 TraceCheckUtils]: 77: Hoare triple {18237#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {18237#false} is VALID [2022-02-20 18:38:23,255 INFO L290 TraceCheckUtils]: 78: Hoare triple {18237#false} assume !!(0 == ~ep12~0 % 256); {18237#false} is VALID [2022-02-20 18:38:23,255 INFO L290 TraceCheckUtils]: 79: Hoare triple {18237#false} assume !!(0 == ~ep32~0 % 256); {18237#false} is VALID [2022-02-20 18:38:23,256 INFO L290 TraceCheckUtils]: 80: Hoare triple {18237#false} assume !(2 == ~r2~0);~mode2~0 := 0; {18237#false} is VALID [2022-02-20 18:38:23,256 INFO L290 TraceCheckUtils]: 81: Hoare triple {18237#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {18237#false} is VALID [2022-02-20 18:38:23,256 INFO L290 TraceCheckUtils]: 82: Hoare triple {18237#false} assume !!(0 == ~ep13~0 % 256); {18237#false} is VALID [2022-02-20 18:38:23,256 INFO L290 TraceCheckUtils]: 83: Hoare triple {18237#false} assume !!(0 == ~ep23~0 % 256); {18237#false} is VALID [2022-02-20 18:38:23,256 INFO L290 TraceCheckUtils]: 84: Hoare triple {18237#false} assume !(2 == ~r3~0);~mode3~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~1#1; {18237#false} is VALID [2022-02-20 18:38:23,256 INFO L290 TraceCheckUtils]: 85: Hoare triple {18237#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {18237#false} is VALID [2022-02-20 18:38:23,257 INFO L290 TraceCheckUtils]: 86: Hoare triple {18237#false} assume ~st1~0 + ~nl1~0 <= 1; {18237#false} is VALID [2022-02-20 18:38:23,257 INFO L290 TraceCheckUtils]: 87: Hoare triple {18237#false} assume ~st2~0 + ~nl2~0 <= 1; {18237#false} is VALID [2022-02-20 18:38:23,257 INFO L290 TraceCheckUtils]: 88: Hoare triple {18237#false} assume ~st3~0 + ~nl3~0 <= 1; {18237#false} is VALID [2022-02-20 18:38:23,257 INFO L290 TraceCheckUtils]: 89: Hoare triple {18237#false} assume !(~r1~0 >= 2); {18237#false} is VALID [2022-02-20 18:38:23,257 INFO L290 TraceCheckUtils]: 90: Hoare triple {18237#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1679~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1679~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {18237#false} is VALID [2022-02-20 18:38:23,257 INFO L290 TraceCheckUtils]: 91: Hoare triple {18237#false} assume 0 == main_~assert__arg~1#1 % 256; {18237#false} is VALID [2022-02-20 18:38:23,257 INFO L290 TraceCheckUtils]: 92: Hoare triple {18237#false} assume !false; {18237#false} is VALID [2022-02-20 18:38:23,258 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:38:23,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:23,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640637083] [2022-02-20 18:38:23,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640637083] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:23,259 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:23,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:38:23,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82571632] [2022-02-20 18:38:23,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:23,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-02-20 18:38:23,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:23,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:38:23,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:23,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:38:23,312 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:23,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:38:23,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:38:23,313 INFO L87 Difference]: Start difference. First operand 1395 states and 2015 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:38:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:25,325 INFO L93 Difference]: Finished difference Result 4016 states and 5776 transitions. [2022-02-20 18:38:25,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:38:25,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-02-20 18:38:25,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:38:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 963 transitions. [2022-02-20 18:38:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:38:25,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 963 transitions. [2022-02-20 18:38:25,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 963 transitions. [2022-02-20 18:38:25,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 963 edges. 963 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:26,231 INFO L225 Difference]: With dead ends: 4016 [2022-02-20 18:38:26,231 INFO L226 Difference]: Without dead ends: 2677 [2022-02-20 18:38:26,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:38:26,233 INFO L933 BasicCegarLoop]: 556 mSDtfsCounter, 675 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:26,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [675 Valid, 866 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2022-02-20 18:38:26,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 2630. [2022-02-20 18:38:26,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:26,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2677 states. Second operand has 2630 states, 2628 states have (on average 1.4265601217656012) internal successors, (3749), 2629 states have internal predecessors, (3749), 0 states have call successors, (0), 0 states have 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:38:26,970 INFO L74 IsIncluded]: Start isIncluded. First operand 2677 states. Second operand has 2630 states, 2628 states have (on average 1.4265601217656012) internal successors, (3749), 2629 states have internal predecessors, (3749), 0 states have call successors, (0), 0 states have 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:38:26,973 INFO L87 Difference]: Start difference. First operand 2677 states. Second operand has 2630 states, 2628 states have (on average 1.4265601217656012) internal successors, (3749), 2629 states have internal predecessors, (3749), 0 states have call successors, (0), 0 states have 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:38:27,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:27,205 INFO L93 Difference]: Finished difference Result 2677 states and 3810 transitions. [2022-02-20 18:38:27,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3810 transitions. [2022-02-20 18:38:27,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:27,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:27,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 2630 states, 2628 states have (on average 1.4265601217656012) internal successors, (3749), 2629 states have internal predecessors, (3749), 0 states have call successors, (0), 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 2677 states. [2022-02-20 18:38:27,218 INFO L87 Difference]: Start difference. First operand has 2630 states, 2628 states have (on average 1.4265601217656012) internal successors, (3749), 2629 states have internal predecessors, (3749), 0 states have call successors, (0), 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 2677 states. [2022-02-20 18:38:27,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:27,441 INFO L93 Difference]: Finished difference Result 2677 states and 3810 transitions. [2022-02-20 18:38:27,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3810 transitions. [2022-02-20 18:38:27,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:27,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:27,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:27,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2630 states, 2628 states have (on average 1.4265601217656012) internal successors, (3749), 2629 states have internal predecessors, (3749), 0 states have call successors, (0), 0 states have 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:38:27,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3749 transitions. [2022-02-20 18:38:27,740 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3749 transitions. Word has length 93 [2022-02-20 18:38:27,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:27,741 INFO L470 AbstractCegarLoop]: Abstraction has 2630 states and 3749 transitions. [2022-02-20 18:38:27,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:38:27,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3749 transitions. [2022-02-20 18:38:27,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-20 18:38:27,743 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:27,743 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:27,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:38:27,744 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:27,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:27,744 INFO L85 PathProgramCache]: Analyzing trace with hash 706863127, now seen corresponding path program 1 times [2022-02-20 18:38:27,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:27,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629116191] [2022-02-20 18:38:27,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:27,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:27,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {32338#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(55, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~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_1131~0 := 0;~__return_1259~0 := 0;~__return_1679~0 := 0;~__return_1378~0 := 0;~__tmp_1379_0~0 := 0;~__return_1487~0 := 0;~__return_1392~0 := 0; {32338#true} is VALID [2022-02-20 18:38:27,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {32338#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#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_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#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; {32338#true} is VALID [2022-02-20 18:38:27,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {32338#true} assume !!(0 == main_~init__r121~0#1 % 256); {32338#true} is VALID [2022-02-20 18:38:27,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {32338#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {32338#true} is VALID [2022-02-20 18:38:27,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {32338#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {32338#true} is VALID [2022-02-20 18:38:27,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {32338#true} assume !!(0 == main_~init__r131~0#1 % 256); {32338#true} is VALID [2022-02-20 18:38:27,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {32338#true} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {32338#true} is VALID [2022-02-20 18:38:27,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {32338#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {32338#true} is VALID [2022-02-20 18:38:27,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {32338#true} assume !!(0 == main_~init__r211~0#1 % 256); {32338#true} is VALID [2022-02-20 18:38:27,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {32338#true} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {32340#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 256) (div |ULTIMATE.start_main_~init__r231~0#1| 256))) 0)} is VALID [2022-02-20 18:38:27,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {32340#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 256) (div |ULTIMATE.start_main_~init__r231~0#1| 256))) 0)} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {32340#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 256) (div |ULTIMATE.start_main_~init__r231~0#1| 256))) 0)} is VALID [2022-02-20 18:38:27,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {32340#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 256) (div |ULTIMATE.start_main_~init__r231~0#1| 256))) 0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {32339#false} is VALID [2022-02-20 18:38:27,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {32339#false} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {32339#false} is VALID [2022-02-20 18:38:27,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {32339#false} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {32339#false} is VALID [2022-02-20 18:38:27,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {32339#false} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {32339#false} is VALID [2022-02-20 18:38:27,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {32339#false} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {32339#false} is VALID [2022-02-20 18:38:27,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {32339#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {32339#false} is VALID [2022-02-20 18:38:27,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {32339#false} assume ~id1~0 != ~id2~0; {32339#false} is VALID [2022-02-20 18:38:27,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {32339#false} assume ~id1~0 != ~id3~0; {32339#false} is VALID [2022-02-20 18:38:27,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {32339#false} assume ~id2~0 != ~id3~0; {32339#false} is VALID [2022-02-20 18:38:27,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {32339#false} assume ~id1~0 >= 0; {32339#false} is VALID [2022-02-20 18:38:27,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {32339#false} assume ~id2~0 >= 0; {32339#false} is VALID [2022-02-20 18:38:27,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {32339#false} assume ~id3~0 >= 0; {32339#false} is VALID [2022-02-20 18:38:27,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {32339#false} assume 0 == ~r1~0; {32339#false} is VALID [2022-02-20 18:38:27,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {32339#false} assume 0 == ~r2~0; {32339#false} is VALID [2022-02-20 18:38:27,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {32339#false} assume 0 == ~r3~0; {32339#false} is VALID [2022-02-20 18:38:27,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {32339#false} assume !(0 == main_~init__r122~0#1 % 256); {32339#false} is VALID [2022-02-20 18:38:27,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {32339#false} assume !(0 == main_~init__r132~0#1 % 256); {32339#false} is VALID [2022-02-20 18:38:27,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {32339#false} assume !(0 == main_~init__r212~0#1 % 256); {32339#false} is VALID [2022-02-20 18:38:27,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {32339#false} assume !(0 == main_~init__r232~0#1 % 256); {32339#false} is VALID [2022-02-20 18:38:27,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {32339#false} assume !(0 == main_~init__r312~0#1 % 256); {32339#false} is VALID [2022-02-20 18:38:27,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {32339#false} assume !(0 == main_~init__r322~0#1 % 256); {32339#false} is VALID [2022-02-20 18:38:27,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {32339#false} assume ~max1~0 == ~id1~0; {32339#false} is VALID [2022-02-20 18:38:27,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {32339#false} assume ~max2~0 == ~id2~0; {32339#false} is VALID [2022-02-20 18:38:27,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {32339#false} assume ~max3~0 == ~id3~0; {32339#false} is VALID [2022-02-20 18:38:27,798 INFO L290 TraceCheckUtils]: 35: Hoare triple {32339#false} assume 0 == ~st1~0; {32339#false} is VALID [2022-02-20 18:38:27,798 INFO L290 TraceCheckUtils]: 36: Hoare triple {32339#false} assume 0 == ~st2~0; {32339#false} is VALID [2022-02-20 18:38:27,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {32339#false} assume 0 == ~st3~0; {32339#false} is VALID [2022-02-20 18:38:27,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {32339#false} assume 0 == ~nl1~0; {32339#false} is VALID [2022-02-20 18:38:27,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {32339#false} assume 0 == ~nl2~0; {32339#false} is VALID [2022-02-20 18:38:27,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {32339#false} assume 0 == ~nl3~0; {32339#false} is VALID [2022-02-20 18:38:27,801 INFO L290 TraceCheckUtils]: 41: Hoare triple {32339#false} assume 0 == ~mode1~0 % 256; {32339#false} is VALID [2022-02-20 18:38:27,805 INFO L290 TraceCheckUtils]: 42: Hoare triple {32339#false} assume 0 == ~mode2~0 % 256; {32339#false} is VALID [2022-02-20 18:38:27,806 INFO L290 TraceCheckUtils]: 43: Hoare triple {32339#false} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1131~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1131~0; {32339#false} is VALID [2022-02-20 18:38:27,806 INFO L290 TraceCheckUtils]: 44: Hoare triple {32339#false} 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; {32339#false} is VALID [2022-02-20 18:38:27,806 INFO L290 TraceCheckUtils]: 45: Hoare triple {32339#false} assume main_~main__i2~0#1 < 6; {32339#false} is VALID [2022-02-20 18:38:27,806 INFO L290 TraceCheckUtils]: 46: Hoare triple {32339#false} assume !!(0 == ~mode1~0 % 256); {32339#false} is VALID [2022-02-20 18:38:27,807 INFO L290 TraceCheckUtils]: 47: Hoare triple {32339#false} assume ~r1~0 < 2; {32339#false} is VALID [2022-02-20 18:38:27,807 INFO L290 TraceCheckUtils]: 48: Hoare triple {32339#false} assume !!(0 == ~ep12~0 % 256); {32339#false} is VALID [2022-02-20 18:38:27,809 INFO L290 TraceCheckUtils]: 49: Hoare triple {32339#false} assume !!(0 == ~ep13~0 % 256); {32339#false} is VALID [2022-02-20 18:38:27,809 INFO L290 TraceCheckUtils]: 50: Hoare triple {32339#false} ~mode1~0 := 1; {32339#false} is VALID [2022-02-20 18:38:27,809 INFO L290 TraceCheckUtils]: 51: Hoare triple {32339#false} assume !!(0 == ~mode2~0 % 256); {32339#false} is VALID [2022-02-20 18:38:27,809 INFO L290 TraceCheckUtils]: 52: Hoare triple {32339#false} assume ~r2~0 < 2; {32339#false} is VALID [2022-02-20 18:38:27,810 INFO L290 TraceCheckUtils]: 53: Hoare triple {32339#false} assume !!(0 == ~ep21~0 % 256); {32339#false} is VALID [2022-02-20 18:38:27,810 INFO L290 TraceCheckUtils]: 54: Hoare triple {32339#false} assume !!(0 == ~ep23~0 % 256); {32339#false} is VALID [2022-02-20 18:38:27,810 INFO L290 TraceCheckUtils]: 55: Hoare triple {32339#false} ~mode2~0 := 1; {32339#false} is VALID [2022-02-20 18:38:27,810 INFO L290 TraceCheckUtils]: 56: Hoare triple {32339#false} assume !!(0 == ~mode3~0 % 256); {32339#false} is VALID [2022-02-20 18:38:27,810 INFO L290 TraceCheckUtils]: 57: Hoare triple {32339#false} assume ~r3~0 < 2; {32339#false} is VALID [2022-02-20 18:38:27,810 INFO L290 TraceCheckUtils]: 58: Hoare triple {32339#false} assume !!(0 == ~ep31~0 % 256); {32339#false} is VALID [2022-02-20 18:38:27,810 INFO L290 TraceCheckUtils]: 59: Hoare triple {32339#false} assume !!(0 == ~ep32~0 % 256); {32339#false} is VALID [2022-02-20 18:38:27,810 INFO L290 TraceCheckUtils]: 60: Hoare triple {32339#false} ~mode3~0 := 1;~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; {32339#false} is VALID [2022-02-20 18:38:27,811 INFO L290 TraceCheckUtils]: 61: Hoare triple {32339#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {32339#false} is VALID [2022-02-20 18:38:27,811 INFO L290 TraceCheckUtils]: 62: Hoare triple {32339#false} assume ~st1~0 + ~nl1~0 <= 1; {32339#false} is VALID [2022-02-20 18:38:27,811 INFO L290 TraceCheckUtils]: 63: Hoare triple {32339#false} assume ~st2~0 + ~nl2~0 <= 1; {32339#false} is VALID [2022-02-20 18:38:27,811 INFO L290 TraceCheckUtils]: 64: Hoare triple {32339#false} assume ~st3~0 + ~nl3~0 <= 1; {32339#false} is VALID [2022-02-20 18:38:27,811 INFO L290 TraceCheckUtils]: 65: Hoare triple {32339#false} assume !(~r1~0 >= 2); {32339#false} is VALID [2022-02-20 18:38:27,811 INFO L290 TraceCheckUtils]: 66: Hoare triple {32339#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {32339#false} is VALID [2022-02-20 18:38:27,811 INFO L290 TraceCheckUtils]: 67: Hoare triple {32339#false} assume ~r1~0 < 2; {32339#false} is VALID [2022-02-20 18:38:27,811 INFO L290 TraceCheckUtils]: 68: Hoare triple {32339#false} assume !(~r1~0 >= 2); {32339#false} is VALID [2022-02-20 18:38:27,812 INFO L290 TraceCheckUtils]: 69: Hoare triple {32339#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {32339#false} is VALID [2022-02-20 18:38:27,812 INFO L290 TraceCheckUtils]: 70: Hoare triple {32339#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1259~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1259~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; {32339#false} is VALID [2022-02-20 18:38:27,812 INFO L290 TraceCheckUtils]: 71: Hoare triple {32339#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {32339#false} is VALID [2022-02-20 18:38:27,812 INFO L290 TraceCheckUtils]: 72: Hoare triple {32339#false} assume main_~main__i2~0#1 < 6; {32339#false} is VALID [2022-02-20 18:38:27,812 INFO L290 TraceCheckUtils]: 73: Hoare triple {32339#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {32339#false} is VALID [2022-02-20 18:38:27,812 INFO L290 TraceCheckUtils]: 74: Hoare triple {32339#false} assume !!(0 == ~ep21~0 % 256); {32339#false} is VALID [2022-02-20 18:38:27,812 INFO L290 TraceCheckUtils]: 75: Hoare triple {32339#false} assume !!(0 == ~ep31~0 % 256); {32339#false} is VALID [2022-02-20 18:38:27,812 INFO L290 TraceCheckUtils]: 76: Hoare triple {32339#false} assume 1 == ~r1~0; {32339#false} is VALID [2022-02-20 18:38:27,812 INFO L290 TraceCheckUtils]: 77: Hoare triple {32339#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0; {32339#false} is VALID [2022-02-20 18:38:27,813 INFO L290 TraceCheckUtils]: 78: Hoare triple {32339#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {32339#false} is VALID [2022-02-20 18:38:27,813 INFO L290 TraceCheckUtils]: 79: Hoare triple {32339#false} assume !!(0 == ~ep12~0 % 256); {32339#false} is VALID [2022-02-20 18:38:27,813 INFO L290 TraceCheckUtils]: 80: Hoare triple {32339#false} assume !!(0 == ~ep32~0 % 256); {32339#false} is VALID [2022-02-20 18:38:27,813 INFO L290 TraceCheckUtils]: 81: Hoare triple {32339#false} assume !(2 == ~r2~0);~mode2~0 := 0; {32339#false} is VALID [2022-02-20 18:38:27,813 INFO L290 TraceCheckUtils]: 82: Hoare triple {32339#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {32339#false} is VALID [2022-02-20 18:38:27,813 INFO L290 TraceCheckUtils]: 83: Hoare triple {32339#false} assume !!(0 == ~ep13~0 % 256); {32339#false} is VALID [2022-02-20 18:38:27,813 INFO L290 TraceCheckUtils]: 84: Hoare triple {32339#false} assume !!(0 == ~ep23~0 % 256); {32339#false} is VALID [2022-02-20 18:38:27,813 INFO L290 TraceCheckUtils]: 85: Hoare triple {32339#false} assume !(2 == ~r3~0);~mode3~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~1#1; {32339#false} is VALID [2022-02-20 18:38:27,814 INFO L290 TraceCheckUtils]: 86: Hoare triple {32339#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {32339#false} is VALID [2022-02-20 18:38:27,814 INFO L290 TraceCheckUtils]: 87: Hoare triple {32339#false} assume ~st1~0 + ~nl1~0 <= 1; {32339#false} is VALID [2022-02-20 18:38:27,814 INFO L290 TraceCheckUtils]: 88: Hoare triple {32339#false} assume ~st2~0 + ~nl2~0 <= 1; {32339#false} is VALID [2022-02-20 18:38:27,814 INFO L290 TraceCheckUtils]: 89: Hoare triple {32339#false} assume ~st3~0 + ~nl3~0 <= 1; {32339#false} is VALID [2022-02-20 18:38:27,814 INFO L290 TraceCheckUtils]: 90: Hoare triple {32339#false} assume !(~r1~0 >= 2); {32339#false} is VALID [2022-02-20 18:38:27,814 INFO L290 TraceCheckUtils]: 91: Hoare triple {32339#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1679~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1679~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {32339#false} is VALID [2022-02-20 18:38:27,814 INFO L290 TraceCheckUtils]: 92: Hoare triple {32339#false} assume 0 == main_~assert__arg~1#1 % 256; {32339#false} is VALID [2022-02-20 18:38:27,814 INFO L290 TraceCheckUtils]: 93: Hoare triple {32339#false} assume !false; {32339#false} is VALID [2022-02-20 18:38:27,816 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:38:27,816 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:27,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629116191] [2022-02-20 18:38:27,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629116191] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:27,816 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:27,816 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:27,816 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329063551] [2022-02-20 18:38:27,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:27,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2022-02-20 18:38:27,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:27,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have 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:38:27,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:27,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:27,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:27,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:27,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:27,865 INFO L87 Difference]: Start difference. First operand 2630 states and 3749 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have 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:38:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:32,052 INFO L93 Difference]: Finished difference Result 7738 states and 11014 transitions. [2022-02-20 18:38:32,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:32,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2022-02-20 18:38:32,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have 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:38:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 977 transitions. [2022-02-20 18:38:32,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have 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:38:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 977 transitions. [2022-02-20 18:38:32,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 977 transitions. [2022-02-20 18:38:32,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 977 edges. 977 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:33,638 INFO L225 Difference]: With dead ends: 7738 [2022-02-20 18:38:33,639 INFO L226 Difference]: Without dead ends: 5199 [2022-02-20 18:38:33,642 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:38:33,642 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 319 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:33,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 751 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:33,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5199 states. [2022-02-20 18:38:34,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5199 to 2640. [2022-02-20 18:38:34,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:34,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5199 states. Second operand has 2640 states, 2638 states have (on average 1.4249431387414708) internal successors, (3759), 2639 states have internal predecessors, (3759), 0 states have call successors, (0), 0 states have 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:38:34,344 INFO L74 IsIncluded]: Start isIncluded. First operand 5199 states. Second operand has 2640 states, 2638 states have (on average 1.4249431387414708) internal successors, (3759), 2639 states have internal predecessors, (3759), 0 states have call successors, (0), 0 states have 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:38:34,346 INFO L87 Difference]: Start difference. First operand 5199 states. Second operand has 2640 states, 2638 states have (on average 1.4249431387414708) internal successors, (3759), 2639 states have internal predecessors, (3759), 0 states have call successors, (0), 0 states have 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:38:35,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:35,186 INFO L93 Difference]: Finished difference Result 5199 states and 7399 transitions. [2022-02-20 18:38:35,186 INFO L276 IsEmpty]: Start isEmpty. Operand 5199 states and 7399 transitions. [2022-02-20 18:38:35,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:35,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:35,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 2640 states, 2638 states have (on average 1.4249431387414708) internal successors, (3759), 2639 states have internal predecessors, (3759), 0 states have call successors, (0), 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 5199 states. [2022-02-20 18:38:35,196 INFO L87 Difference]: Start difference. First operand has 2640 states, 2638 states have (on average 1.4249431387414708) internal successors, (3759), 2639 states have internal predecessors, (3759), 0 states have call successors, (0), 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 5199 states. [2022-02-20 18:38:36,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:36,025 INFO L93 Difference]: Finished difference Result 5199 states and 7399 transitions. [2022-02-20 18:38:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 5199 states and 7399 transitions. [2022-02-20 18:38:36,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:36,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:36,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:36,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:36,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2640 states, 2638 states have (on average 1.4249431387414708) internal successors, (3759), 2639 states have internal predecessors, (3759), 0 states have call successors, (0), 0 states have 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:38:36,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 3759 transitions. [2022-02-20 18:38:36,307 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 3759 transitions. Word has length 94 [2022-02-20 18:38:36,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:36,307 INFO L470 AbstractCegarLoop]: Abstraction has 2640 states and 3759 transitions. [2022-02-20 18:38:36,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have 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:38:36,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3759 transitions. [2022-02-20 18:38:36,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-20 18:38:36,309 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:36,309 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, 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:38:36,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:38:36,310 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:36,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:36,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1588732182, now seen corresponding path program 1 times [2022-02-20 18:38:36,310 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:36,311 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782032644] [2022-02-20 18:38:36,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:36,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:36,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {56410#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(55, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~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_1131~0 := 0;~__return_1259~0 := 0;~__return_1679~0 := 0;~__return_1378~0 := 0;~__tmp_1379_0~0 := 0;~__return_1487~0 := 0;~__return_1392~0 := 0; {56410#true} is VALID [2022-02-20 18:38:36,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {56410#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#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_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#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; {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:36,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:36,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:36,384 INFO L290 TraceCheckUtils]: 4: Hoare triple {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:36,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256); {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:36,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:36,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:36,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r211~0#1 % 256); {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:36,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:36,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:36,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r231~0#1 % 256); {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:36,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:36,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:38:36,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {56412#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 != ~id2~0; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 != ~id3~0; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id2~0 != ~id3~0; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 >= 0; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id2~0 >= 0; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id3~0 >= 0; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r1~0; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r2~0; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r3~0; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r122~0#1 % 256); {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r132~0#1 % 256); {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r212~0#1 % 256); {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r232~0#1 % 256); {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r312~0#1 % 256); {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,392 INFO L290 TraceCheckUtils]: 32: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r322~0#1 % 256); {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,392 INFO L290 TraceCheckUtils]: 33: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max1~0 == ~id1~0; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max2~0 == ~id2~0; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max3~0 == ~id3~0; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,393 INFO L290 TraceCheckUtils]: 36: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st1~0; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st2~0; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st3~0; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl1~0; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl2~0; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl3~0; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode1~0 % 256; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode2~0 % 256; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,395 INFO L290 TraceCheckUtils]: 44: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1131~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1131~0; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~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; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume main_~main__i2~0#1 < 6; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,396 INFO L290 TraceCheckUtils]: 47: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode1~0 % 256); {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,397 INFO L290 TraceCheckUtils]: 48: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r1~0 < 2; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,397 INFO L290 TraceCheckUtils]: 49: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep12~0 % 256); {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,397 INFO L290 TraceCheckUtils]: 50: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep13~0 % 256); {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,397 INFO L290 TraceCheckUtils]: 51: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} ~mode1~0 := 1; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,398 INFO L290 TraceCheckUtils]: 52: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode2~0 % 256); {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,398 INFO L290 TraceCheckUtils]: 53: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r2~0 < 2; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,398 INFO L290 TraceCheckUtils]: 54: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep21~0 % 256); {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,399 INFO L290 TraceCheckUtils]: 55: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep23~0 % 256); {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,399 INFO L290 TraceCheckUtils]: 56: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} ~mode2~0 := 1; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,399 INFO L290 TraceCheckUtils]: 57: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode3~0 % 256); {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,399 INFO L290 TraceCheckUtils]: 58: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r3~0 < 2; {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:38:36,400 INFO L290 TraceCheckUtils]: 59: Hoare triple {56413#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep31~0 % 256); {56411#false} is VALID [2022-02-20 18:38:36,400 INFO L290 TraceCheckUtils]: 60: Hoare triple {56411#false} assume !!(0 == ~ep32~0 % 256); {56411#false} is VALID [2022-02-20 18:38:36,400 INFO L290 TraceCheckUtils]: 61: Hoare triple {56411#false} ~mode3~0 := 1;~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; {56411#false} is VALID [2022-02-20 18:38:36,400 INFO L290 TraceCheckUtils]: 62: Hoare triple {56411#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {56411#false} is VALID [2022-02-20 18:38:36,400 INFO L290 TraceCheckUtils]: 63: Hoare triple {56411#false} assume ~st1~0 + ~nl1~0 <= 1; {56411#false} is VALID [2022-02-20 18:38:36,401 INFO L290 TraceCheckUtils]: 64: Hoare triple {56411#false} assume ~st2~0 + ~nl2~0 <= 1; {56411#false} is VALID [2022-02-20 18:38:36,401 INFO L290 TraceCheckUtils]: 65: Hoare triple {56411#false} assume ~st3~0 + ~nl3~0 <= 1; {56411#false} is VALID [2022-02-20 18:38:36,401 INFO L290 TraceCheckUtils]: 66: Hoare triple {56411#false} assume !(~r1~0 >= 2); {56411#false} is VALID [2022-02-20 18:38:36,401 INFO L290 TraceCheckUtils]: 67: Hoare triple {56411#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {56411#false} is VALID [2022-02-20 18:38:36,401 INFO L290 TraceCheckUtils]: 68: Hoare triple {56411#false} assume ~r1~0 < 2; {56411#false} is VALID [2022-02-20 18:38:36,401 INFO L290 TraceCheckUtils]: 69: Hoare triple {56411#false} assume !(~r1~0 >= 2); {56411#false} is VALID [2022-02-20 18:38:36,401 INFO L290 TraceCheckUtils]: 70: Hoare triple {56411#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {56411#false} is VALID [2022-02-20 18:38:36,401 INFO L290 TraceCheckUtils]: 71: Hoare triple {56411#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1259~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1259~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; {56411#false} is VALID [2022-02-20 18:38:36,402 INFO L290 TraceCheckUtils]: 72: Hoare triple {56411#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {56411#false} is VALID [2022-02-20 18:38:36,402 INFO L290 TraceCheckUtils]: 73: Hoare triple {56411#false} assume main_~main__i2~0#1 < 6; {56411#false} is VALID [2022-02-20 18:38:36,402 INFO L290 TraceCheckUtils]: 74: Hoare triple {56411#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {56411#false} is VALID [2022-02-20 18:38:36,402 INFO L290 TraceCheckUtils]: 75: Hoare triple {56411#false} assume !!(0 == ~ep21~0 % 256); {56411#false} is VALID [2022-02-20 18:38:36,402 INFO L290 TraceCheckUtils]: 76: Hoare triple {56411#false} assume !!(0 == ~ep31~0 % 256); {56411#false} is VALID [2022-02-20 18:38:36,402 INFO L290 TraceCheckUtils]: 77: Hoare triple {56411#false} assume 1 == ~r1~0; {56411#false} is VALID [2022-02-20 18:38:36,402 INFO L290 TraceCheckUtils]: 78: Hoare triple {56411#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0; {56411#false} is VALID [2022-02-20 18:38:36,402 INFO L290 TraceCheckUtils]: 79: Hoare triple {56411#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {56411#false} is VALID [2022-02-20 18:38:36,403 INFO L290 TraceCheckUtils]: 80: Hoare triple {56411#false} assume !!(0 == ~ep12~0 % 256); {56411#false} is VALID [2022-02-20 18:38:36,403 INFO L290 TraceCheckUtils]: 81: Hoare triple {56411#false} assume !!(0 == ~ep32~0 % 256); {56411#false} is VALID [2022-02-20 18:38:36,403 INFO L290 TraceCheckUtils]: 82: Hoare triple {56411#false} assume !(2 == ~r2~0);~mode2~0 := 0; {56411#false} is VALID [2022-02-20 18:38:36,403 INFO L290 TraceCheckUtils]: 83: Hoare triple {56411#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {56411#false} is VALID [2022-02-20 18:38:36,403 INFO L290 TraceCheckUtils]: 84: Hoare triple {56411#false} assume !!(0 == ~ep13~0 % 256); {56411#false} is VALID [2022-02-20 18:38:36,403 INFO L290 TraceCheckUtils]: 85: Hoare triple {56411#false} assume !!(0 == ~ep23~0 % 256); {56411#false} is VALID [2022-02-20 18:38:36,403 INFO L290 TraceCheckUtils]: 86: Hoare triple {56411#false} assume !(2 == ~r3~0);~mode3~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~1#1; {56411#false} is VALID [2022-02-20 18:38:36,403 INFO L290 TraceCheckUtils]: 87: Hoare triple {56411#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {56411#false} is VALID [2022-02-20 18:38:36,404 INFO L290 TraceCheckUtils]: 88: Hoare triple {56411#false} assume ~st1~0 + ~nl1~0 <= 1; {56411#false} is VALID [2022-02-20 18:38:36,404 INFO L290 TraceCheckUtils]: 89: Hoare triple {56411#false} assume ~st2~0 + ~nl2~0 <= 1; {56411#false} is VALID [2022-02-20 18:38:36,404 INFO L290 TraceCheckUtils]: 90: Hoare triple {56411#false} assume ~st3~0 + ~nl3~0 <= 1; {56411#false} is VALID [2022-02-20 18:38:36,404 INFO L290 TraceCheckUtils]: 91: Hoare triple {56411#false} assume !(~r1~0 >= 2); {56411#false} is VALID [2022-02-20 18:38:36,404 INFO L290 TraceCheckUtils]: 92: Hoare triple {56411#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1679~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1679~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {56411#false} is VALID [2022-02-20 18:38:36,404 INFO L290 TraceCheckUtils]: 93: Hoare triple {56411#false} assume 0 == main_~assert__arg~1#1 % 256; {56411#false} is VALID [2022-02-20 18:38:36,404 INFO L290 TraceCheckUtils]: 94: Hoare triple {56411#false} assume !false; {56411#false} is VALID [2022-02-20 18:38:36,405 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:38:36,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:36,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782032644] [2022-02-20 18:38:36,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782032644] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:36,405 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:36,405 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:38:36,405 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58627043] [2022-02-20 18:38:36,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:36,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2022-02-20 18:38:36,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:36,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:38:36,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:36,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:38:36,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:36,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:38:36,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:38:36,485 INFO L87 Difference]: Start difference. First operand 2640 states and 3759 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:38:41,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:41,127 INFO L93 Difference]: Finished difference Result 7518 states and 10692 transitions. [2022-02-20 18:38:41,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:38:41,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2022-02-20 18:38:41,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:38:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 956 transitions. [2022-02-20 18:38:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:38:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 956 transitions. [2022-02-20 18:38:41,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 956 transitions. [2022-02-20 18:38:41,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 956 edges. 956 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:42,662 INFO L225 Difference]: With dead ends: 7518 [2022-02-20 18:38:42,662 INFO L226 Difference]: Without dead ends: 4979 [2022-02-20 18:38:42,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:38:42,665 INFO L933 BasicCegarLoop]: 545 mSDtfsCounter, 669 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:42,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [669 Valid, 855 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:42,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4979 states. [2022-02-20 18:38:44,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4979 to 4932. [2022-02-20 18:38:44,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:44,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4979 states. Second operand has 4932 states, 4930 states have (on average 1.4079107505070994) internal successors, (6941), 4931 states have internal predecessors, (6941), 0 states have call successors, (0), 0 states have 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:38:44,397 INFO L74 IsIncluded]: Start isIncluded. First operand 4979 states. Second operand has 4932 states, 4930 states have (on average 1.4079107505070994) internal successors, (6941), 4931 states have internal predecessors, (6941), 0 states have call successors, (0), 0 states have 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:38:44,400 INFO L87 Difference]: Start difference. First operand 4979 states. Second operand has 4932 states, 4930 states have (on average 1.4079107505070994) internal successors, (6941), 4931 states have internal predecessors, (6941), 0 states have call successors, (0), 0 states have 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:38:45,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:45,178 INFO L93 Difference]: Finished difference Result 4979 states and 7002 transitions. [2022-02-20 18:38:45,178 INFO L276 IsEmpty]: Start isEmpty. Operand 4979 states and 7002 transitions. [2022-02-20 18:38:45,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:45,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:45,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 4932 states, 4930 states have (on average 1.4079107505070994) internal successors, (6941), 4931 states have internal predecessors, (6941), 0 states have call successors, (0), 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 4979 states. [2022-02-20 18:38:45,192 INFO L87 Difference]: Start difference. First operand has 4932 states, 4930 states have (on average 1.4079107505070994) internal successors, (6941), 4931 states have internal predecessors, (6941), 0 states have call successors, (0), 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 4979 states. [2022-02-20 18:38:45,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:45,985 INFO L93 Difference]: Finished difference Result 4979 states and 7002 transitions. [2022-02-20 18:38:45,985 INFO L276 IsEmpty]: Start isEmpty. Operand 4979 states and 7002 transitions. [2022-02-20 18:38:45,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:45,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:45,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:45,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4932 states, 4930 states have (on average 1.4079107505070994) internal successors, (6941), 4931 states have internal predecessors, (6941), 0 states have call successors, (0), 0 states have 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:38:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4932 states to 4932 states and 6941 transitions. [2022-02-20 18:38:46,987 INFO L78 Accepts]: Start accepts. Automaton has 4932 states and 6941 transitions. Word has length 95 [2022-02-20 18:38:46,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:46,987 INFO L470 AbstractCegarLoop]: Abstraction has 4932 states and 6941 transitions. [2022-02-20 18:38:46,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:38:46,987 INFO L276 IsEmpty]: Start isEmpty. Operand 4932 states and 6941 transitions. [2022-02-20 18:38:46,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 18:38:46,990 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:46,990 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, 1, 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:38:46,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:38:46,990 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:46,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:46,991 INFO L85 PathProgramCache]: Analyzing trace with hash -141313834, now seen corresponding path program 1 times [2022-02-20 18:38:46,991 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:46,991 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544857598] [2022-02-20 18:38:46,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:46,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:47,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {82810#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(55, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~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_1131~0 := 0;~__return_1259~0 := 0;~__return_1679~0 := 0;~__return_1378~0 := 0;~__tmp_1379_0~0 := 0;~__return_1487~0 := 0;~__return_1392~0 := 0; {82810#true} is VALID [2022-02-20 18:38:47,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {82810#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#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_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#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; {82810#true} is VALID [2022-02-20 18:38:47,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {82810#true} assume !!(0 == main_~init__r121~0#1 % 256); {82810#true} is VALID [2022-02-20 18:38:47,029 INFO L290 TraceCheckUtils]: 3: Hoare triple {82810#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {82810#true} is VALID [2022-02-20 18:38:47,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {82810#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {82810#true} is VALID [2022-02-20 18:38:47,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {82810#true} assume !!(0 == main_~init__r131~0#1 % 256); {82810#true} is VALID [2022-02-20 18:38:47,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {82810#true} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {82810#true} is VALID [2022-02-20 18:38:47,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {82810#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {82810#true} is VALID [2022-02-20 18:38:47,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {82810#true} assume !!(0 == main_~init__r211~0#1 % 256); {82810#true} is VALID [2022-02-20 18:38:47,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {82810#true} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {82810#true} is VALID [2022-02-20 18:38:47,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {82810#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {82810#true} is VALID [2022-02-20 18:38:47,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {82810#true} assume !!(0 == main_~init__r231~0#1 % 256); {82810#true} is VALID [2022-02-20 18:38:47,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {82810#true} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {82810#true} is VALID [2022-02-20 18:38:47,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {82810#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {82810#true} is VALID [2022-02-20 18:38:47,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {82810#true} assume !!(0 == main_~init__r311~0#1 % 256); {82810#true} is VALID [2022-02-20 18:38:47,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {82810#true} assume !!(0 == main_~init__r321~0#1 % 256);main_~init__tmp___3~0#1 := 0; {82812#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) (- 256))) 0)} is VALID [2022-02-20 18:38:47,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {82812#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) (- 256))) 0)} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {82812#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) (- 256))) 0)} is VALID [2022-02-20 18:38:47,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {82812#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) (- 256))) 0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {82811#false} is VALID [2022-02-20 18:38:47,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {82811#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {82811#false} is VALID [2022-02-20 18:38:47,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {82811#false} assume ~id1~0 != ~id2~0; {82811#false} is VALID [2022-02-20 18:38:47,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {82811#false} assume ~id1~0 != ~id3~0; {82811#false} is VALID [2022-02-20 18:38:47,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {82811#false} assume ~id2~0 != ~id3~0; {82811#false} is VALID [2022-02-20 18:38:47,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {82811#false} assume ~id1~0 >= 0; {82811#false} is VALID [2022-02-20 18:38:47,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {82811#false} assume ~id2~0 >= 0; {82811#false} is VALID [2022-02-20 18:38:47,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {82811#false} assume ~id3~0 >= 0; {82811#false} is VALID [2022-02-20 18:38:47,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {82811#false} assume 0 == ~r1~0; {82811#false} is VALID [2022-02-20 18:38:47,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {82811#false} assume 0 == ~r2~0; {82811#false} is VALID [2022-02-20 18:38:47,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {82811#false} assume 0 == ~r3~0; {82811#false} is VALID [2022-02-20 18:38:47,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {82811#false} assume !(0 == main_~init__r122~0#1 % 256); {82811#false} is VALID [2022-02-20 18:38:47,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {82811#false} assume !(0 == main_~init__r132~0#1 % 256); {82811#false} is VALID [2022-02-20 18:38:47,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {82811#false} assume !(0 == main_~init__r212~0#1 % 256); {82811#false} is VALID [2022-02-20 18:38:47,034 INFO L290 TraceCheckUtils]: 31: Hoare triple {82811#false} assume !(0 == main_~init__r232~0#1 % 256); {82811#false} is VALID [2022-02-20 18:38:47,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {82811#false} assume !(0 == main_~init__r312~0#1 % 256); {82811#false} is VALID [2022-02-20 18:38:47,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {82811#false} assume !(0 == main_~init__r322~0#1 % 256); {82811#false} is VALID [2022-02-20 18:38:47,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {82811#false} assume ~max1~0 == ~id1~0; {82811#false} is VALID [2022-02-20 18:38:47,034 INFO L290 TraceCheckUtils]: 35: Hoare triple {82811#false} assume ~max2~0 == ~id2~0; {82811#false} is VALID [2022-02-20 18:38:47,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {82811#false} assume ~max3~0 == ~id3~0; {82811#false} is VALID [2022-02-20 18:38:47,035 INFO L290 TraceCheckUtils]: 37: Hoare triple {82811#false} assume 0 == ~st1~0; {82811#false} is VALID [2022-02-20 18:38:47,035 INFO L290 TraceCheckUtils]: 38: Hoare triple {82811#false} assume 0 == ~st2~0; {82811#false} is VALID [2022-02-20 18:38:47,035 INFO L290 TraceCheckUtils]: 39: Hoare triple {82811#false} assume 0 == ~st3~0; {82811#false} is VALID [2022-02-20 18:38:47,035 INFO L290 TraceCheckUtils]: 40: Hoare triple {82811#false} assume 0 == ~nl1~0; {82811#false} is VALID [2022-02-20 18:38:47,035 INFO L290 TraceCheckUtils]: 41: Hoare triple {82811#false} assume 0 == ~nl2~0; {82811#false} is VALID [2022-02-20 18:38:47,035 INFO L290 TraceCheckUtils]: 42: Hoare triple {82811#false} assume 0 == ~nl3~0; {82811#false} is VALID [2022-02-20 18:38:47,035 INFO L290 TraceCheckUtils]: 43: Hoare triple {82811#false} assume 0 == ~mode1~0 % 256; {82811#false} is VALID [2022-02-20 18:38:47,036 INFO L290 TraceCheckUtils]: 44: Hoare triple {82811#false} assume 0 == ~mode2~0 % 256; {82811#false} is VALID [2022-02-20 18:38:47,036 INFO L290 TraceCheckUtils]: 45: Hoare triple {82811#false} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1131~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1131~0; {82811#false} is VALID [2022-02-20 18:38:47,036 INFO L290 TraceCheckUtils]: 46: Hoare triple {82811#false} 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; {82811#false} is VALID [2022-02-20 18:38:47,036 INFO L290 TraceCheckUtils]: 47: Hoare triple {82811#false} assume main_~main__i2~0#1 < 6; {82811#false} is VALID [2022-02-20 18:38:47,036 INFO L290 TraceCheckUtils]: 48: Hoare triple {82811#false} assume !!(0 == ~mode1~0 % 256); {82811#false} is VALID [2022-02-20 18:38:47,036 INFO L290 TraceCheckUtils]: 49: Hoare triple {82811#false} assume ~r1~0 < 2; {82811#false} is VALID [2022-02-20 18:38:47,036 INFO L290 TraceCheckUtils]: 50: Hoare triple {82811#false} assume !!(0 == ~ep12~0 % 256); {82811#false} is VALID [2022-02-20 18:38:47,036 INFO L290 TraceCheckUtils]: 51: Hoare triple {82811#false} assume !!(0 == ~ep13~0 % 256); {82811#false} is VALID [2022-02-20 18:38:47,037 INFO L290 TraceCheckUtils]: 52: Hoare triple {82811#false} ~mode1~0 := 1; {82811#false} is VALID [2022-02-20 18:38:47,037 INFO L290 TraceCheckUtils]: 53: Hoare triple {82811#false} assume !!(0 == ~mode2~0 % 256); {82811#false} is VALID [2022-02-20 18:38:47,037 INFO L290 TraceCheckUtils]: 54: Hoare triple {82811#false} assume ~r2~0 < 2; {82811#false} is VALID [2022-02-20 18:38:47,037 INFO L290 TraceCheckUtils]: 55: Hoare triple {82811#false} assume !!(0 == ~ep21~0 % 256); {82811#false} is VALID [2022-02-20 18:38:47,037 INFO L290 TraceCheckUtils]: 56: Hoare triple {82811#false} assume !!(0 == ~ep23~0 % 256); {82811#false} is VALID [2022-02-20 18:38:47,037 INFO L290 TraceCheckUtils]: 57: Hoare triple {82811#false} ~mode2~0 := 1; {82811#false} is VALID [2022-02-20 18:38:47,037 INFO L290 TraceCheckUtils]: 58: Hoare triple {82811#false} assume !!(0 == ~mode3~0 % 256); {82811#false} is VALID [2022-02-20 18:38:47,037 INFO L290 TraceCheckUtils]: 59: Hoare triple {82811#false} assume ~r3~0 < 2; {82811#false} is VALID [2022-02-20 18:38:47,037 INFO L290 TraceCheckUtils]: 60: Hoare triple {82811#false} assume !!(0 == ~ep31~0 % 256); {82811#false} is VALID [2022-02-20 18:38:47,038 INFO L290 TraceCheckUtils]: 61: Hoare triple {82811#false} assume !!(0 == ~ep32~0 % 256); {82811#false} is VALID [2022-02-20 18:38:47,038 INFO L290 TraceCheckUtils]: 62: Hoare triple {82811#false} ~mode3~0 := 1;~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; {82811#false} is VALID [2022-02-20 18:38:47,038 INFO L290 TraceCheckUtils]: 63: Hoare triple {82811#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {82811#false} is VALID [2022-02-20 18:38:47,038 INFO L290 TraceCheckUtils]: 64: Hoare triple {82811#false} assume ~st1~0 + ~nl1~0 <= 1; {82811#false} is VALID [2022-02-20 18:38:47,038 INFO L290 TraceCheckUtils]: 65: Hoare triple {82811#false} assume ~st2~0 + ~nl2~0 <= 1; {82811#false} is VALID [2022-02-20 18:38:47,038 INFO L290 TraceCheckUtils]: 66: Hoare triple {82811#false} assume ~st3~0 + ~nl3~0 <= 1; {82811#false} is VALID [2022-02-20 18:38:47,038 INFO L290 TraceCheckUtils]: 67: Hoare triple {82811#false} assume !(~r1~0 >= 2); {82811#false} is VALID [2022-02-20 18:38:47,038 INFO L290 TraceCheckUtils]: 68: Hoare triple {82811#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {82811#false} is VALID [2022-02-20 18:38:47,039 INFO L290 TraceCheckUtils]: 69: Hoare triple {82811#false} assume ~r1~0 < 2; {82811#false} is VALID [2022-02-20 18:38:47,039 INFO L290 TraceCheckUtils]: 70: Hoare triple {82811#false} assume !(~r1~0 >= 2); {82811#false} is VALID [2022-02-20 18:38:47,039 INFO L290 TraceCheckUtils]: 71: Hoare triple {82811#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {82811#false} is VALID [2022-02-20 18:38:47,039 INFO L290 TraceCheckUtils]: 72: Hoare triple {82811#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1259~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1259~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; {82811#false} is VALID [2022-02-20 18:38:47,039 INFO L290 TraceCheckUtils]: 73: Hoare triple {82811#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {82811#false} is VALID [2022-02-20 18:38:47,039 INFO L290 TraceCheckUtils]: 74: Hoare triple {82811#false} assume main_~main__i2~0#1 < 6; {82811#false} is VALID [2022-02-20 18:38:47,039 INFO L290 TraceCheckUtils]: 75: Hoare triple {82811#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {82811#false} is VALID [2022-02-20 18:38:47,039 INFO L290 TraceCheckUtils]: 76: Hoare triple {82811#false} assume !!(0 == ~ep21~0 % 256); {82811#false} is VALID [2022-02-20 18:38:47,040 INFO L290 TraceCheckUtils]: 77: Hoare triple {82811#false} assume !!(0 == ~ep31~0 % 256); {82811#false} is VALID [2022-02-20 18:38:47,040 INFO L290 TraceCheckUtils]: 78: Hoare triple {82811#false} assume 1 == ~r1~0; {82811#false} is VALID [2022-02-20 18:38:47,040 INFO L290 TraceCheckUtils]: 79: Hoare triple {82811#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0; {82811#false} is VALID [2022-02-20 18:38:47,040 INFO L290 TraceCheckUtils]: 80: Hoare triple {82811#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {82811#false} is VALID [2022-02-20 18:38:47,040 INFO L290 TraceCheckUtils]: 81: Hoare triple {82811#false} assume !!(0 == ~ep12~0 % 256); {82811#false} is VALID [2022-02-20 18:38:47,040 INFO L290 TraceCheckUtils]: 82: Hoare triple {82811#false} assume !!(0 == ~ep32~0 % 256); {82811#false} is VALID [2022-02-20 18:38:47,040 INFO L290 TraceCheckUtils]: 83: Hoare triple {82811#false} assume !(2 == ~r2~0);~mode2~0 := 0; {82811#false} is VALID [2022-02-20 18:38:47,040 INFO L290 TraceCheckUtils]: 84: Hoare triple {82811#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {82811#false} is VALID [2022-02-20 18:38:47,041 INFO L290 TraceCheckUtils]: 85: Hoare triple {82811#false} assume !!(0 == ~ep13~0 % 256); {82811#false} is VALID [2022-02-20 18:38:47,041 INFO L290 TraceCheckUtils]: 86: Hoare triple {82811#false} assume !!(0 == ~ep23~0 % 256); {82811#false} is VALID [2022-02-20 18:38:47,041 INFO L290 TraceCheckUtils]: 87: Hoare triple {82811#false} assume !(2 == ~r3~0);~mode3~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~1#1; {82811#false} is VALID [2022-02-20 18:38:47,041 INFO L290 TraceCheckUtils]: 88: Hoare triple {82811#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {82811#false} is VALID [2022-02-20 18:38:47,041 INFO L290 TraceCheckUtils]: 89: Hoare triple {82811#false} assume ~st1~0 + ~nl1~0 <= 1; {82811#false} is VALID [2022-02-20 18:38:47,041 INFO L290 TraceCheckUtils]: 90: Hoare triple {82811#false} assume ~st2~0 + ~nl2~0 <= 1; {82811#false} is VALID [2022-02-20 18:38:47,041 INFO L290 TraceCheckUtils]: 91: Hoare triple {82811#false} assume ~st3~0 + ~nl3~0 <= 1; {82811#false} is VALID [2022-02-20 18:38:47,041 INFO L290 TraceCheckUtils]: 92: Hoare triple {82811#false} assume !(~r1~0 >= 2); {82811#false} is VALID [2022-02-20 18:38:47,042 INFO L290 TraceCheckUtils]: 93: Hoare triple {82811#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1679~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1679~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {82811#false} is VALID [2022-02-20 18:38:47,042 INFO L290 TraceCheckUtils]: 94: Hoare triple {82811#false} assume 0 == main_~assert__arg~1#1 % 256; {82811#false} is VALID [2022-02-20 18:38:47,042 INFO L290 TraceCheckUtils]: 95: Hoare triple {82811#false} assume !false; {82811#false} is VALID [2022-02-20 18:38:47,042 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:38:47,042 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:47,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544857598] [2022-02-20 18:38:47,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544857598] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:47,043 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:47,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:47,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746347726] [2022-02-20 18:38:47,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:47,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-02-20 18:38:47,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:47,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:38:47,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:47,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:47,098 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:47,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:47,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:47,099 INFO L87 Difference]: Start difference. First operand 4932 states and 6941 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:38:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:58,797 INFO L93 Difference]: Finished difference Result 13644 states and 19367 transitions. [2022-02-20 18:38:58,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:58,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-02-20 18:38:58,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:58,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:38:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 949 transitions. [2022-02-20 18:38:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:38:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 949 transitions. [2022-02-20 18:38:58,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 949 transitions. [2022-02-20 18:38:59,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 949 edges. 949 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:02,785 INFO L225 Difference]: With dead ends: 13644 [2022-02-20 18:39:02,785 INFO L226 Difference]: Without dead ends: 9587 [2022-02-20 18:39:02,788 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:39:02,789 INFO L933 BasicCegarLoop]: 646 mSDtfsCounter, 305 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:02,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 981 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:02,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9587 states. [2022-02-20 18:39:04,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9587 to 4952. [2022-02-20 18:39:04,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:04,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9587 states. Second operand has 4952 states, 4950 states have (on average 1.4062626262626263) internal successors, (6961), 4951 states have internal predecessors, (6961), 0 states have call successors, (0), 0 states have 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:39:04,528 INFO L74 IsIncluded]: Start isIncluded. First operand 9587 states. Second operand has 4952 states, 4950 states have (on average 1.4062626262626263) internal successors, (6961), 4951 states have internal predecessors, (6961), 0 states have call successors, (0), 0 states have 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:39:04,531 INFO L87 Difference]: Start difference. First operand 9587 states. Second operand has 4952 states, 4950 states have (on average 1.4062626262626263) internal successors, (6961), 4951 states have internal predecessors, (6961), 0 states have call successors, (0), 0 states have 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:39:07,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:07,539 INFO L93 Difference]: Finished difference Result 9587 states and 13494 transitions. [2022-02-20 18:39:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 9587 states and 13494 transitions. [2022-02-20 18:39:07,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:07,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:07,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 4952 states, 4950 states have (on average 1.4062626262626263) internal successors, (6961), 4951 states have internal predecessors, (6961), 0 states have call successors, (0), 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 9587 states. [2022-02-20 18:39:07,555 INFO L87 Difference]: Start difference. First operand has 4952 states, 4950 states have (on average 1.4062626262626263) internal successors, (6961), 4951 states have internal predecessors, (6961), 0 states have call successors, (0), 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 9587 states. [2022-02-20 18:39:10,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:10,487 INFO L93 Difference]: Finished difference Result 9587 states and 13494 transitions. [2022-02-20 18:39:10,487 INFO L276 IsEmpty]: Start isEmpty. Operand 9587 states and 13494 transitions. [2022-02-20 18:39:10,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:10,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:10,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:10,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:10,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4952 states, 4950 states have (on average 1.4062626262626263) internal successors, (6961), 4951 states have internal predecessors, (6961), 0 states have call successors, (0), 0 states have 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:39:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4952 states to 4952 states and 6961 transitions. [2022-02-20 18:39:11,502 INFO L78 Accepts]: Start accepts. Automaton has 4952 states and 6961 transitions. Word has length 96 [2022-02-20 18:39:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:11,502 INFO L470 AbstractCegarLoop]: Abstraction has 4952 states and 6961 transitions. [2022-02-20 18:39:11,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:39:11,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4952 states and 6961 transitions. [2022-02-20 18:39:11,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-02-20 18:39:11,505 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:11,506 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, 1, 1, 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:39:11,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:39:11,506 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:11,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:11,506 INFO L85 PathProgramCache]: Analyzing trace with hash 818288789, now seen corresponding path program 1 times [2022-02-20 18:39:11,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:11,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474199124] [2022-02-20 18:39:11,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:11,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:11,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {126689#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(55, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~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_1131~0 := 0;~__return_1259~0 := 0;~__return_1679~0 := 0;~__return_1378~0 := 0;~__tmp_1379_0~0 := 0;~__return_1487~0 := 0;~__return_1392~0 := 0; {126689#true} is VALID [2022-02-20 18:39:11,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {126689#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#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_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#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; {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:11,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:11,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:11,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:11,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256); {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:11,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:11,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:11,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r211~0#1 % 256); {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:11,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:11,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:11,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r231~0#1 % 256); {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:11,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:11,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:11,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r311~0#1 % 256); {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:11,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {126691#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !(0 == main_~init__r321~0#1 % 256); {126692#(and (< (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) 256) |ULTIMATE.start_main_~init__r321~0#1|) (= ~ep32~0 |ULTIMATE.start_main_~init__r321~0#1|))} is VALID [2022-02-20 18:39:11,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {126692#(and (< (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) 256) |ULTIMATE.start_main_~init__r321~0#1|) (= ~ep32~0 |ULTIMATE.start_main_~init__r321~0#1|))} assume !!(0 == ~ep21~0 % 256);main_~init__tmp___3~0#1 := 0; {126692#(and (< (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) 256) |ULTIMATE.start_main_~init__r321~0#1|) (= ~ep32~0 |ULTIMATE.start_main_~init__r321~0#1|))} is VALID [2022-02-20 18:39:11,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {126692#(and (< (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) 256) |ULTIMATE.start_main_~init__r321~0#1|) (= ~ep32~0 |ULTIMATE.start_main_~init__r321~0#1|))} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {126692#(and (< (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) 256) |ULTIMATE.start_main_~init__r321~0#1|) (= ~ep32~0 |ULTIMATE.start_main_~init__r321~0#1|))} is VALID [2022-02-20 18:39:11,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {126692#(and (< (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) 256) |ULTIMATE.start_main_~init__r321~0#1|) (= ~ep32~0 |ULTIMATE.start_main_~init__r321~0#1|))} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id1~0 != ~id2~0; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id1~0 != ~id3~0; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id2~0 != ~id3~0; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id1~0 >= 0; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id2~0 >= 0; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id3~0 >= 0; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~r1~0; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~r2~0; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~r3~0; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r122~0#1 % 256); {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r132~0#1 % 256); {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r212~0#1 % 256); {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,652 INFO L290 TraceCheckUtils]: 32: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r232~0#1 % 256); {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r312~0#1 % 256); {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r322~0#1 % 256); {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~max1~0 == ~id1~0; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~max2~0 == ~id2~0; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~max3~0 == ~id3~0; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,653 INFO L290 TraceCheckUtils]: 38: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~st1~0; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~st2~0; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~st3~0; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,654 INFO L290 TraceCheckUtils]: 41: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~nl1~0; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,654 INFO L290 TraceCheckUtils]: 42: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~nl2~0; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,655 INFO L290 TraceCheckUtils]: 43: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~nl3~0; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,655 INFO L290 TraceCheckUtils]: 44: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~mode1~0 % 256; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,655 INFO L290 TraceCheckUtils]: 45: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~mode2~0 % 256; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,656 INFO L290 TraceCheckUtils]: 46: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1131~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1131~0; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,656 INFO L290 TraceCheckUtils]: 47: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~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; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,656 INFO L290 TraceCheckUtils]: 48: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume main_~main__i2~0#1 < 6; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,656 INFO L290 TraceCheckUtils]: 49: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~mode1~0 % 256); {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,657 INFO L290 TraceCheckUtils]: 50: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~r1~0 < 2; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,657 INFO L290 TraceCheckUtils]: 51: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep12~0 % 256); {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,657 INFO L290 TraceCheckUtils]: 52: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep13~0 % 256); {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,657 INFO L290 TraceCheckUtils]: 53: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} ~mode1~0 := 1; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,658 INFO L290 TraceCheckUtils]: 54: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~mode2~0 % 256); {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,658 INFO L290 TraceCheckUtils]: 55: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~r2~0 < 2; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,658 INFO L290 TraceCheckUtils]: 56: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep21~0 % 256); {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,659 INFO L290 TraceCheckUtils]: 57: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep23~0 % 256); {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,659 INFO L290 TraceCheckUtils]: 58: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} ~mode2~0 := 1; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,659 INFO L290 TraceCheckUtils]: 59: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~mode3~0 % 256); {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,659 INFO L290 TraceCheckUtils]: 60: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~r3~0 < 2; {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,660 INFO L290 TraceCheckUtils]: 61: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep31~0 % 256); {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:11,660 INFO L290 TraceCheckUtils]: 62: Hoare triple {126693#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep32~0 % 256); {126690#false} is VALID [2022-02-20 18:39:11,660 INFO L290 TraceCheckUtils]: 63: Hoare triple {126690#false} ~mode3~0 := 1;~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; {126690#false} is VALID [2022-02-20 18:39:11,660 INFO L290 TraceCheckUtils]: 64: Hoare triple {126690#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {126690#false} is VALID [2022-02-20 18:39:11,660 INFO L290 TraceCheckUtils]: 65: Hoare triple {126690#false} assume ~st1~0 + ~nl1~0 <= 1; {126690#false} is VALID [2022-02-20 18:39:11,661 INFO L290 TraceCheckUtils]: 66: Hoare triple {126690#false} assume ~st2~0 + ~nl2~0 <= 1; {126690#false} is VALID [2022-02-20 18:39:11,661 INFO L290 TraceCheckUtils]: 67: Hoare triple {126690#false} assume ~st3~0 + ~nl3~0 <= 1; {126690#false} is VALID [2022-02-20 18:39:11,661 INFO L290 TraceCheckUtils]: 68: Hoare triple {126690#false} assume !(~r1~0 >= 2); {126690#false} is VALID [2022-02-20 18:39:11,661 INFO L290 TraceCheckUtils]: 69: Hoare triple {126690#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {126690#false} is VALID [2022-02-20 18:39:11,661 INFO L290 TraceCheckUtils]: 70: Hoare triple {126690#false} assume ~r1~0 < 2; {126690#false} is VALID [2022-02-20 18:39:11,661 INFO L290 TraceCheckUtils]: 71: Hoare triple {126690#false} assume !(~r1~0 >= 2); {126690#false} is VALID [2022-02-20 18:39:11,664 INFO L290 TraceCheckUtils]: 72: Hoare triple {126690#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {126690#false} is VALID [2022-02-20 18:39:11,665 INFO L290 TraceCheckUtils]: 73: Hoare triple {126690#false} assume ~r1~0 < 2;main_~check__tmp~0#1 := 1;~__return_1259~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1259~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; {126690#false} is VALID [2022-02-20 18:39:11,665 INFO L290 TraceCheckUtils]: 74: Hoare triple {126690#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {126690#false} is VALID [2022-02-20 18:39:11,665 INFO L290 TraceCheckUtils]: 75: Hoare triple {126690#false} assume main_~main__i2~0#1 < 6; {126690#false} is VALID [2022-02-20 18:39:11,665 INFO L290 TraceCheckUtils]: 76: Hoare triple {126690#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {126690#false} is VALID [2022-02-20 18:39:11,665 INFO L290 TraceCheckUtils]: 77: Hoare triple {126690#false} assume !!(0 == ~ep21~0 % 256); {126690#false} is VALID [2022-02-20 18:39:11,665 INFO L290 TraceCheckUtils]: 78: Hoare triple {126690#false} assume !!(0 == ~ep31~0 % 256); {126690#false} is VALID [2022-02-20 18:39:11,665 INFO L290 TraceCheckUtils]: 79: Hoare triple {126690#false} assume 1 == ~r1~0; {126690#false} is VALID [2022-02-20 18:39:11,665 INFO L290 TraceCheckUtils]: 80: Hoare triple {126690#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0; {126690#false} is VALID [2022-02-20 18:39:11,665 INFO L290 TraceCheckUtils]: 81: Hoare triple {126690#false} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {126690#false} is VALID [2022-02-20 18:39:11,666 INFO L290 TraceCheckUtils]: 82: Hoare triple {126690#false} assume !!(0 == ~ep12~0 % 256); {126690#false} is VALID [2022-02-20 18:39:11,666 INFO L290 TraceCheckUtils]: 83: Hoare triple {126690#false} assume !!(0 == ~ep32~0 % 256); {126690#false} is VALID [2022-02-20 18:39:11,666 INFO L290 TraceCheckUtils]: 84: Hoare triple {126690#false} assume !(2 == ~r2~0);~mode2~0 := 0; {126690#false} is VALID [2022-02-20 18:39:11,666 INFO L290 TraceCheckUtils]: 85: Hoare triple {126690#false} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {126690#false} is VALID [2022-02-20 18:39:11,666 INFO L290 TraceCheckUtils]: 86: Hoare triple {126690#false} assume !!(0 == ~ep13~0 % 256); {126690#false} is VALID [2022-02-20 18:39:11,666 INFO L290 TraceCheckUtils]: 87: Hoare triple {126690#false} assume !!(0 == ~ep23~0 % 256); {126690#false} is VALID [2022-02-20 18:39:11,666 INFO L290 TraceCheckUtils]: 88: Hoare triple {126690#false} assume !(2 == ~r3~0);~mode3~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~1#1; {126690#false} is VALID [2022-02-20 18:39:11,666 INFO L290 TraceCheckUtils]: 89: Hoare triple {126690#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {126690#false} is VALID [2022-02-20 18:39:11,667 INFO L290 TraceCheckUtils]: 90: Hoare triple {126690#false} assume ~st1~0 + ~nl1~0 <= 1; {126690#false} is VALID [2022-02-20 18:39:11,667 INFO L290 TraceCheckUtils]: 91: Hoare triple {126690#false} assume ~st2~0 + ~nl2~0 <= 1; {126690#false} is VALID [2022-02-20 18:39:11,667 INFO L290 TraceCheckUtils]: 92: Hoare triple {126690#false} assume ~st3~0 + ~nl3~0 <= 1; {126690#false} is VALID [2022-02-20 18:39:11,667 INFO L290 TraceCheckUtils]: 93: Hoare triple {126690#false} assume !(~r1~0 >= 2); {126690#false} is VALID [2022-02-20 18:39:11,667 INFO L290 TraceCheckUtils]: 94: Hoare triple {126690#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1679~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1679~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {126690#false} is VALID [2022-02-20 18:39:11,667 INFO L290 TraceCheckUtils]: 95: Hoare triple {126690#false} assume 0 == main_~assert__arg~1#1 % 256; {126690#false} is VALID [2022-02-20 18:39:11,667 INFO L290 TraceCheckUtils]: 96: Hoare triple {126690#false} assume !false; {126690#false} is VALID [2022-02-20 18:39:11,668 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:39:11,668 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:11,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474199124] [2022-02-20 18:39:11,668 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474199124] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:11,668 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:11,668 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:39:11,668 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170176129] [2022-02-20 18:39:11,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:11,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2022-02-20 18:39:11,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:11,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:39:11,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:11,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:39:11,733 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:11,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:39:11,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:39:11,733 INFO L87 Difference]: Start difference. First operand 4952 states and 6961 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:39:19,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:19,126 INFO L93 Difference]: Finished difference Result 10520 states and 14601 transitions. [2022-02-20 18:39:19,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:39:19,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2022-02-20 18:39:19,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:19,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:39:19,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 953 transitions. [2022-02-20 18:39:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:39:19,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 953 transitions. [2022-02-20 18:39:19,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 953 transitions. [2022-02-20 18:39:19,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 953 edges. 953 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:20,911 INFO L225 Difference]: With dead ends: 10520 [2022-02-20 18:39:20,911 INFO L226 Difference]: Without dead ends: 5793 [2022-02-20 18:39:20,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:39:20,915 INFO L933 BasicCegarLoop]: 542 mSDtfsCounter, 721 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:20,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [721 Valid, 1154 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:20,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5793 states.